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/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:56:00,776 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:56:00,778 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:56:00,794 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:56:00,794 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:56:00,795 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:56:00,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:56:00,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:56:00,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:56:00,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:56:00,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:56:00,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:56:00,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:56:00,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:56:00,806 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:56:00,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:56:00,807 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:56:00,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:56:00,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:56:00,817 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:56:00,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:56:00,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:56:00,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:56:00,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:56:00,825 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:56:00,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:56:00,832 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:56:00,833 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:56:00,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:56:00,837 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:56:00,837 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:56:00,838 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:56:00,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:56:00,841 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:56:00,842 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:56:00,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:56:00,843 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:56:00,863 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:56:00,863 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:56:00,864 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:56:00,865 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:56:00,865 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:56:00,865 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:56:00,865 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:56:00,865 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:56:00,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:56:00,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:56:00,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:56:00,935 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:56:00,936 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:56:00,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2018-07-23 13:56:00,937 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2018-07-23 13:56:00,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:56:00,996 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:56:00,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:56:00,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:56:00,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:56:01,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:56:01,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:56:01,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:56:01,051 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:56:01,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/1) ... [2018-07-23 13:56:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2018-07-23 13:56:01,135 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2018-07-23 13:56:01,291 INFO L258 CfgBuilder]: Using library mode [2018-07-23 13:56:01,292 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:56:01 BoogieIcfgContainer [2018-07-23 13:56:01,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:56:01,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:56:01,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:56:01,299 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:56:01,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:56:00" (1/2) ... [2018-07-23 13:56:01,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb828e0 and model type doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:56:01, skipping insertion in model container [2018-07-23 13:56:01,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:56:01" (2/2) ... [2018-07-23 13:56:01,305 INFO L112 eAbstractionObserver]: Analyzing ICFG doubleLoopUniformIterations.bpl [2018-07-23 13:56:01,318 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:56:01,329 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-07-23 13:56:01,382 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:56:01,383 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:56:01,383 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:56:01,384 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:56:01,384 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:56:01,384 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:56:01,384 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:56:01,384 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:56:01,385 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:56:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-07-23 13:56:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 13:56:01,412 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:01,413 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 13:56:01,413 INFO L414 AbstractCegarLoop]: === Iteration 1 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash 926725, now seen corresponding path program 1 times [2018-07-23 13:56:01,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:01,488 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:56:01,491 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:56:01,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-23 13:56:01,493 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:01,494 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:56:01,494 INFO L185 omatonBuilderFactory]: Interpolants [11#true, 12#false, 13#(= Main_x 0)] [2018-07-23 13:56:01,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:56:01,496 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:56:01,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:56:01,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:56:01,514 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-07-23 13:56:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:01,557 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-07-23 13:56:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:56:01,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 13:56:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:01,569 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:56:01,569 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:56:01,573 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:56:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:56:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:56:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:56:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-07-23 13:56:01,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2018-07-23 13:56:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:01,622 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-07-23 13:56:01,623 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:56:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-07-23 13:56:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:56:01,624 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:01,624 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 13:56:01,624 INFO L414 AbstractCegarLoop]: === Iteration 2 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash 28728519, now seen corresponding path program 1 times [2018-07-23 13:56:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:01,636 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:56:01,636 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:56:01,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-23 13:56:01,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:01,637 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:56:01,637 INFO L185 omatonBuilderFactory]: Interpolants [60#true, 61#false, 62#(= Main_y 0)] [2018-07-23 13:56:01,638 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:56:01,640 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:56:01,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:56:01,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:56:01,641 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 3 states. [2018-07-23 13:56:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:01,652 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:56:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:56:01,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-07-23 13:56:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:01,653 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:56:01,653 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:56:01,655 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:56:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:56:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:56:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:56:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-07-23 13:56:01,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-07-23 13:56:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:01,658 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-07-23 13:56:01,658 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:56:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-07-23 13:56:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:56:01,659 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:01,660 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:56:01,660 INFO L414 AbstractCegarLoop]: === Iteration 3 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:01,660 INFO L82 PathProgramCache]: Analyzing trace with hash 891297133, now seen corresponding path program 1 times [2018-07-23 13:56:01,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,701 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:56:01,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:56:01,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:01,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:56:01,704 INFO L185 omatonBuilderFactory]: Interpolants [99#true, 100#false, 101#(<= 0 Main_x), 102#(<= 1 Main_x)] [2018-07-23 13:56:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,705 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:56:01,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:56:01,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:56:01,706 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-07-23 13:56:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:01,741 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 13:56:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:56:01,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:56:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:01,742 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:56:01,742 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:56:01,743 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:56:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:56:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:56:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:56:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-07-23 13:56:01,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-07-23 13:56:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:01,747 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-07-23 13:56:01,747 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:56:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-07-23 13:56:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:56:01,748 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:01,748 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:56:01,748 INFO L414 AbstractCegarLoop]: === Iteration 4 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:01,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1860345825, now seen corresponding path program 1 times [2018-07-23 13:56:01,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:01,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-23 13:56:01,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:01,821 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:56:01,821 INFO L185 omatonBuilderFactory]: Interpolants [144#(and (<= 1 Main_y) (<= Main_y 1)), 141#true, 142#false, 143#(and (<= 0 Main_y) (<= Main_y 0))] [2018-07-23 13:56:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,824 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:56:01,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:56:01,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:56:01,825 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-07-23 13:56:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:01,849 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-07-23 13:56:01,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:56:01,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-07-23 13:56:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:01,850 INFO L225 Difference]: With dead ends: 14 [2018-07-23 13:56:01,850 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:56:01,851 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:56:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:56:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-07-23 13:56:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:56:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-07-23 13:56:01,855 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-07-23 13:56:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:01,856 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-07-23 13:56:01,856 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:56:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-07-23 13:56:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:56:01,857 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:01,857 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:56:01,857 INFO L414 AbstractCegarLoop]: === Iteration 5 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1836084205, now seen corresponding path program 2 times [2018-07-23 13:56:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:01,882 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:56:01,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:01,884 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:56:01,884 INFO L185 omatonBuilderFactory]: Interpolants [193#true, 194#false, 195#(<= Main_x 0), 196#(<= Main_x 1), 197#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,885 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:56:01,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:56:01,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:56:01,886 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-07-23 13:56:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:01,913 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-07-23 13:56:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:56:01,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 13:56:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:01,915 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:56:01,915 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 13:56:01,915 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:56:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 13:56:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 13:56:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 13:56:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-07-23 13:56:01,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-07-23 13:56:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:01,920 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-07-23 13:56:01,920 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:56:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-07-23 13:56:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 13:56:01,921 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:01,921 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-23 13:56:01,921 INFO L414 AbstractCegarLoop]: === Iteration 6 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1860095751, now seen corresponding path program 3 times [2018-07-23 13:56:01,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,949 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:01,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:56:01,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:01,950 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:56:01,950 INFO L185 omatonBuilderFactory]: Interpolants [246#true, 247#false, 248#(<= 0 Main_x), 249#(<= 1 Main_x), 250#(<= 2 Main_x)] [2018-07-23 13:56:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:01,951 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:56:01,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:56:01,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:56:01,952 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-07-23 13:56:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:01,999 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-23 13:56:01,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:56:02,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 13:56:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,000 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:56:02,000 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 13:56:02,001 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:56:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 13:56:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-23 13:56:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-23 13:56:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-07-23 13:56:02,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-07-23 13:56:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,014 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-07-23 13:56:02,015 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:56:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-07-23 13:56:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-23 13:56:02,015 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,016 INFO L357 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,016 INFO L414 AbstractCegarLoop]: === Iteration 7 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1828331911, now seen corresponding path program 4 times [2018-07-23 13:56:02,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,093 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:56:02,094 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,094 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:56:02,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,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:56:02,095 INFO L185 omatonBuilderFactory]: Interpolants [297#true, 298#false, 299#(and (<= 0 Main_y) (<= Main_y 0)), 300#(and (<= 1 Main_y) (<= Main_y 1)), 301#(and (<= Main_y 2) (<= 2 Main_y))] [2018-07-23 13:56:02,095 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:56:02,099 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:56:02,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:56:02,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:56:02,100 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2018-07-23 13:56:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,123 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-07-23 13:56:02,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:56:02,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-07-23 13:56:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,125 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:56:02,125 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:56:02,126 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:56:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:56:02,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-07-23 13:56:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:56:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-07-23 13:56:02,131 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-07-23 13:56:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,132 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-07-23 13:56:02,132 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:56:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-07-23 13:56:02,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:56:02,133 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,133 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,133 INFO L414 AbstractCegarLoop]: === Iteration 8 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash 843652871, now seen corresponding path program 5 times [2018-07-23 13:56:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:56:02,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,158 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:56:02,158 INFO L185 omatonBuilderFactory]: Interpolants [360#true, 361#false, 362#(<= Main_x 0), 363#(<= Main_x 1), 364#(<= Main_x 2), 365#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,159 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:56:02,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:56:02,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:56:02,160 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 6 states. [2018-07-23 13:56:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,179 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-07-23 13:56:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:56:02,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 13:56:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,180 INFO L225 Difference]: With dead ends: 18 [2018-07-23 13:56:02,180 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 13:56:02,181 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:56:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 13:56:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 13:56:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 13:56:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-07-23 13:56:02,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-07-23 13:56:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,187 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-07-23 13:56:02,187 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:56:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-07-23 13:56:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:56:02,188 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,188 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,188 INFO L414 AbstractCegarLoop]: === Iteration 9 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1588010797, now seen corresponding path program 6 times [2018-07-23 13:56:02,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,220 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:56:02,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,223 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:56:02,224 INFO L185 omatonBuilderFactory]: Interpolants [424#true, 425#false, 426#(<= 0 Main_x), 427#(<= 1 Main_x), 428#(<= 2 Main_x), 429#(<= 3 Main_x)] [2018-07-23 13:56:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,226 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:56:02,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:56:02,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:56:02,228 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-07-23 13:56:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,268 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-07-23 13:56:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:56:02,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 13:56:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,269 INFO L225 Difference]: With dead ends: 15 [2018-07-23 13:56:02,269 INFO L226 Difference]: Without dead ends: 12 [2018-07-23 13:56:02,270 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:56:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-23 13:56:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-23 13:56:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:56:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-07-23 13:56:02,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-07-23 13:56:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,283 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-07-23 13:56:02,283 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:56:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-07-23 13:56:02,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:56:02,284 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,284 INFO L357 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,284 INFO L414 AbstractCegarLoop]: === Iteration 10 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1983632929, now seen corresponding path program 7 times [2018-07-23 13:56:02,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,356 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:56:02,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,357 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:56:02,358 INFO L185 omatonBuilderFactory]: Interpolants [484#true, 485#false, 486#(and (<= 0 Main_y) (<= Main_y 0)), 487#(and (<= 1 Main_y) (<= Main_y 1)), 488#(and (<= Main_y 2) (<= 2 Main_y)), 489#(and (<= Main_y 3) (<= 3 Main_y))] [2018-07-23 13:56:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,359 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:56:02,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:56:02,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:56:02,360 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2018-07-23 13:56:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,394 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-07-23 13:56:02,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:56:02,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-07-23 13:56:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,395 INFO L225 Difference]: With dead ends: 20 [2018-07-23 13:56:02,395 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:56:02,396 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:56:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:56:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-07-23 13:56:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:56:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-07-23 13:56:02,402 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-07-23 13:56:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,403 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-07-23 13:56:02,403 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:56:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-07-23 13:56:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:56:02,404 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,404 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,404 INFO L414 AbstractCegarLoop]: === Iteration 11 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1363017133, now seen corresponding path program 8 times [2018-07-23 13:56:02,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:56:02,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,442 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:56:02,442 INFO L185 omatonBuilderFactory]: Interpolants [560#(<= Main_x 0), 561#(<= Main_x 1), 562#(<= Main_x 2), 563#(<= Main_x 3), 564#(<= (+ Main_x 1) 0), 558#true, 559#false] [2018-07-23 13:56:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,443 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:56:02,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:56:02,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:56:02,444 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2018-07-23 13:56:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,463 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-07-23 13:56:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:56:02,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:56:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,466 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:56:02,466 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 13:56:02,467 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:56:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 13:56:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 13:56:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 13:56:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-07-23 13:56:02,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-07-23 13:56:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,477 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-07-23 13:56:02,477 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:56:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-07-23 13:56:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 13:56:02,478 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,478 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,478 INFO L414 AbstractCegarLoop]: === Iteration 12 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1331690937, now seen corresponding path program 9 times [2018-07-23 13:56:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:56:02,519 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,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:56:02,525 INFO L185 omatonBuilderFactory]: Interpolants [633#true, 634#false, 635#(<= 0 Main_x), 636#(<= 1 Main_x), 637#(<= 2 Main_x), 638#(<= 3 Main_x), 639#(<= 4 Main_x)] [2018-07-23 13:56:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,525 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:56:02,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:56:02,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:56:02,526 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-07-23 13:56:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,544 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-07-23 13:56:02,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:56:02,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 13:56:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,545 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:56:02,546 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:56:02,546 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:56:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:56:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:56:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:56:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-07-23 13:56:02,551 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-07-23 13:56:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,552 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-07-23 13:56:02,552 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:56:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-07-23 13:56:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:56:02,553 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,553 INFO L357 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,553 INFO L414 AbstractCegarLoop]: === Iteration 13 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1667192391, now seen corresponding path program 10 times [2018-07-23 13:56:02,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:56:02,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,610 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:56:02,610 INFO L185 omatonBuilderFactory]: Interpolants [704#(and (<= 0 Main_y) (<= Main_y 0)), 705#(and (<= 1 Main_y) (<= Main_y 1)), 706#(and (<= Main_y 2) (<= 2 Main_y)), 707#(and (<= Main_y 3) (<= 3 Main_y)), 708#(and (<= Main_y 4) (<= 4 Main_y)), 702#true, 703#false] [2018-07-23 13:56:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,614 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:56:02,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:56:02,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:56:02,615 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-07-23 13:56:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,668 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-07-23 13:56:02,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:56:02,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-07-23 13:56:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,673 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:56:02,673 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:56:02,674 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:56:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:56:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-07-23 13:56:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:56:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-07-23 13:56:02,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-07-23 13:56:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,687 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-07-23 13:56:02,687 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:56:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-07-23 13:56:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:56:02,688 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,689 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,689 INFO L414 AbstractCegarLoop]: === Iteration 14 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash 143295047, now seen corresponding path program 11 times [2018-07-23 13:56:02,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:56:02,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,717 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:56:02,717 INFO L185 omatonBuilderFactory]: Interpolants [787#true, 788#false, 789#(<= Main_x 0), 790#(<= Main_x 1), 791#(<= Main_x 2), 792#(<= Main_x 3), 793#(<= Main_x 4), 794#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,718 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:56:02,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:56:02,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:56:02,719 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2018-07-23 13:56:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,736 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-07-23 13:56:02,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:56:02,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:56:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,737 INFO L225 Difference]: With dead ends: 24 [2018-07-23 13:56:02,738 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:56:02,738 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:56:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:56:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 13:56:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 13:56:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-07-23 13:56:02,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-07-23 13:56:02,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,746 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-07-23 13:56:02,746 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:56:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-07-23 13:56:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 13:56:02,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,749 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,749 INFO L414 AbstractCegarLoop]: === Iteration 15 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1788276499, now seen corresponding path program 12 times [2018-07-23 13:56:02,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:56:02,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,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:56:02,802 INFO L185 omatonBuilderFactory]: Interpolants [880#(<= 5 Main_x), 873#true, 874#false, 875#(<= 0 Main_x), 876#(<= 1 Main_x), 877#(<= 2 Main_x), 878#(<= 3 Main_x), 879#(<= 4 Main_x)] [2018-07-23 13:56:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,803 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:56:02,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:56:02,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:56:02,804 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-07-23 13:56:02,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,820 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-07-23 13:56:02,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:56:02,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 13:56:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,821 INFO L225 Difference]: With dead ends: 19 [2018-07-23 13:56:02,821 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:56:02,822 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:56:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:56:02,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:56:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:56:02,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-07-23 13:56:02,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-07-23 13:56:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,828 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-07-23 13:56:02,828 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:56:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-07-23 13:56:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:56:02,829 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,829 INFO L357 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,829 INFO L414 AbstractCegarLoop]: === Iteration 16 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash 397941857, now seen corresponding path program 13 times [2018-07-23 13:56:02,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:56:02,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,876 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:56:02,876 INFO L185 omatonBuilderFactory]: Interpolants [951#true, 952#false, 953#(and (<= 0 Main_y) (<= Main_y 0)), 954#(and (<= 1 Main_y) (<= Main_y 1)), 955#(and (<= Main_y 2) (<= 2 Main_y)), 956#(and (<= Main_y 3) (<= 3 Main_y)), 957#(and (<= Main_y 4) (<= 4 Main_y)), 958#(and (<= Main_y 5) (<= 5 Main_y))] [2018-07-23 13:56:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,877 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:56:02,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:56:02,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:56:02,878 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2018-07-23 13:56:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:02,924 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-07-23 13:56:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:56:02,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-07-23 13:56:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:02,926 INFO L225 Difference]: With dead ends: 26 [2018-07-23 13:56:02,926 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:56:02,926 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:56:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:56:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-07-23 13:56:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:56:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-07-23 13:56:02,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-07-23 13:56:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:02,941 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-07-23 13:56:02,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:56:02,942 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-07-23 13:56:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:56:02,942 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:02,944 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-07-23 13:56:02,944 INFO L414 AbstractCegarLoop]: === Iteration 17 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:02,945 INFO L82 PathProgramCache]: Analyzing trace with hash -548765843, now seen corresponding path program 14 times [2018-07-23 13:56:02,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,983 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:02,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:56:02,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:02,983 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:56:02,984 INFO L185 omatonBuilderFactory]: Interpolants [1047#true, 1048#false, 1049#(<= Main_x 0), 1050#(<= Main_x 1), 1051#(<= Main_x 2), 1052#(<= Main_x 3), 1053#(<= Main_x 4), 1054#(<= Main_x 5), 1055#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:02,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:56:02,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:56:02,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:56:02,985 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2018-07-23 13:56:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,003 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-07-23 13:56:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:56:03,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:56:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,004 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:56:03,004 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 13:56:03,005 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:56:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 13:56:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 13:56:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 13:56:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-07-23 13:56:03,011 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-07-23 13:56:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,011 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-07-23 13:56:03,011 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:56:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-07-23 13:56:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 13:56:03,012 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,012 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,012 INFO L414 AbstractCegarLoop]: === Iteration 18 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash -297941625, now seen corresponding path program 15 times [2018-07-23 13:56:03,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:56:03,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,037 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:56:03,037 INFO L185 omatonBuilderFactory]: Interpolants [1152#(<= 6 Main_x), 1144#true, 1145#false, 1146#(<= 0 Main_x), 1147#(<= 1 Main_x), 1148#(<= 2 Main_x), 1149#(<= 3 Main_x), 1150#(<= 4 Main_x), 1151#(<= 5 Main_x)] [2018-07-23 13:56:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,038 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:56:03,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:56:03,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:56:03,039 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-07-23 13:56:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,054 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-07-23 13:56:03,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:56:03,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 13:56:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,056 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:56:03,056 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 13:56:03,056 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:56:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 13:56:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-23 13:56:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-23 13:56:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-07-23 13:56:03,062 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-07-23 13:56:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,062 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-07-23 13:56:03,063 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:56:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-07-23 13:56:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:56:03,063 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,064 INFO L357 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,064 INFO L414 AbstractCegarLoop]: === Iteration 19 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,064 INFO L82 PathProgramCache]: Analyzing trace with hash -646317305, now seen corresponding path program 16 times [2018-07-23 13:56:03,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:56:03,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,102 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:56:03,103 INFO L185 omatonBuilderFactory]: Interpolants [1232#false, 1233#(and (<= 0 Main_y) (<= Main_y 0)), 1234#(and (<= 1 Main_y) (<= Main_y 1)), 1235#(and (<= Main_y 2) (<= 2 Main_y)), 1236#(and (<= Main_y 3) (<= 3 Main_y)), 1237#(and (<= Main_y 4) (<= 4 Main_y)), 1238#(and (<= Main_y 5) (<= 5 Main_y)), 1239#(and (<= Main_y 6) (<= 6 Main_y)), 1231#true] [2018-07-23 13:56:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:56:03,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:56:03,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:56:03,104 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2018-07-23 13:56:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,140 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-07-23 13:56:03,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:56:03,141 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-07-23 13:56:03,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,141 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:56:03,141 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 13:56:03,142 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:56:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 13:56:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-07-23 13:56:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:56:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-07-23 13:56:03,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-07-23 13:56:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,150 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-07-23 13:56:03,150 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:56:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-07-23 13:56:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:56:03,151 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,151 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,151 INFO L414 AbstractCegarLoop]: === Iteration 20 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1438938503, now seen corresponding path program 17 times [2018-07-23 13:56:03,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,179 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:56:03,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,180 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:56:03,180 INFO L185 omatonBuilderFactory]: Interpolants [1344#(<= Main_x 4), 1345#(<= Main_x 5), 1346#(<= Main_x 6), 1347#(<= (+ Main_x 1) 0), 1338#true, 1339#false, 1340#(<= Main_x 0), 1341#(<= Main_x 1), 1342#(<= Main_x 2), 1343#(<= Main_x 3)] [2018-07-23 13:56:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,181 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:56:03,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:56:03,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:56:03,182 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2018-07-23 13:56:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,205 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-07-23 13:56:03,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:56:03,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:56:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,206 INFO L225 Difference]: With dead ends: 30 [2018-07-23 13:56:03,206 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 13:56:03,207 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:56:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 13:56:03,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 13:56:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 13:56:03,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-07-23 13:56:03,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-07-23 13:56:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,214 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-07-23 13:56:03,214 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:56:03,215 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-07-23 13:56:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 13:56:03,215 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,215 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,216 INFO L414 AbstractCegarLoop]: === Iteration 21 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 624554669, now seen corresponding path program 18 times [2018-07-23 13:56:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:56:03,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,245 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:56:03,246 INFO L185 omatonBuilderFactory]: Interpolants [1446#true, 1447#false, 1448#(<= 0 Main_x), 1449#(<= 1 Main_x), 1450#(<= 2 Main_x), 1451#(<= 3 Main_x), 1452#(<= 4 Main_x), 1453#(<= 5 Main_x), 1454#(<= 6 Main_x), 1455#(<= 7 Main_x)] [2018-07-23 13:56:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:56:03,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:56:03,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:56:03,247 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-07-23 13:56:03,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,273 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-07-23 13:56:03,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:56:03,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 13:56:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,275 INFO L225 Difference]: With dead ends: 23 [2018-07-23 13:56:03,275 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:56:03,276 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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:56:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:56:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:56:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:56:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-07-23 13:56:03,283 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-07-23 13:56:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,283 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-07-23 13:56:03,284 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:56:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-07-23 13:56:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-23 13:56:03,285 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,285 INFO L357 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,285 INFO L414 AbstractCegarLoop]: === Iteration 22 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2113703263, now seen corresponding path program 19 times [2018-07-23 13:56:03,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:56:03,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,343 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:56:03,343 INFO L185 omatonBuilderFactory]: Interpolants [1542#true, 1543#false, 1544#(and (<= 0 Main_y) (<= Main_y 0)), 1545#(and (<= 1 Main_y) (<= Main_y 1)), 1546#(and (<= Main_y 2) (<= 2 Main_y)), 1547#(and (<= Main_y 3) (<= 3 Main_y)), 1548#(and (<= Main_y 4) (<= 4 Main_y)), 1549#(and (<= Main_y 5) (<= 5 Main_y)), 1550#(and (<= Main_y 6) (<= 6 Main_y)), 1551#(and (<= 7 Main_y) (<= Main_y 7))] [2018-07-23 13:56:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,344 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:56:03,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:56:03,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:56:03,345 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2018-07-23 13:56:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,391 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-07-23 13:56:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:56:03,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-07-23 13:56:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,393 INFO L225 Difference]: With dead ends: 32 [2018-07-23 13:56:03,393 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:56:03,396 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:56:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:56:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-07-23 13:56:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:56:03,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-07-23 13:56:03,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-07-23 13:56:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-07-23 13:56:03,406 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:56:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-07-23 13:56:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:56:03,407 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,407 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,407 INFO L414 AbstractCegarLoop]: === Iteration 23 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1100353235, now seen corresponding path program 20 times [2018-07-23 13:56:03,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:56:03,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,456 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:56:03,456 INFO L185 omatonBuilderFactory]: Interpolants [1664#(<= Main_x 2), 1665#(<= Main_x 3), 1666#(<= Main_x 4), 1667#(<= Main_x 5), 1668#(<= Main_x 6), 1669#(<= Main_x 7), 1670#(<= (+ Main_x 1) 0), 1660#true, 1661#false, 1662#(<= Main_x 0), 1663#(<= Main_x 1)] [2018-07-23 13:56:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,456 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:56:03,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:56:03,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:56:03,457 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2018-07-23 13:56:03,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,479 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-07-23 13:56:03,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:56:03,480 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 13:56:03,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,480 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:56:03,480 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 13:56:03,481 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:56:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 13:56:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 13:56:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 13:56:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-07-23 13:56:03,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-07-23 13:56:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-07-23 13:56:03,489 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:56:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-07-23 13:56:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 13:56:03,490 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,490 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,490 INFO L414 AbstractCegarLoop]: === Iteration 24 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,491 INFO L82 PathProgramCache]: Analyzing trace with hash -576448313, now seen corresponding path program 21 times [2018-07-23 13:56:03,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,520 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:56:03,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,521 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:56:03,522 INFO L185 omatonBuilderFactory]: Interpolants [1779#true, 1780#false, 1781#(<= 0 Main_x), 1782#(<= 1 Main_x), 1783#(<= 2 Main_x), 1784#(<= 3 Main_x), 1785#(<= 4 Main_x), 1786#(<= 5 Main_x), 1787#(<= 6 Main_x), 1788#(<= 7 Main_x), 1789#(<= 8 Main_x)] [2018-07-23 13:56:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,522 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:56:03,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:56:03,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:56:03,523 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-07-23 13:56:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,541 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-07-23 13:56:03,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:56:03,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 13:56:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,542 INFO L225 Difference]: With dead ends: 25 [2018-07-23 13:56:03,542 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 13:56:03,542 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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:56:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 13:56:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-23 13:56:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:56:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-07-23 13:56:03,550 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-07-23 13:56:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,551 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-07-23 13:56:03,552 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:56:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-07-23 13:56:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:56:03,552 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,552 INFO L357 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,553 INFO L414 AbstractCegarLoop]: === Iteration 25 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash -690090041, now seen corresponding path program 22 times [2018-07-23 13:56:03,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:56:03,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,609 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:56:03,610 INFO L185 omatonBuilderFactory]: Interpolants [1888#(and (<= Main_y 2) (<= 2 Main_y)), 1889#(and (<= Main_y 3) (<= 3 Main_y)), 1890#(and (<= Main_y 4) (<= 4 Main_y)), 1891#(and (<= Main_y 5) (<= 5 Main_y)), 1892#(and (<= Main_y 6) (<= 6 Main_y)), 1893#(and (<= 7 Main_y) (<= Main_y 7)), 1894#(and (<= 8 Main_y) (<= Main_y 8)), 1884#true, 1885#false, 1886#(and (<= 0 Main_y) (<= Main_y 0)), 1887#(and (<= 1 Main_y) (<= Main_y 1))] [2018-07-23 13:56:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,610 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:56:03,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:56:03,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:56:03,611 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2018-07-23 13:56:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,666 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-07-23 13:56:03,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:56:03,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-07-23 13:56:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,667 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:56:03,668 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:56:03,668 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:56:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:56:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-07-23 13:56:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:56:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-07-23 13:56:03,677 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-07-23 13:56:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,677 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-07-23 13:56:03,678 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:56:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-07-23 13:56:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:56:03,679 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,679 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,680 INFO L414 AbstractCegarLoop]: === Iteration 26 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 81983687, now seen corresponding path program 23 times [2018-07-23 13:56:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:56:03,721 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,722 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:56:03,722 INFO L185 omatonBuilderFactory]: Interpolants [2016#(<= Main_x 1), 2017#(<= Main_x 2), 2018#(<= Main_x 3), 2019#(<= Main_x 4), 2020#(<= Main_x 5), 2021#(<= Main_x 6), 2022#(<= Main_x 7), 2023#(<= Main_x 8), 2024#(<= (+ Main_x 1) 0), 2013#true, 2014#false, 2015#(<= Main_x 0)] [2018-07-23 13:56:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,723 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:56:03,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:56:03,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:56:03,724 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2018-07-23 13:56:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,755 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-07-23 13:56:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:56:03,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 13:56:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,756 INFO L225 Difference]: With dead ends: 36 [2018-07-23 13:56:03,756 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 13:56:03,757 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:56:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 13:56:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 13:56:03,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 13:56:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-07-23 13:56:03,771 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-07-23 13:56:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,771 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-07-23 13:56:03,771 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:56:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-07-23 13:56:03,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:56:03,773 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,773 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,773 INFO L414 AbstractCegarLoop]: === Iteration 27 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash -856832915, now seen corresponding path program 24 times [2018-07-23 13:56:03,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:56:03,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,813 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:56:03,814 INFO L185 omatonBuilderFactory]: Interpolants [2144#false, 2145#(<= 0 Main_x), 2146#(<= 1 Main_x), 2147#(<= 2 Main_x), 2148#(<= 3 Main_x), 2149#(<= 4 Main_x), 2150#(<= 5 Main_x), 2151#(<= 6 Main_x), 2152#(<= 7 Main_x), 2153#(<= 8 Main_x), 2154#(<= 9 Main_x), 2143#true] [2018-07-23 13:56:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:56:03,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:56:03,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:56:03,815 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-07-23 13:56:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,836 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-07-23 13:56:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:56:03,836 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 13:56:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,837 INFO L225 Difference]: With dead ends: 27 [2018-07-23 13:56:03,837 INFO L226 Difference]: Without dead ends: 24 [2018-07-23 13:56:03,838 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 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:56:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-23 13:56:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-23 13:56:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-23 13:56:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-07-23 13:56:03,848 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-07-23 13:56:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:03,848 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-07-23 13:56:03,848 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:56:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-07-23 13:56:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-23 13:56:03,849 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:03,849 INFO L357 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2018-07-23 13:56:03,853 INFO L414 AbstractCegarLoop]: === Iteration 28 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:03,853 INFO L82 PathProgramCache]: Analyzing trace with hash -792078111, now seen corresponding path program 25 times [2018-07-23 13:56:03,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:03,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:56:03,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:03,922 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:56:03,922 INFO L185 omatonBuilderFactory]: Interpolants [2257#true, 2258#false, 2259#(and (<= 0 Main_y) (<= Main_y 0)), 2260#(and (<= 1 Main_y) (<= Main_y 1)), 2261#(and (<= Main_y 2) (<= 2 Main_y)), 2262#(and (<= Main_y 3) (<= 3 Main_y)), 2263#(and (<= Main_y 4) (<= 4 Main_y)), 2264#(and (<= Main_y 5) (<= 5 Main_y)), 2265#(and (<= Main_y 6) (<= 6 Main_y)), 2266#(and (<= 7 Main_y) (<= Main_y 7)), 2267#(and (<= 8 Main_y) (<= Main_y 8)), 2268#(and (<= Main_y 9) (<= 9 Main_y))] [2018-07-23 13:56:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:03,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:56:03,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:56:03,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:56:03,924 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-07-23 13:56:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:03,989 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-07-23 13:56:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:56:03,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-07-23 13:56:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:03,990 INFO L225 Difference]: With dead ends: 38 [2018-07-23 13:56:03,991 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:56:03,991 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:56:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:56:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-07-23 13:56:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:56:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-07-23 13:56:04,003 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-07-23 13:56:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,003 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-07-23 13:56:04,004 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:56:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-07-23 13:56:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:56:04,005 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,005 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,005 INFO L414 AbstractCegarLoop]: === Iteration 29 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1215320813, now seen corresponding path program 26 times [2018-07-23 13:56:04,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,045 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,045 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:56:04,045 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,045 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:56:04,046 INFO L185 omatonBuilderFactory]: Interpolants [2400#(<= Main_x 1), 2401#(<= Main_x 2), 2402#(<= Main_x 3), 2403#(<= Main_x 4), 2404#(<= Main_x 5), 2405#(<= Main_x 6), 2406#(<= Main_x 7), 2407#(<= Main_x 8), 2408#(<= Main_x 9), 2409#(<= (+ Main_x 1) 0), 2397#true, 2398#false, 2399#(<= Main_x 0)] [2018-07-23 13:56:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,048 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:56:04,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:56:04,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:56:04,049 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2018-07-23 13:56:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,082 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-07-23 13:56:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:56:04,082 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 13:56:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,083 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:56:04,083 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:56:04,084 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:56:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:56:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:56:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:56:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-07-23 13:56:04,098 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-07-23 13:56:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,098 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-07-23 13:56:04,099 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:56:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-07-23 13:56:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 13:56:04,099 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,099 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,100 INFO L414 AbstractCegarLoop]: === Iteration 30 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2118190073, now seen corresponding path program 27 times [2018-07-23 13:56:04,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:56:04,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,160 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:56:04,161 INFO L185 omatonBuilderFactory]: Interpolants [2538#true, 2539#false, 2540#(<= 0 Main_x), 2541#(<= 1 Main_x), 2542#(<= 2 Main_x), 2543#(<= 3 Main_x), 2544#(<= 4 Main_x), 2545#(<= 5 Main_x), 2546#(<= 6 Main_x), 2547#(<= 7 Main_x), 2548#(<= 8 Main_x), 2549#(<= 9 Main_x), 2550#(<= 10 Main_x)] [2018-07-23 13:56:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,162 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:56:04,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:56:04,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:56:04,163 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-07-23 13:56:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,187 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-07-23 13:56:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:56:04,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 13:56:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,188 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:56:04,188 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 13:56:04,189 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 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:56:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 13:56:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-23 13:56:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-23 13:56:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-07-23 13:56:04,200 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-07-23 13:56:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,203 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-07-23 13:56:04,204 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:56:04,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-07-23 13:56:04,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-23 13:56:04,205 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,205 INFO L357 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,205 INFO L414 AbstractCegarLoop]: === Iteration 31 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1239444345, now seen corresponding path program 28 times [2018-07-23 13:56:04,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:56:04,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,273 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:56:04,273 INFO L185 omatonBuilderFactory]: Interpolants [2661#true, 2662#false, 2663#(and (<= 0 Main_y) (<= Main_y 0)), 2664#(and (<= 1 Main_y) (<= Main_y 1)), 2665#(and (<= Main_y 2) (<= 2 Main_y)), 2666#(and (<= Main_y 3) (<= 3 Main_y)), 2667#(and (<= Main_y 4) (<= 4 Main_y)), 2668#(and (<= Main_y 5) (<= 5 Main_y)), 2669#(and (<= Main_y 6) (<= 6 Main_y)), 2670#(and (<= 7 Main_y) (<= Main_y 7)), 2671#(and (<= 8 Main_y) (<= Main_y 8)), 2672#(and (<= Main_y 9) (<= 9 Main_y)), 2673#(and (<= 10 Main_y) (<= Main_y 10))] [2018-07-23 13:56:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,274 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:56:04,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:56:04,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:56:04,275 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2018-07-23 13:56:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,349 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-07-23 13:56:04,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:56:04,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-07-23 13:56:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,350 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:56:04,350 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:56:04,351 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:56:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:56:04,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-07-23 13:56:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:56:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-07-23 13:56:04,368 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-07-23 13:56:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,368 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-07-23 13:56:04,369 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:56:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-07-23 13:56:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:56:04,369 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,370 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,370 INFO L414 AbstractCegarLoop]: === Iteration 32 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash 231869447, now seen corresponding path program 29 times [2018-07-23 13:56:04,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,409 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,409 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:56:04,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,409 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:56:04,410 INFO L185 omatonBuilderFactory]: Interpolants [2816#(<= Main_x 2), 2817#(<= Main_x 3), 2818#(<= Main_x 4), 2819#(<= Main_x 5), 2820#(<= Main_x 6), 2821#(<= Main_x 7), 2822#(<= Main_x 8), 2823#(<= Main_x 9), 2824#(<= Main_x 10), 2825#(<= (+ Main_x 1) 0), 2812#true, 2813#false, 2814#(<= Main_x 0), 2815#(<= Main_x 1)] [2018-07-23 13:56:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,410 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:56:04,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:56:04,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:56:04,411 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-07-23 13:56:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,444 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-07-23 13:56:04,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:56:04,445 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 13:56:04,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,446 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:56:04,446 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:56:04,447 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:56:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:56:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 13:56:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 13:56:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-07-23 13:56:04,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-07-23 13:56:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,462 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-07-23 13:56:04,462 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:56:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-07-23 13:56:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 13:56:04,463 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,463 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,463 INFO L414 AbstractCegarLoop]: === Iteration 33 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash -27752915, now seen corresponding path program 30 times [2018-07-23 13:56:04,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,511 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,511 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:56:04,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,511 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:56:04,512 INFO L185 omatonBuilderFactory]: Interpolants [2976#(<= 10 Main_x), 2977#(<= 11 Main_x), 2964#true, 2965#false, 2966#(<= 0 Main_x), 2967#(<= 1 Main_x), 2968#(<= 2 Main_x), 2969#(<= 3 Main_x), 2970#(<= 4 Main_x), 2971#(<= 5 Main_x), 2972#(<= 6 Main_x), 2973#(<= 7 Main_x), 2974#(<= 8 Main_x), 2975#(<= 9 Main_x)] [2018-07-23 13:56:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,512 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:56:04,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:56:04,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:56:04,514 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-07-23 13:56:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,537 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-07-23 13:56:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:56:04,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 13:56:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,538 INFO L225 Difference]: With dead ends: 31 [2018-07-23 13:56:04,538 INFO L226 Difference]: Without dead ends: 28 [2018-07-23 13:56:04,539 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 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:56:04,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-23 13:56:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-23 13:56:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:56:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-07-23 13:56:04,551 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-07-23 13:56:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,551 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-07-23 13:56:04,551 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:56:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-07-23 13:56:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:56:04,552 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,552 INFO L357 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,552 INFO L414 AbstractCegarLoop]: === Iteration 34 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -860401887, now seen corresponding path program 31 times [2018-07-23 13:56:04,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:56:04,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,624 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:56:04,624 INFO L185 omatonBuilderFactory]: Interpolants [3104#(and (<= Main_y 6) (<= 6 Main_y)), 3105#(and (<= 7 Main_y) (<= Main_y 7)), 3106#(and (<= 8 Main_y) (<= Main_y 8)), 3107#(and (<= Main_y 9) (<= 9 Main_y)), 3108#(and (<= 10 Main_y) (<= Main_y 10)), 3109#(and (<= 11 Main_y) (<= Main_y 11)), 3096#true, 3097#false, 3098#(and (<= 0 Main_y) (<= Main_y 0)), 3099#(and (<= 1 Main_y) (<= Main_y 1)), 3100#(and (<= Main_y 2) (<= 2 Main_y)), 3101#(and (<= Main_y 3) (<= 3 Main_y)), 3102#(and (<= Main_y 4) (<= 4 Main_y)), 3103#(and (<= Main_y 5) (<= 5 Main_y))] [2018-07-23 13:56:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,627 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:56:04,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:56:04,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:56:04,628 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-07-23 13:56:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,712 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-07-23 13:56:04,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:56:04,713 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-07-23 13:56:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,713 INFO L225 Difference]: With dead ends: 44 [2018-07-23 13:56:04,713 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:56:04,714 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:56:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:56:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-07-23 13:56:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:56:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-07-23 13:56:04,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-07-23 13:56:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,732 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-07-23 13:56:04,732 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:56:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-07-23 13:56:04,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:56:04,732 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,733 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,733 INFO L414 AbstractCegarLoop]: === Iteration 35 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash -902716243, now seen corresponding path program 32 times [2018-07-23 13:56:04,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,780 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,780 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:56:04,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,781 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:56:04,782 INFO L185 omatonBuilderFactory]: Interpolants [3264#(<= Main_x 4), 3265#(<= Main_x 5), 3266#(<= Main_x 6), 3267#(<= Main_x 7), 3268#(<= Main_x 8), 3269#(<= Main_x 9), 3270#(<= Main_x 10), 3271#(<= Main_x 11), 3272#(<= (+ Main_x 1) 0), 3258#true, 3259#false, 3260#(<= Main_x 0), 3261#(<= Main_x 1), 3262#(<= Main_x 2), 3263#(<= Main_x 3)] [2018-07-23 13:56:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,783 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:56:04,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:56:04,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:56:04,784 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 15 states. [2018-07-23 13:56:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,819 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-07-23 13:56:04,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:56:04,820 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 13:56:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,820 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:56:04,820 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 13:56:04,821 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:56:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 13:56:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 13:56:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 13:56:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-07-23 13:56:04,834 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-07-23 13:56:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,835 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-07-23 13:56:04,835 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:56:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-07-23 13:56:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:56:04,835 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,836 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,836 INFO L414 AbstractCegarLoop]: === Iteration 36 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash -361074873, now seen corresponding path program 33 times [2018-07-23 13:56:04,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:04,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:56:04,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:04,889 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:56:04,890 INFO L185 omatonBuilderFactory]: Interpolants [3424#(<= 1 Main_x), 3425#(<= 2 Main_x), 3426#(<= 3 Main_x), 3427#(<= 4 Main_x), 3428#(<= 5 Main_x), 3429#(<= 6 Main_x), 3430#(<= 7 Main_x), 3431#(<= 8 Main_x), 3432#(<= 9 Main_x), 3433#(<= 10 Main_x), 3434#(<= 11 Main_x), 3435#(<= 12 Main_x), 3421#true, 3422#false, 3423#(<= 0 Main_x)] [2018-07-23 13:56:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:04,890 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:56:04,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:56:04,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:56:04,891 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-07-23 13:56:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:04,915 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-07-23 13:56:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:56:04,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 13:56:04,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:04,915 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:56:04,916 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 13:56:04,916 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 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:56:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 13:56:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-23 13:56:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-23 13:56:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-07-23 13:56:04,930 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-07-23 13:56:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:04,930 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-07-23 13:56:04,930 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:56:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-07-23 13:56:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-23 13:56:04,931 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:04,931 INFO L357 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2018-07-23 13:56:04,931 INFO L414 AbstractCegarLoop]: === Iteration 37 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1691519303, now seen corresponding path program 34 times [2018-07-23 13:56:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,005 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:05,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:56:05,005 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:05,005 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:56:05,006 INFO L185 omatonBuilderFactory]: Interpolants [3562#true, 3563#false, 3564#(and (<= 0 Main_y) (<= Main_y 0)), 3565#(and (<= 1 Main_y) (<= Main_y 1)), 3566#(and (<= Main_y 2) (<= 2 Main_y)), 3567#(and (<= Main_y 3) (<= 3 Main_y)), 3568#(and (<= Main_y 4) (<= 4 Main_y)), 3569#(and (<= Main_y 5) (<= 5 Main_y)), 3570#(and (<= Main_y 6) (<= 6 Main_y)), 3571#(and (<= 7 Main_y) (<= Main_y 7)), 3572#(and (<= 8 Main_y) (<= Main_y 8)), 3573#(and (<= Main_y 9) (<= 9 Main_y)), 3574#(and (<= 10 Main_y) (<= Main_y 10)), 3575#(and (<= 11 Main_y) (<= Main_y 11)), 3576#(and (<= 12 Main_y) (<= Main_y 12))] [2018-07-23 13:56:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,006 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:56:05,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:56:05,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:56:05,007 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-07-23 13:56:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:05,097 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-07-23 13:56:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:56:05,097 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-07-23 13:56:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:05,098 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:56:05,098 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 13:56:05,098 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:56:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 13:56:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-07-23 13:56:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:56:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-07-23 13:56:05,111 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-07-23 13:56:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:05,112 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-07-23 13:56:05,112 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:56:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-07-23 13:56:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:56:05,112 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:05,112 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-07-23 13:56:05,113 INFO L414 AbstractCegarLoop]: === Iteration 38 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash 897429319, now seen corresponding path program 35 times [2018-07-23 13:56:05,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,160 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:05,161 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:56:05,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:05,161 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:56:05,161 INFO L185 omatonBuilderFactory]: Interpolants [3744#(<= Main_x 7), 3745#(<= Main_x 8), 3746#(<= Main_x 9), 3747#(<= Main_x 10), 3748#(<= Main_x 11), 3749#(<= Main_x 12), 3750#(<= (+ Main_x 1) 0), 3735#true, 3736#false, 3737#(<= Main_x 0), 3738#(<= Main_x 1), 3739#(<= Main_x 2), 3740#(<= Main_x 3), 3741#(<= Main_x 4), 3742#(<= Main_x 5), 3743#(<= Main_x 6)] [2018-07-23 13:56:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,162 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:56:05,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:56:05,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:56:05,166 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 16 states. [2018-07-23 13:56:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:05,205 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-07-23 13:56:05,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:56:05,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 13:56:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:05,206 INFO L225 Difference]: With dead ends: 48 [2018-07-23 13:56:05,206 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:56:05,207 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:56:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:56:05,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:56:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:56:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-07-23 13:56:05,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-07-23 13:56:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:05,222 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-07-23 13:56:05,223 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:56:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-07-23 13:56:05,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 13:56:05,223 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:05,223 INFO L357 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-07-23 13:56:05,224 INFO L414 AbstractCegarLoop]: === Iteration 39 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:05,224 INFO L82 PathProgramCache]: Analyzing trace with hash 508442605, now seen corresponding path program 36 times [2018-07-23 13:56:05,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:05,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:56:05,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:05,272 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:56:05,272 INFO L185 omatonBuilderFactory]: Interpolants [3909#true, 3910#false, 3911#(<= 0 Main_x), 3912#(<= 1 Main_x), 3913#(<= 2 Main_x), 3914#(<= 3 Main_x), 3915#(<= 4 Main_x), 3916#(<= 5 Main_x), 3917#(<= 6 Main_x), 3918#(<= 7 Main_x), 3919#(<= 8 Main_x), 3920#(<= 9 Main_x), 3921#(<= 10 Main_x), 3922#(<= 11 Main_x), 3923#(<= 12 Main_x), 3924#(<= 13 Main_x)] [2018-07-23 13:56:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,272 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:56:05,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:56:05,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:56:05,273 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-07-23 13:56:05,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:05,298 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-07-23 13:56:05,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:56:05,298 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 13:56:05,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:05,299 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:56:05,299 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:56:05,299 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 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:56:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:56:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 13:56:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:56:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-07-23 13:56:05,311 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-07-23 13:56:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:05,312 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-07-23 13:56:05,312 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:56:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-07-23 13:56:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 13:56:05,312 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:05,313 INFO L357 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1] [2018-07-23 13:56:05,313 INFO L414 AbstractCegarLoop]: === Iteration 40 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1418209951, now seen corresponding path program 37 times [2018-07-23 13:56:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:05,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:56:05,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:05,447 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:56:05,448 INFO L185 omatonBuilderFactory]: Interpolants [4064#(and (<= Main_y 3) (<= 3 Main_y)), 4065#(and (<= Main_y 4) (<= 4 Main_y)), 4066#(and (<= Main_y 5) (<= 5 Main_y)), 4067#(and (<= Main_y 6) (<= 6 Main_y)), 4068#(and (<= 7 Main_y) (<= Main_y 7)), 4069#(and (<= 8 Main_y) (<= Main_y 8)), 4070#(and (<= Main_y 9) (<= 9 Main_y)), 4071#(and (<= 10 Main_y) (<= Main_y 10)), 4072#(and (<= 11 Main_y) (<= Main_y 11)), 4073#(and (<= 12 Main_y) (<= Main_y 12)), 4074#(and (<= 13 Main_y) (<= Main_y 13)), 4059#true, 4060#false, 4061#(and (<= 0 Main_y) (<= Main_y 0)), 4062#(and (<= 1 Main_y) (<= Main_y 1)), 4063#(and (<= Main_y 2) (<= 2 Main_y))] [2018-07-23 13:56:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:56:05,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:56:05,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:56:05,449 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2018-07-23 13:56:05,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:05,552 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-07-23 13:56:05,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:56:05,552 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-07-23 13:56:05,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:05,553 INFO L225 Difference]: With dead ends: 50 [2018-07-23 13:56:05,553 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:56:05,553 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:56:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:56:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-07-23 13:56:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:56:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-07-23 13:56:05,566 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-07-23 13:56:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:05,566 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-07-23 13:56:05,566 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:56:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-07-23 13:56:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:56:05,567 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:05,567 INFO L357 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-07-23 13:56:05,567 INFO L414 AbstractCegarLoop]: === Iteration 41 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:05,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1014897043, now seen corresponding path program 38 times [2018-07-23 13:56:05,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:05,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:56:05,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:05,610 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:56:05,610 INFO L185 omatonBuilderFactory]: Interpolants [4256#(<= Main_x 11), 4257#(<= Main_x 12), 4258#(<= Main_x 13), 4259#(<= (+ Main_x 1) 0), 4243#true, 4244#false, 4245#(<= Main_x 0), 4246#(<= Main_x 1), 4247#(<= Main_x 2), 4248#(<= Main_x 3), 4249#(<= Main_x 4), 4250#(<= Main_x 5), 4251#(<= Main_x 6), 4252#(<= Main_x 7), 4253#(<= Main_x 8), 4254#(<= Main_x 9), 4255#(<= Main_x 10)] [2018-07-23 13:56:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,611 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:56:05,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:56:05,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:56:05,612 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 17 states. [2018-07-23 13:56:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:05,656 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-07-23 13:56:05,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:56:05,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 13:56:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:05,657 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:56:05,657 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:56:05,657 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:56:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:56:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 13:56:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 13:56:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-07-23 13:56:05,669 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-07-23 13:56:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:05,669 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-07-23 13:56:05,669 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:56:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-07-23 13:56:05,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 13:56:05,670 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:05,670 INFO L357 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-07-23 13:56:05,670 INFO L414 AbstractCegarLoop]: === Iteration 42 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash -188583289, now seen corresponding path program 39 times [2018-07-23 13:56:05,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:05,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:56:05,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:05,725 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:56:05,725 INFO L185 omatonBuilderFactory]: Interpolants [4428#true, 4429#false, 4430#(<= 0 Main_x), 4431#(<= 1 Main_x), 4432#(<= 2 Main_x), 4433#(<= 3 Main_x), 4434#(<= 4 Main_x), 4435#(<= 5 Main_x), 4436#(<= 6 Main_x), 4437#(<= 7 Main_x), 4438#(<= 8 Main_x), 4439#(<= 9 Main_x), 4440#(<= 10 Main_x), 4441#(<= 11 Main_x), 4442#(<= 12 Main_x), 4443#(<= 13 Main_x), 4444#(<= 14 Main_x)] [2018-07-23 13:56:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:05,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:56:05,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:56:05,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:56:05,727 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-07-23 13:56:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:05,752 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-07-23 13:56:05,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:56:05,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 13:56:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:05,753 INFO L225 Difference]: With dead ends: 37 [2018-07-23 13:56:05,753 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 13:56:05,753 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 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:56:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 13:56:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-23 13:56:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-23 13:56:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-07-23 13:56:05,765 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-07-23 13:56:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-07-23 13:56:05,766 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:56:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-07-23 13:56:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-23 13:56:05,766 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:05,766 INFO L357 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1] [2018-07-23 13:56:05,766 INFO L414 AbstractCegarLoop]: === Iteration 43 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:05,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1551176185, now seen corresponding path program 40 times [2018-07-23 13:56:05,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:05,848 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:56:05,849 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:05,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:56:05,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:05,849 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:56:05,849 INFO L185 omatonBuilderFactory]: Interpolants [4587#true, 4588#false, 4589#(and (<= 0 Main_y) (<= Main_y 0)), 4590#(and (<= 1 Main_y) (<= Main_y 1)), 4591#(and (<= Main_y 2) (<= 2 Main_y)), 4592#(and (<= Main_y 3) (<= 3 Main_y)), 4593#(and (<= Main_y 4) (<= 4 Main_y)), 4594#(and (<= Main_y 5) (<= 5 Main_y)), 4595#(and (<= Main_y 6) (<= 6 Main_y)), 4596#(and (<= 7 Main_y) (<= Main_y 7)), 4597#(and (<= 8 Main_y) (<= Main_y 8)), 4598#(and (<= Main_y 9) (<= 9 Main_y)), 4599#(and (<= 10 Main_y) (<= Main_y 10)), 4600#(and (<= 11 Main_y) (<= Main_y 11)), 4601#(and (<= 12 Main_y) (<= Main_y 12)), 4602#(and (<= 13 Main_y) (<= Main_y 13)), 4603#(and (<= 14 Main_y) (<= Main_y 14))] [2018-07-23 13:56:05,850 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:56:05,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:56:05,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:56:05,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:56:05,851 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2018-07-23 13:56:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:05,954 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-07-23 13:56:05,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:56:05,954 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-07-23 13:56:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:05,955 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:56:05,955 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 13:56:05,955 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:56:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 13:56:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-07-23 13:56:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:56:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-07-23 13:56:05,971 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-07-23 13:56:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:05,971 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-07-23 13:56:05,971 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:56:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-07-23 13:56:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:56:05,972 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:05,972 INFO L357 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-07-23 13:56:05,972 INFO L414 AbstractCegarLoop]: === Iteration 44 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:05,972 INFO L82 PathProgramCache]: Analyzing trace with hash -841883001, now seen corresponding path program 41 times [2018-07-23 13:56:05,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:06,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:56:06,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:06,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:56:06,017 INFO L185 omatonBuilderFactory]: Interpolants [4782#true, 4783#false, 4784#(<= Main_x 0), 4785#(<= Main_x 1), 4786#(<= Main_x 2), 4787#(<= Main_x 3), 4788#(<= Main_x 4), 4789#(<= Main_x 5), 4790#(<= Main_x 6), 4791#(<= Main_x 7), 4792#(<= Main_x 8), 4793#(<= Main_x 9), 4794#(<= Main_x 10), 4795#(<= Main_x 11), 4796#(<= Main_x 12), 4797#(<= Main_x 13), 4798#(<= Main_x 14), 4799#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,018 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:56:06,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:56:06,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:56:06,018 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 18 states. [2018-07-23 13:56:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:06,066 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-07-23 13:56:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:56:06,066 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 13:56:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:06,067 INFO L225 Difference]: With dead ends: 54 [2018-07-23 13:56:06,067 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 13:56:06,067 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:56:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 13:56:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 13:56:06,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 13:56:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-07-23 13:56:06,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-07-23 13:56:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:06,080 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-07-23 13:56:06,080 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:56:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-07-23 13:56:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 13:56:06,081 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:06,081 INFO L357 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-07-23 13:56:06,081 INFO L414 AbstractCegarLoop]: === Iteration 45 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash -995960403, now seen corresponding path program 42 times [2018-07-23 13:56:06,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,130 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:06,130 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:56:06,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:06,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:56:06,130 INFO L185 omatonBuilderFactory]: Interpolants [4992#(<= 12 Main_x), 4993#(<= 13 Main_x), 4994#(<= 14 Main_x), 4995#(<= 15 Main_x), 4978#true, 4979#false, 4980#(<= 0 Main_x), 4981#(<= 1 Main_x), 4982#(<= 2 Main_x), 4983#(<= 3 Main_x), 4984#(<= 4 Main_x), 4985#(<= 5 Main_x), 4986#(<= 6 Main_x), 4987#(<= 7 Main_x), 4988#(<= 8 Main_x), 4989#(<= 9 Main_x), 4990#(<= 10 Main_x), 4991#(<= 11 Main_x)] [2018-07-23 13:56:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,131 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:56:06,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:56:06,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:56:06,131 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-07-23 13:56:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:06,160 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-07-23 13:56:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:56:06,160 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 13:56:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:06,160 INFO L225 Difference]: With dead ends: 39 [2018-07-23 13:56:06,161 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:56:06,161 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 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:56:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:56:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 13:56:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:56:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-07-23 13:56:06,174 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-07-23 13:56:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:06,174 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-07-23 13:56:06,174 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:56:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-07-23 13:56:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:56:06,175 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:06,175 INFO L357 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1] [2018-07-23 13:56:06,175 INFO L414 AbstractCegarLoop]: === Iteration 46 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash -810062943, now seen corresponding path program 43 times [2018-07-23 13:56:06,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:06,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:56:06,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:06,252 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:56:06,252 INFO L185 omatonBuilderFactory]: Interpolants [5152#(and (<= Main_y 4) (<= 4 Main_y)), 5153#(and (<= Main_y 5) (<= 5 Main_y)), 5154#(and (<= Main_y 6) (<= 6 Main_y)), 5155#(and (<= 7 Main_y) (<= Main_y 7)), 5156#(and (<= 8 Main_y) (<= Main_y 8)), 5157#(and (<= Main_y 9) (<= 9 Main_y)), 5158#(and (<= 10 Main_y) (<= Main_y 10)), 5159#(and (<= 11 Main_y) (<= Main_y 11)), 5160#(and (<= 12 Main_y) (<= Main_y 12)), 5161#(and (<= 13 Main_y) (<= Main_y 13)), 5162#(and (<= 14 Main_y) (<= Main_y 14)), 5163#(and (<= Main_y 15) (<= 15 Main_y)), 5146#true, 5147#false, 5148#(and (<= 0 Main_y) (<= Main_y 0)), 5149#(and (<= 1 Main_y) (<= Main_y 1)), 5150#(and (<= Main_y 2) (<= 2 Main_y)), 5151#(and (<= Main_y 3) (<= 3 Main_y))] [2018-07-23 13:56:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,253 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:56:06,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:56:06,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:56:06,253 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 18 states. [2018-07-23 13:56:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:06,364 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-07-23 13:56:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:56:06,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-07-23 13:56:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:06,365 INFO L225 Difference]: With dead ends: 56 [2018-07-23 13:56:06,365 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:56:06,365 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:56:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:56:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-07-23 13:56:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:56:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-07-23 13:56:06,382 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-07-23 13:56:06,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:06,382 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-07-23 13:56:06,382 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:56:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-07-23 13:56:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:56:06,382 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:06,383 INFO L357 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-07-23 13:56:06,383 INFO L414 AbstractCegarLoop]: === Iteration 47 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:06,383 INFO L82 PathProgramCache]: Analyzing trace with hash 657791021, now seen corresponding path program 44 times [2018-07-23 13:56:06,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:06,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:56:06,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:06,431 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:56:06,431 INFO L185 omatonBuilderFactory]: Interpolants [5352#true, 5353#false, 5354#(<= Main_x 0), 5355#(<= Main_x 1), 5356#(<= Main_x 2), 5357#(<= Main_x 3), 5358#(<= Main_x 4), 5359#(<= Main_x 5), 5360#(<= Main_x 6), 5361#(<= Main_x 7), 5362#(<= Main_x 8), 5363#(<= Main_x 9), 5364#(<= Main_x 10), 5365#(<= Main_x 11), 5366#(<= Main_x 12), 5367#(<= Main_x 13), 5368#(<= Main_x 14), 5369#(<= Main_x 15), 5370#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,432 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:56:06,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:56:06,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:56:06,432 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 19 states. [2018-07-23 13:56:06,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:06,488 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-07-23 13:56:06,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:56:06,488 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-23 13:56:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:06,488 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:56:06,489 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 13:56:06,489 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:56:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 13:56:06,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 13:56:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 13:56:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-07-23 13:56:06,504 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-07-23 13:56:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:06,505 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-07-23 13:56:06,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:56:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-07-23 13:56:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 13:56:06,505 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:06,505 INFO L357 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-07-23 13:56:06,506 INFO L414 AbstractCegarLoop]: === Iteration 48 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash 176358855, now seen corresponding path program 45 times [2018-07-23 13:56:06,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,558 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:06,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:56:06,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:06,559 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:56:06,559 INFO L185 omatonBuilderFactory]: Interpolants [5568#(<= 7 Main_x), 5569#(<= 8 Main_x), 5570#(<= 9 Main_x), 5571#(<= 10 Main_x), 5572#(<= 11 Main_x), 5573#(<= 12 Main_x), 5574#(<= 13 Main_x), 5575#(<= 14 Main_x), 5576#(<= 15 Main_x), 5577#(<= 16 Main_x), 5559#true, 5560#false, 5561#(<= 0 Main_x), 5562#(<= 1 Main_x), 5563#(<= 2 Main_x), 5564#(<= 3 Main_x), 5565#(<= 4 Main_x), 5566#(<= 5 Main_x), 5567#(<= 6 Main_x)] [2018-07-23 13:56:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,559 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:56:06,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:56:06,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:56:06,560 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-07-23 13:56:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:06,591 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-07-23 13:56:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:56:06,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-23 13:56:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:06,592 INFO L225 Difference]: With dead ends: 41 [2018-07-23 13:56:06,592 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:56:06,592 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 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:56:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:56:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:56:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:56:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-07-23 13:56:06,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-07-23 13:56:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:06,608 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-07-23 13:56:06,608 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:56:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-07-23 13:56:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-23 13:56:06,608 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:06,608 INFO L357 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1] [2018-07-23 13:56:06,609 INFO L414 AbstractCegarLoop]: === Iteration 49 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:06,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1172095687, now seen corresponding path program 46 times [2018-07-23 13:56:06,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:06,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:56:06,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:06,688 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:56:06,689 INFO L185 omatonBuilderFactory]: Interpolants [5736#true, 5737#false, 5738#(and (<= 0 Main_y) (<= Main_y 0)), 5739#(and (<= 1 Main_y) (<= Main_y 1)), 5740#(and (<= Main_y 2) (<= 2 Main_y)), 5741#(and (<= Main_y 3) (<= 3 Main_y)), 5742#(and (<= Main_y 4) (<= 4 Main_y)), 5743#(and (<= Main_y 5) (<= 5 Main_y)), 5744#(and (<= Main_y 6) (<= 6 Main_y)), 5745#(and (<= 7 Main_y) (<= Main_y 7)), 5746#(and (<= 8 Main_y) (<= Main_y 8)), 5747#(and (<= Main_y 9) (<= 9 Main_y)), 5748#(and (<= 10 Main_y) (<= Main_y 10)), 5749#(and (<= 11 Main_y) (<= Main_y 11)), 5750#(and (<= 12 Main_y) (<= Main_y 12)), 5751#(and (<= 13 Main_y) (<= Main_y 13)), 5752#(and (<= 14 Main_y) (<= Main_y 14)), 5753#(and (<= Main_y 15) (<= 15 Main_y)), 5754#(and (<= 16 Main_y) (<= Main_y 16))] [2018-07-23 13:56:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:56:06,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:56:06,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:56:06,690 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 19 states. [2018-07-23 13:56:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:06,805 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-07-23 13:56:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:56:06,805 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-07-23 13:56:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:06,806 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:56:06,806 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 13:56:06,807 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:56:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 13:56:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2018-07-23 13:56:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:56:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-07-23 13:56:06,823 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-07-23 13:56:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-07-23 13:56:06,824 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:56:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-07-23 13:56:06,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:56:06,824 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:06,825 INFO L357 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-07-23 13:56:06,825 INFO L414 AbstractCegarLoop]: === Iteration 50 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1975166407, now seen corresponding path program 47 times [2018-07-23 13:56:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,878 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:06,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:56:06,878 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:06,879 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:56:06,879 INFO L185 omatonBuilderFactory]: Interpolants [5953#true, 5954#false, 5955#(<= Main_x 0), 5956#(<= Main_x 1), 5957#(<= Main_x 2), 5958#(<= Main_x 3), 5959#(<= Main_x 4), 5960#(<= Main_x 5), 5961#(<= Main_x 6), 5962#(<= Main_x 7), 5963#(<= Main_x 8), 5964#(<= Main_x 9), 5965#(<= Main_x 10), 5966#(<= Main_x 11), 5967#(<= Main_x 12), 5968#(<= Main_x 13), 5969#(<= Main_x 14), 5970#(<= Main_x 15), 5971#(<= Main_x 16), 5972#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:06,879 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:56:06,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:56:06,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:56:06,880 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 20 states. [2018-07-23 13:56:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:06,932 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-07-23 13:56:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:56:06,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-23 13:56:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:06,933 INFO L225 Difference]: With dead ends: 60 [2018-07-23 13:56:06,933 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 13:56:06,933 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:56:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 13:56:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 13:56:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 13:56:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-07-23 13:56:06,948 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-07-23 13:56:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:06,948 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-07-23 13:56:06,948 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:56:06,948 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-07-23 13:56:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 13:56:06,949 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:06,949 INFO L357 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-07-23 13:56:06,949 INFO L414 AbstractCegarLoop]: === Iteration 51 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash -64328851, now seen corresponding path program 48 times [2018-07-23 13:56:06,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:07,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:56:07,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:07,014 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:56:07,014 INFO L185 omatonBuilderFactory]: Interpolants [6176#(<= 3 Main_x), 6177#(<= 4 Main_x), 6178#(<= 5 Main_x), 6179#(<= 6 Main_x), 6180#(<= 7 Main_x), 6181#(<= 8 Main_x), 6182#(<= 9 Main_x), 6183#(<= 10 Main_x), 6184#(<= 11 Main_x), 6185#(<= 12 Main_x), 6186#(<= 13 Main_x), 6187#(<= 14 Main_x), 6188#(<= 15 Main_x), 6189#(<= 16 Main_x), 6190#(<= 17 Main_x), 6171#true, 6172#false, 6173#(<= 0 Main_x), 6174#(<= 1 Main_x), 6175#(<= 2 Main_x)] [2018-07-23 13:56:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:56:07,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:56:07,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:56:07,016 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-07-23 13:56:07,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:07,047 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-07-23 13:56:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:56:07,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-23 13:56:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:07,048 INFO L225 Difference]: With dead ends: 43 [2018-07-23 13:56:07,048 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:56:07,049 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 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:56:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:56:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 13:56:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:56:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-07-23 13:56:07,068 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-07-23 13:56:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:07,068 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-07-23 13:56:07,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:56:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-07-23 13:56:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 13:56:07,069 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:07,071 INFO L357 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1] [2018-07-23 13:56:07,071 INFO L414 AbstractCegarLoop]: === Iteration 52 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1994255903, now seen corresponding path program 49 times [2018-07-23 13:56:07,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:07,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:56:07,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:07,156 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:56:07,156 INFO L185 omatonBuilderFactory]: Interpolants [6368#(and (<= Main_y 9) (<= 9 Main_y)), 6369#(and (<= 10 Main_y) (<= Main_y 10)), 6370#(and (<= 11 Main_y) (<= Main_y 11)), 6371#(and (<= 12 Main_y) (<= Main_y 12)), 6372#(and (<= 13 Main_y) (<= Main_y 13)), 6373#(and (<= 14 Main_y) (<= Main_y 14)), 6374#(and (<= Main_y 15) (<= 15 Main_y)), 6375#(and (<= 16 Main_y) (<= Main_y 16)), 6376#(and (<= Main_y 17) (<= 17 Main_y)), 6357#true, 6358#false, 6359#(and (<= 0 Main_y) (<= Main_y 0)), 6360#(and (<= 1 Main_y) (<= Main_y 1)), 6361#(and (<= Main_y 2) (<= 2 Main_y)), 6362#(and (<= Main_y 3) (<= 3 Main_y)), 6363#(and (<= Main_y 4) (<= 4 Main_y)), 6364#(and (<= Main_y 5) (<= 5 Main_y)), 6365#(and (<= Main_y 6) (<= 6 Main_y)), 6366#(and (<= 7 Main_y) (<= Main_y 7)), 6367#(and (<= 8 Main_y) (<= Main_y 8))] [2018-07-23 13:56:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,157 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:56:07,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:56:07,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:56:07,158 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 20 states. [2018-07-23 13:56:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:07,311 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-07-23 13:56:07,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:56:07,312 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-07-23 13:56:07,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:07,312 INFO L225 Difference]: With dead ends: 62 [2018-07-23 13:56:07,312 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:56:07,313 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:56:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:56:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-07-23 13:56:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 13:56:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-07-23 13:56:07,330 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-07-23 13:56:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:07,331 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-07-23 13:56:07,331 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:56:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-07-23 13:56:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:56:07,331 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:07,331 INFO L357 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-07-23 13:56:07,332 INFO L414 AbstractCegarLoop]: === Iteration 53 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:07,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1692452371, now seen corresponding path program 50 times [2018-07-23 13:56:07,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,383 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:07,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:56:07,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:07,384 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:56:07,384 INFO L185 omatonBuilderFactory]: Interpolants [6592#(<= Main_x 5), 6593#(<= Main_x 6), 6594#(<= Main_x 7), 6595#(<= Main_x 8), 6596#(<= Main_x 9), 6597#(<= Main_x 10), 6598#(<= Main_x 11), 6599#(<= Main_x 12), 6600#(<= Main_x 13), 6601#(<= Main_x 14), 6602#(<= Main_x 15), 6603#(<= Main_x 16), 6604#(<= Main_x 17), 6605#(<= (+ Main_x 1) 0), 6585#true, 6586#false, 6587#(<= Main_x 0), 6588#(<= Main_x 1), 6589#(<= Main_x 2), 6590#(<= Main_x 3), 6591#(<= Main_x 4)] [2018-07-23 13:56:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,384 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:56:07,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:56:07,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:56:07,385 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 21 states. [2018-07-23 13:56:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:07,436 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-07-23 13:56:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:56:07,437 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-23 13:56:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:07,437 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:56:07,437 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 13:56:07,438 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:56:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 13:56:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 13:56:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 13:56:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-07-23 13:56:07,456 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-07-23 13:56:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:07,456 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-07-23 13:56:07,456 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:56:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-07-23 13:56:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 13:56:07,457 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:07,457 INFO L357 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-07-23 13:56:07,461 INFO L414 AbstractCegarLoop]: === Iteration 54 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash -492295929, now seen corresponding path program 51 times [2018-07-23 13:56:07,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:07,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:56:07,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:07,521 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:56:07,521 INFO L185 omatonBuilderFactory]: Interpolants [6816#(<= 0 Main_x), 6817#(<= 1 Main_x), 6818#(<= 2 Main_x), 6819#(<= 3 Main_x), 6820#(<= 4 Main_x), 6821#(<= 5 Main_x), 6822#(<= 6 Main_x), 6823#(<= 7 Main_x), 6824#(<= 8 Main_x), 6825#(<= 9 Main_x), 6826#(<= 10 Main_x), 6827#(<= 11 Main_x), 6828#(<= 12 Main_x), 6829#(<= 13 Main_x), 6830#(<= 14 Main_x), 6831#(<= 15 Main_x), 6832#(<= 16 Main_x), 6833#(<= 17 Main_x), 6834#(<= 18 Main_x), 6814#true, 6815#false] [2018-07-23 13:56:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,522 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:56:07,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:56:07,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:56:07,526 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-07-23 13:56:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:07,559 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-07-23 13:56:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:56:07,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-23 13:56:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:07,560 INFO L225 Difference]: With dead ends: 45 [2018-07-23 13:56:07,560 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 13:56:07,560 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 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:56:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 13:56:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-23 13:56:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-23 13:56:07,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-07-23 13:56:07,577 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-07-23 13:56:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:07,577 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-07-23 13:56:07,578 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:56:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-07-23 13:56:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-23 13:56:07,578 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:07,578 INFO L357 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1] [2018-07-23 13:56:07,578 INFO L414 AbstractCegarLoop]: === Iteration 55 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1918633863, now seen corresponding path program 52 times [2018-07-23 13:56:07,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:07,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:56:07,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:07,669 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:56:07,670 INFO L185 omatonBuilderFactory]: Interpolants [7009#true, 7010#false, 7011#(and (<= 0 Main_y) (<= Main_y 0)), 7012#(and (<= 1 Main_y) (<= Main_y 1)), 7013#(and (<= Main_y 2) (<= 2 Main_y)), 7014#(and (<= Main_y 3) (<= 3 Main_y)), 7015#(and (<= Main_y 4) (<= 4 Main_y)), 7016#(and (<= Main_y 5) (<= 5 Main_y)), 7017#(and (<= Main_y 6) (<= 6 Main_y)), 7018#(and (<= 7 Main_y) (<= Main_y 7)), 7019#(and (<= 8 Main_y) (<= Main_y 8)), 7020#(and (<= Main_y 9) (<= 9 Main_y)), 7021#(and (<= 10 Main_y) (<= Main_y 10)), 7022#(and (<= 11 Main_y) (<= Main_y 11)), 7023#(and (<= 12 Main_y) (<= Main_y 12)), 7024#(and (<= 13 Main_y) (<= Main_y 13)), 7025#(and (<= 14 Main_y) (<= Main_y 14)), 7026#(and (<= Main_y 15) (<= 15 Main_y)), 7027#(and (<= 16 Main_y) (<= Main_y 16)), 7028#(and (<= Main_y 17) (<= 17 Main_y)), 7029#(and (<= Main_y 18) (<= 18 Main_y))] [2018-07-23 13:56:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,670 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:56:07,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:56:07,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:56:07,671 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2018-07-23 13:56:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:07,828 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-07-23 13:56:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:56:07,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-07-23 13:56:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:07,829 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:56:07,829 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 13:56:07,830 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:56:07,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 13:56:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2018-07-23 13:56:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 13:56:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-07-23 13:56:07,852 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-07-23 13:56:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:07,852 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-07-23 13:56:07,853 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:56:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-07-23 13:56:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:56:07,853 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:07,853 INFO L357 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-07-23 13:56:07,854 INFO L414 AbstractCegarLoop]: === Iteration 56 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:07,854 INFO L82 PathProgramCache]: Analyzing trace with hash -651953913, now seen corresponding path program 53 times [2018-07-23 13:56:07,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:07,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:56:07,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:07,931 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:56:07,931 INFO L185 omatonBuilderFactory]: Interpolants [7264#(<= Main_x 14), 7265#(<= Main_x 15), 7266#(<= Main_x 16), 7267#(<= Main_x 17), 7268#(<= Main_x 18), 7269#(<= (+ Main_x 1) 0), 7248#true, 7249#false, 7250#(<= Main_x 0), 7251#(<= Main_x 1), 7252#(<= Main_x 2), 7253#(<= Main_x 3), 7254#(<= Main_x 4), 7255#(<= Main_x 5), 7256#(<= Main_x 6), 7257#(<= Main_x 7), 7258#(<= Main_x 8), 7259#(<= Main_x 9), 7260#(<= Main_x 10), 7261#(<= Main_x 11), 7262#(<= Main_x 12), 7263#(<= Main_x 13)] [2018-07-23 13:56:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:07,932 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:56:07,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:56:07,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:56:07,933 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 22 states. [2018-07-23 13:56:07,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:07,999 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-07-23 13:56:07,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:56:08,000 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-23 13:56:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:08,000 INFO L225 Difference]: With dead ends: 66 [2018-07-23 13:56:08,000 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 13:56:08,001 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:56:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 13:56:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 13:56:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 13:56:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-07-23 13:56:08,023 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2018-07-23 13:56:08,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:08,023 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-07-23 13:56:08,023 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:56:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-07-23 13:56:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 13:56:08,024 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:08,024 INFO L357 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-07-23 13:56:08,024 INFO L414 AbstractCegarLoop]: === Iteration 57 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2101809875, now seen corresponding path program 54 times [2018-07-23 13:56:08,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,094 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:08,094 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:56:08,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:08,095 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:56:08,095 INFO L185 omatonBuilderFactory]: Interpolants [7488#true, 7489#false, 7490#(<= 0 Main_x), 7491#(<= 1 Main_x), 7492#(<= 2 Main_x), 7493#(<= 3 Main_x), 7494#(<= 4 Main_x), 7495#(<= 5 Main_x), 7496#(<= 6 Main_x), 7497#(<= 7 Main_x), 7498#(<= 8 Main_x), 7499#(<= 9 Main_x), 7500#(<= 10 Main_x), 7501#(<= 11 Main_x), 7502#(<= 12 Main_x), 7503#(<= 13 Main_x), 7504#(<= 14 Main_x), 7505#(<= 15 Main_x), 7506#(<= 16 Main_x), 7507#(<= 17 Main_x), 7508#(<= 18 Main_x), 7509#(<= 19 Main_x)] [2018-07-23 13:56:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,096 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:56:08,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:56:08,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:56:08,096 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-07-23 13:56:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:08,132 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-07-23 13:56:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:56:08,132 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-23 13:56:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:08,133 INFO L225 Difference]: With dead ends: 47 [2018-07-23 13:56:08,133 INFO L226 Difference]: Without dead ends: 44 [2018-07-23 13:56:08,133 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 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:56:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-23 13:56:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-23 13:56:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-23 13:56:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-07-23 13:56:08,153 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-07-23 13:56:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:08,153 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-07-23 13:56:08,153 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:56:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-07-23 13:56:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-23 13:56:08,154 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:08,154 INFO L357 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1] [2018-07-23 13:56:08,154 INFO L414 AbstractCegarLoop]: === Iteration 58 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash -731658207, now seen corresponding path program 55 times [2018-07-23 13:56:08,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:08,296 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,296 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:08,297 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:56:08,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:08,297 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:56:08,297 INFO L185 omatonBuilderFactory]: Interpolants [7712#(and (<= Main_y 18) (<= 18 Main_y)), 7713#(and (<= Main_y 19) (<= 19 Main_y)), 7692#true, 7693#false, 7694#(and (<= 0 Main_y) (<= Main_y 0)), 7695#(and (<= 1 Main_y) (<= Main_y 1)), 7696#(and (<= Main_y 2) (<= 2 Main_y)), 7697#(and (<= Main_y 3) (<= 3 Main_y)), 7698#(and (<= Main_y 4) (<= 4 Main_y)), 7699#(and (<= Main_y 5) (<= 5 Main_y)), 7700#(and (<= Main_y 6) (<= 6 Main_y)), 7701#(and (<= 7 Main_y) (<= Main_y 7)), 7702#(and (<= 8 Main_y) (<= Main_y 8)), 7703#(and (<= Main_y 9) (<= 9 Main_y)), 7704#(and (<= 10 Main_y) (<= Main_y 10)), 7705#(and (<= 11 Main_y) (<= Main_y 11)), 7706#(and (<= 12 Main_y) (<= Main_y 12)), 7707#(and (<= 13 Main_y) (<= Main_y 13)), 7708#(and (<= 14 Main_y) (<= Main_y 14)), 7709#(and (<= Main_y 15) (<= 15 Main_y)), 7710#(and (<= 16 Main_y) (<= Main_y 16)), 7711#(and (<= Main_y 17) (<= 17 Main_y))] [2018-07-23 13:56:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:56:08,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:56:08,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:56:08,299 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-07-23 13:56:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:08,459 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-07-23 13:56:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:56:08,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-07-23 13:56:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:08,460 INFO L225 Difference]: With dead ends: 68 [2018-07-23 13:56:08,461 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:56:08,461 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:56:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:56:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-07-23 13:56:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:56:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-07-23 13:56:08,482 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2018-07-23 13:56:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:08,482 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-07-23 13:56:08,482 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:56:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-07-23 13:56:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:56:08,483 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:08,483 INFO L357 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-07-23 13:56:08,483 INFO L414 AbstractCegarLoop]: === Iteration 59 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:08,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1206629459, now seen corresponding path program 56 times [2018-07-23 13:56:08,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:08,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:56:08,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:08,539 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:56:08,539 INFO L185 omatonBuilderFactory]: Interpolants [7942#true, 7943#false, 7944#(<= Main_x 0), 7945#(<= Main_x 1), 7946#(<= Main_x 2), 7947#(<= Main_x 3), 7948#(<= Main_x 4), 7949#(<= Main_x 5), 7950#(<= Main_x 6), 7951#(<= Main_x 7), 7952#(<= Main_x 8), 7953#(<= Main_x 9), 7954#(<= Main_x 10), 7955#(<= Main_x 11), 7956#(<= Main_x 12), 7957#(<= Main_x 13), 7958#(<= Main_x 14), 7959#(<= Main_x 15), 7960#(<= Main_x 16), 7961#(<= Main_x 17), 7962#(<= Main_x 18), 7963#(<= Main_x 19), 7964#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,540 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:56:08,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:56:08,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:56:08,540 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 23 states. [2018-07-23 13:56:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:08,604 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-07-23 13:56:08,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:56:08,605 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-23 13:56:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:08,605 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:56:08,605 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 13:56:08,606 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:56:08,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 13:56:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 13:56:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 13:56:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-07-23 13:56:08,625 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2018-07-23 13:56:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:08,625 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-07-23 13:56:08,625 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:56:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-07-23 13:56:08,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:56:08,626 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:08,626 INFO L357 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-07-23 13:56:08,626 INFO L414 AbstractCegarLoop]: === Iteration 60 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:08,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1092475975, now seen corresponding path program 57 times [2018-07-23 13:56:08,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:08,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:56:08,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:08,689 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:56:08,690 INFO L185 omatonBuilderFactory]: Interpolants [8193#true, 8194#false, 8195#(<= 0 Main_x), 8196#(<= 1 Main_x), 8197#(<= 2 Main_x), 8198#(<= 3 Main_x), 8199#(<= 4 Main_x), 8200#(<= 5 Main_x), 8201#(<= 6 Main_x), 8202#(<= 7 Main_x), 8203#(<= 8 Main_x), 8204#(<= 9 Main_x), 8205#(<= 10 Main_x), 8206#(<= 11 Main_x), 8207#(<= 12 Main_x), 8208#(<= 13 Main_x), 8209#(<= 14 Main_x), 8210#(<= 15 Main_x), 8211#(<= 16 Main_x), 8212#(<= 17 Main_x), 8213#(<= 18 Main_x), 8214#(<= 19 Main_x), 8215#(<= 20 Main_x)] [2018-07-23 13:56:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,690 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:56:08,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:56:08,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:56:08,691 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-07-23 13:56:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:08,726 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-07-23 13:56:08,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:56:08,726 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-23 13:56:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:08,727 INFO L225 Difference]: With dead ends: 49 [2018-07-23 13:56:08,727 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 13:56:08,727 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 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:56:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 13:56:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-23 13:56:08,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-23 13:56:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-07-23 13:56:08,747 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-07-23 13:56:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-07-23 13:56:08,747 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:56:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-07-23 13:56:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-23 13:56:08,748 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:08,748 INFO L357 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1] [2018-07-23 13:56:08,748 INFO L414 AbstractCegarLoop]: === Iteration 61 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash -493044665, now seen corresponding path program 58 times [2018-07-23 13:56:08,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:08,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:56:08,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:08,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:56:08,855 INFO L185 omatonBuilderFactory]: Interpolants [8416#(and (<= 8 Main_y) (<= Main_y 8)), 8417#(and (<= Main_y 9) (<= 9 Main_y)), 8418#(and (<= 10 Main_y) (<= Main_y 10)), 8419#(and (<= 11 Main_y) (<= Main_y 11)), 8420#(and (<= 12 Main_y) (<= Main_y 12)), 8421#(and (<= 13 Main_y) (<= Main_y 13)), 8422#(and (<= 14 Main_y) (<= Main_y 14)), 8423#(and (<= Main_y 15) (<= 15 Main_y)), 8424#(and (<= 16 Main_y) (<= Main_y 16)), 8425#(and (<= Main_y 17) (<= 17 Main_y)), 8426#(and (<= Main_y 18) (<= 18 Main_y)), 8427#(and (<= Main_y 19) (<= 19 Main_y)), 8428#(and (<= 20 Main_y) (<= Main_y 20)), 8406#true, 8407#false, 8408#(and (<= 0 Main_y) (<= Main_y 0)), 8409#(and (<= 1 Main_y) (<= Main_y 1)), 8410#(and (<= Main_y 2) (<= 2 Main_y)), 8411#(and (<= Main_y 3) (<= 3 Main_y)), 8412#(and (<= Main_y 4) (<= 4 Main_y)), 8413#(and (<= Main_y 5) (<= 5 Main_y)), 8414#(and (<= Main_y 6) (<= 6 Main_y)), 8415#(and (<= 7 Main_y) (<= Main_y 7))] [2018-07-23 13:56:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:08,856 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:56:08,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:56:08,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:56:08,856 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 23 states. [2018-07-23 13:56:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:09,028 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-07-23 13:56:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:56:09,028 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-07-23 13:56:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:09,029 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:56:09,029 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 13:56:09,029 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:56:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 13:56:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-07-23 13:56:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:56:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-07-23 13:56:09,052 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2018-07-23 13:56:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:09,053 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-07-23 13:56:09,053 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:56:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-07-23 13:56:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:56:09,053 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:09,053 INFO L357 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-07-23 13:56:09,054 INFO L414 AbstractCegarLoop]: === Iteration 62 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:09,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1895423047, now seen corresponding path program 59 times [2018-07-23 13:56:09,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,119 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:09,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:56:09,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:09,120 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:56:09,120 INFO L185 omatonBuilderFactory]: Interpolants [8672#(<= Main_x 3), 8673#(<= Main_x 4), 8674#(<= Main_x 5), 8675#(<= Main_x 6), 8676#(<= Main_x 7), 8677#(<= Main_x 8), 8678#(<= Main_x 9), 8679#(<= Main_x 10), 8680#(<= Main_x 11), 8681#(<= Main_x 12), 8682#(<= Main_x 13), 8683#(<= Main_x 14), 8684#(<= Main_x 15), 8685#(<= Main_x 16), 8686#(<= Main_x 17), 8687#(<= Main_x 18), 8688#(<= Main_x 19), 8689#(<= Main_x 20), 8690#(<= (+ Main_x 1) 0), 8667#true, 8668#false, 8669#(<= Main_x 0), 8670#(<= Main_x 1), 8671#(<= Main_x 2)] [2018-07-23 13:56:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,120 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:56:09,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:56:09,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:56:09,121 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 24 states. [2018-07-23 13:56:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:09,189 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-07-23 13:56:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:56:09,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-23 13:56:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:09,190 INFO L225 Difference]: With dead ends: 72 [2018-07-23 13:56:09,190 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 13:56:09,191 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:56:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 13:56:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 13:56:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 13:56:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-07-23 13:56:09,212 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 46 [2018-07-23 13:56:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:09,212 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-07-23 13:56:09,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:56:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-07-23 13:56:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 13:56:09,213 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:09,213 INFO L357 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-07-23 13:56:09,213 INFO L414 AbstractCegarLoop]: === Iteration 63 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash 153247469, now seen corresponding path program 60 times [2018-07-23 13:56:09,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,282 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:09,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:56:09,282 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:09,282 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:56:09,282 INFO L185 omatonBuilderFactory]: Interpolants [8929#true, 8930#false, 8931#(<= 0 Main_x), 8932#(<= 1 Main_x), 8933#(<= 2 Main_x), 8934#(<= 3 Main_x), 8935#(<= 4 Main_x), 8936#(<= 5 Main_x), 8937#(<= 6 Main_x), 8938#(<= 7 Main_x), 8939#(<= 8 Main_x), 8940#(<= 9 Main_x), 8941#(<= 10 Main_x), 8942#(<= 11 Main_x), 8943#(<= 12 Main_x), 8944#(<= 13 Main_x), 8945#(<= 14 Main_x), 8946#(<= 15 Main_x), 8947#(<= 16 Main_x), 8948#(<= 17 Main_x), 8949#(<= 18 Main_x), 8950#(<= 19 Main_x), 8951#(<= 20 Main_x), 8952#(<= 21 Main_x)] [2018-07-23 13:56:09,283 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,283 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:56:09,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:56:09,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:56:09,284 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-07-23 13:56:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:09,321 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-07-23 13:56:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:56:09,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-23 13:56:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:09,322 INFO L225 Difference]: With dead ends: 51 [2018-07-23 13:56:09,322 INFO L226 Difference]: Without dead ends: 48 [2018-07-23 13:56:09,322 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 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:56:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-23 13:56:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-23 13:56:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-23 13:56:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-07-23 13:56:09,344 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-07-23 13:56:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:09,344 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-07-23 13:56:09,345 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:56:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-07-23 13:56:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-23 13:56:09,345 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:09,345 INFO L357 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1] [2018-07-23 13:56:09,346 INFO L414 AbstractCegarLoop]: === Iteration 64 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash 455642721, now seen corresponding path program 61 times [2018-07-23 13:56:09,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:09,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:56:09,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:09,453 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:56:09,453 INFO L185 omatonBuilderFactory]: Interpolants [9152#false, 9153#(and (<= 0 Main_y) (<= Main_y 0)), 9154#(and (<= 1 Main_y) (<= Main_y 1)), 9155#(and (<= Main_y 2) (<= 2 Main_y)), 9156#(and (<= Main_y 3) (<= 3 Main_y)), 9157#(and (<= Main_y 4) (<= 4 Main_y)), 9158#(and (<= Main_y 5) (<= 5 Main_y)), 9159#(and (<= Main_y 6) (<= 6 Main_y)), 9160#(and (<= 7 Main_y) (<= Main_y 7)), 9161#(and (<= 8 Main_y) (<= Main_y 8)), 9162#(and (<= Main_y 9) (<= 9 Main_y)), 9163#(and (<= 10 Main_y) (<= Main_y 10)), 9164#(and (<= 11 Main_y) (<= Main_y 11)), 9165#(and (<= 12 Main_y) (<= Main_y 12)), 9166#(and (<= 13 Main_y) (<= Main_y 13)), 9167#(and (<= 14 Main_y) (<= Main_y 14)), 9168#(and (<= Main_y 15) (<= 15 Main_y)), 9169#(and (<= 16 Main_y) (<= Main_y 16)), 9170#(and (<= Main_y 17) (<= 17 Main_y)), 9171#(and (<= Main_y 18) (<= 18 Main_y)), 9172#(and (<= Main_y 19) (<= 19 Main_y)), 9173#(and (<= 20 Main_y) (<= Main_y 20)), 9174#(and (<= 21 Main_y) (<= Main_y 21)), 9151#true] [2018-07-23 13:56:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,454 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:56:09,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:56:09,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:56:09,455 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 24 states. [2018-07-23 13:56:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:09,644 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-07-23 13:56:09,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:56:09,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-07-23 13:56:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:09,645 INFO L225 Difference]: With dead ends: 74 [2018-07-23 13:56:09,645 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:56:09,646 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:56:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:56:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-07-23 13:56:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 13:56:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-07-23 13:56:09,674 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2018-07-23 13:56:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:09,674 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-07-23 13:56:09,674 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:56:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-07-23 13:56:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:56:09,675 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:09,675 INFO L357 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-07-23 13:56:09,675 INFO L414 AbstractCegarLoop]: === Iteration 65 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1239960941, now seen corresponding path program 62 times [2018-07-23 13:56:09,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,742 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:09,742 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:56:09,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:09,743 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:56:09,743 INFO L185 omatonBuilderFactory]: Interpolants [9423#true, 9424#false, 9425#(<= Main_x 0), 9426#(<= Main_x 1), 9427#(<= Main_x 2), 9428#(<= Main_x 3), 9429#(<= Main_x 4), 9430#(<= Main_x 5), 9431#(<= Main_x 6), 9432#(<= Main_x 7), 9433#(<= Main_x 8), 9434#(<= Main_x 9), 9435#(<= Main_x 10), 9436#(<= Main_x 11), 9437#(<= Main_x 12), 9438#(<= Main_x 13), 9439#(<= Main_x 14), 9440#(<= Main_x 15), 9441#(<= Main_x 16), 9442#(<= Main_x 17), 9443#(<= Main_x 18), 9444#(<= Main_x 19), 9445#(<= Main_x 20), 9446#(<= Main_x 21), 9447#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,743 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:56:09,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:56:09,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:56:09,744 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 25 states. [2018-07-23 13:56:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:09,815 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-07-23 13:56:09,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:56:09,815 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-23 13:56:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:09,816 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:56:09,816 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 13:56:09,817 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:56:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 13:56:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 13:56:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:56:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-07-23 13:56:09,840 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 48 [2018-07-23 13:56:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:09,840 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-07-23 13:56:09,840 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:56:09,841 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-07-23 13:56:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:56:09,841 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:09,841 INFO L357 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-07-23 13:56:09,842 INFO L414 AbstractCegarLoop]: === Iteration 66 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1227874425, now seen corresponding path program 63 times [2018-07-23 13:56:09,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,913 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:09,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:56:09,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:09,914 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:56:09,914 INFO L185 omatonBuilderFactory]: Interpolants [9696#true, 9697#false, 9698#(<= 0 Main_x), 9699#(<= 1 Main_x), 9700#(<= 2 Main_x), 9701#(<= 3 Main_x), 9702#(<= 4 Main_x), 9703#(<= 5 Main_x), 9704#(<= 6 Main_x), 9705#(<= 7 Main_x), 9706#(<= 8 Main_x), 9707#(<= 9 Main_x), 9708#(<= 10 Main_x), 9709#(<= 11 Main_x), 9710#(<= 12 Main_x), 9711#(<= 13 Main_x), 9712#(<= 14 Main_x), 9713#(<= 15 Main_x), 9714#(<= 16 Main_x), 9715#(<= 17 Main_x), 9716#(<= 18 Main_x), 9717#(<= 19 Main_x), 9718#(<= 20 Main_x), 9719#(<= 21 Main_x), 9720#(<= 22 Main_x)] [2018-07-23 13:56:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:09,915 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:56:09,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:56:09,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:56:09,916 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-07-23 13:56:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:09,956 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-07-23 13:56:09,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:56:09,957 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-23 13:56:09,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:09,957 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:56:09,957 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 13:56:09,958 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 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:56:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 13:56:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-23 13:56:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-23 13:56:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-07-23 13:56:09,979 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2018-07-23 13:56:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-07-23 13:56:09,980 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:56:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-07-23 13:56:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-23 13:56:09,980 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:09,980 INFO L357 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1] [2018-07-23 13:56:09,981 INFO L414 AbstractCegarLoop]: === Iteration 67 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 590536967, now seen corresponding path program 64 times [2018-07-23 13:56:09,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:10,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:56:10,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:10,099 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:56:10,099 INFO L185 omatonBuilderFactory]: Interpolants [9927#true, 9928#false, 9929#(and (<= 0 Main_y) (<= Main_y 0)), 9930#(and (<= 1 Main_y) (<= Main_y 1)), 9931#(and (<= Main_y 2) (<= 2 Main_y)), 9932#(and (<= Main_y 3) (<= 3 Main_y)), 9933#(and (<= Main_y 4) (<= 4 Main_y)), 9934#(and (<= Main_y 5) (<= 5 Main_y)), 9935#(and (<= Main_y 6) (<= 6 Main_y)), 9936#(and (<= 7 Main_y) (<= Main_y 7)), 9937#(and (<= 8 Main_y) (<= Main_y 8)), 9938#(and (<= Main_y 9) (<= 9 Main_y)), 9939#(and (<= 10 Main_y) (<= Main_y 10)), 9940#(and (<= 11 Main_y) (<= Main_y 11)), 9941#(and (<= 12 Main_y) (<= Main_y 12)), 9942#(and (<= 13 Main_y) (<= Main_y 13)), 9943#(and (<= 14 Main_y) (<= Main_y 14)), 9944#(and (<= Main_y 15) (<= 15 Main_y)), 9945#(and (<= 16 Main_y) (<= Main_y 16)), 9946#(and (<= Main_y 17) (<= 17 Main_y)), 9947#(and (<= Main_y 18) (<= 18 Main_y)), 9948#(and (<= Main_y 19) (<= 19 Main_y)), 9949#(and (<= 20 Main_y) (<= Main_y 20)), 9950#(and (<= 21 Main_y) (<= Main_y 21)), 9951#(and (<= Main_y 22) (<= 22 Main_y))] [2018-07-23 13:56:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,100 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:56:10,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:56:10,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:56:10,100 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 25 states. [2018-07-23 13:56:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:10,309 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-07-23 13:56:10,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:56:10,309 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-07-23 13:56:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:10,310 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:56:10,310 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:56:10,311 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:56:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:56:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-07-23 13:56:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:56:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-07-23 13:56:10,336 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2018-07-23 13:56:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:10,336 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-07-23 13:56:10,336 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:56:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-07-23 13:56:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:56:10,337 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:10,337 INFO L357 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-07-23 13:56:10,337 INFO L414 AbstractCegarLoop]: === Iteration 68 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1126715271, now seen corresponding path program 65 times [2018-07-23 13:56:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,409 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:10,409 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:56:10,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:10,409 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:56:10,410 INFO L185 omatonBuilderFactory]: Interpolants [10210#true, 10211#false, 10212#(<= Main_x 0), 10213#(<= Main_x 1), 10214#(<= Main_x 2), 10215#(<= Main_x 3), 10216#(<= Main_x 4), 10217#(<= Main_x 5), 10218#(<= Main_x 6), 10219#(<= Main_x 7), 10220#(<= Main_x 8), 10221#(<= Main_x 9), 10222#(<= Main_x 10), 10223#(<= Main_x 11), 10224#(<= Main_x 12), 10225#(<= Main_x 13), 10226#(<= Main_x 14), 10227#(<= Main_x 15), 10228#(<= Main_x 16), 10229#(<= Main_x 17), 10230#(<= Main_x 18), 10231#(<= Main_x 19), 10232#(<= Main_x 20), 10233#(<= Main_x 21), 10234#(<= Main_x 22), 10235#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,410 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:56:10,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:56:10,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:56:10,411 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-07-23 13:56:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:10,494 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-07-23 13:56:10,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:56:10,495 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-23 13:56:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:10,495 INFO L225 Difference]: With dead ends: 78 [2018-07-23 13:56:10,496 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 13:56:10,496 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:56:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 13:56:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 13:56:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 13:56:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-07-23 13:56:10,519 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 50 [2018-07-23 13:56:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:10,519 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-07-23 13:56:10,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:56:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-07-23 13:56:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 13:56:10,520 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:10,520 INFO L357 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-07-23 13:56:10,520 INFO L414 AbstractCegarLoop]: === Iteration 69 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1933230253, now seen corresponding path program 66 times [2018-07-23 13:56:10,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,608 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:10,608 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:56:10,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:10,608 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:56:10,608 INFO L185 omatonBuilderFactory]: Interpolants [10496#(<= 0 Main_x), 10497#(<= 1 Main_x), 10498#(<= 2 Main_x), 10499#(<= 3 Main_x), 10500#(<= 4 Main_x), 10501#(<= 5 Main_x), 10502#(<= 6 Main_x), 10503#(<= 7 Main_x), 10504#(<= 8 Main_x), 10505#(<= 9 Main_x), 10506#(<= 10 Main_x), 10507#(<= 11 Main_x), 10508#(<= 12 Main_x), 10509#(<= 13 Main_x), 10510#(<= 14 Main_x), 10511#(<= 15 Main_x), 10512#(<= 16 Main_x), 10513#(<= 17 Main_x), 10514#(<= 18 Main_x), 10515#(<= 19 Main_x), 10516#(<= 20 Main_x), 10517#(<= 21 Main_x), 10518#(<= 22 Main_x), 10519#(<= 23 Main_x), 10494#true, 10495#false] [2018-07-23 13:56:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,609 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:56:10,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:56:10,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:56:10,610 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-07-23 13:56:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:10,652 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-07-23 13:56:10,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:56:10,653 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-23 13:56:10,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:10,653 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:56:10,653 INFO L226 Difference]: Without dead ends: 52 [2018-07-23 13:56:10,654 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 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:56:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-23 13:56:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-23 13:56:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-23 13:56:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-07-23 13:56:10,677 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-07-23 13:56:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:10,677 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-07-23 13:56:10,677 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:56:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-07-23 13:56:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-23 13:56:10,678 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:10,678 INFO L357 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1] [2018-07-23 13:56:10,678 INFO L414 AbstractCegarLoop]: === Iteration 70 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:10,679 INFO L82 PathProgramCache]: Analyzing trace with hash -199465823, now seen corresponding path program 67 times [2018-07-23 13:56:10,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:10,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:56:10,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:10,820 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:56:10,820 INFO L185 omatonBuilderFactory]: Interpolants [10752#(and (<= 16 Main_y) (<= Main_y 16)), 10753#(and (<= Main_y 17) (<= 17 Main_y)), 10754#(and (<= Main_y 18) (<= 18 Main_y)), 10755#(and (<= Main_y 19) (<= 19 Main_y)), 10756#(and (<= 20 Main_y) (<= Main_y 20)), 10757#(and (<= 21 Main_y) (<= Main_y 21)), 10758#(and (<= Main_y 22) (<= 22 Main_y)), 10759#(and (<= 23 Main_y) (<= Main_y 23)), 10734#true, 10735#false, 10736#(and (<= 0 Main_y) (<= Main_y 0)), 10737#(and (<= 1 Main_y) (<= Main_y 1)), 10738#(and (<= Main_y 2) (<= 2 Main_y)), 10739#(and (<= Main_y 3) (<= 3 Main_y)), 10740#(and (<= Main_y 4) (<= 4 Main_y)), 10741#(and (<= Main_y 5) (<= 5 Main_y)), 10742#(and (<= Main_y 6) (<= 6 Main_y)), 10743#(and (<= 7 Main_y) (<= Main_y 7)), 10744#(and (<= 8 Main_y) (<= Main_y 8)), 10745#(and (<= Main_y 9) (<= 9 Main_y)), 10746#(and (<= 10 Main_y) (<= Main_y 10)), 10747#(and (<= 11 Main_y) (<= Main_y 11)), 10748#(and (<= 12 Main_y) (<= Main_y 12)), 10749#(and (<= 13 Main_y) (<= Main_y 13)), 10750#(and (<= 14 Main_y) (<= Main_y 14)), 10751#(and (<= Main_y 15) (<= 15 Main_y))] [2018-07-23 13:56:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:10,821 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:56:10,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:56:10,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:56:10,822 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 26 states. [2018-07-23 13:56:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:11,060 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-07-23 13:56:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:56:11,061 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-07-23 13:56:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:11,061 INFO L225 Difference]: With dead ends: 80 [2018-07-23 13:56:11,062 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:56:11,062 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:56:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:56:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-07-23 13:56:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 13:56:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-07-23 13:56:11,092 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2018-07-23 13:56:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:11,092 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-07-23 13:56:11,092 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:56:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-07-23 13:56:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:56:11,093 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:11,093 INFO L357 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-07-23 13:56:11,094 INFO L414 AbstractCegarLoop]: === Iteration 71 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1888534739, now seen corresponding path program 68 times [2018-07-23 13:56:11,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,180 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:11,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:56:11,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:11,181 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:56:11,181 INFO L185 omatonBuilderFactory]: Interpolants [11028#true, 11029#false, 11030#(<= Main_x 0), 11031#(<= Main_x 1), 11032#(<= Main_x 2), 11033#(<= Main_x 3), 11034#(<= Main_x 4), 11035#(<= Main_x 5), 11036#(<= Main_x 6), 11037#(<= Main_x 7), 11038#(<= Main_x 8), 11039#(<= Main_x 9), 11040#(<= Main_x 10), 11041#(<= Main_x 11), 11042#(<= Main_x 12), 11043#(<= Main_x 13), 11044#(<= Main_x 14), 11045#(<= Main_x 15), 11046#(<= Main_x 16), 11047#(<= Main_x 17), 11048#(<= Main_x 18), 11049#(<= Main_x 19), 11050#(<= Main_x 20), 11051#(<= Main_x 21), 11052#(<= Main_x 22), 11053#(<= Main_x 23), 11054#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,182 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:56:11,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:56:11,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:56:11,183 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 27 states. [2018-07-23 13:56:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:11,283 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-07-23 13:56:11,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:56:11,283 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-23 13:56:11,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:11,284 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:56:11,284 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:56:11,284 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:56:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:56:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 13:56:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 13:56:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-07-23 13:56:11,352 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 52 [2018-07-23 13:56:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:11,352 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-07-23 13:56:11,352 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:56:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-07-23 13:56:11,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 13:56:11,353 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:11,353 INFO L357 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-07-23 13:56:11,353 INFO L414 AbstractCegarLoop]: === Iteration 72 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1638593223, now seen corresponding path program 69 times [2018-07-23 13:56:11,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:11,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:56:11,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:11,431 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:56:11,431 INFO L185 omatonBuilderFactory]: Interpolants [11328#(<= 3 Main_x), 11329#(<= 4 Main_x), 11330#(<= 5 Main_x), 11331#(<= 6 Main_x), 11332#(<= 7 Main_x), 11333#(<= 8 Main_x), 11334#(<= 9 Main_x), 11335#(<= 10 Main_x), 11336#(<= 11 Main_x), 11337#(<= 12 Main_x), 11338#(<= 13 Main_x), 11339#(<= 14 Main_x), 11340#(<= 15 Main_x), 11341#(<= 16 Main_x), 11342#(<= 17 Main_x), 11343#(<= 18 Main_x), 11344#(<= 19 Main_x), 11345#(<= 20 Main_x), 11346#(<= 21 Main_x), 11347#(<= 22 Main_x), 11348#(<= 23 Main_x), 11349#(<= 24 Main_x), 11323#true, 11324#false, 11325#(<= 0 Main_x), 11326#(<= 1 Main_x), 11327#(<= 2 Main_x)] [2018-07-23 13:56:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:56:11,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:56:11,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:56:11,433 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-07-23 13:56:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:11,476 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-07-23 13:56:11,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:56:11,477 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-23 13:56:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:11,477 INFO L225 Difference]: With dead ends: 57 [2018-07-23 13:56:11,478 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 13:56:11,478 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 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:56:11,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 13:56:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-23 13:56:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-23 13:56:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-07-23 13:56:11,502 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2018-07-23 13:56:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:11,503 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-07-23 13:56:11,503 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:56:11,503 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-07-23 13:56:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 13:56:11,503 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:11,503 INFO L357 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1] [2018-07-23 13:56:11,504 INFO L414 AbstractCegarLoop]: === Iteration 73 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash -743279161, now seen corresponding path program 70 times [2018-07-23 13:56:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,620 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:11,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:56:11,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:11,621 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:56:11,621 INFO L185 omatonBuilderFactory]: Interpolants [11584#(and (<= 10 Main_y) (<= Main_y 10)), 11585#(and (<= 11 Main_y) (<= Main_y 11)), 11586#(and (<= 12 Main_y) (<= Main_y 12)), 11587#(and (<= 13 Main_y) (<= Main_y 13)), 11588#(and (<= 14 Main_y) (<= Main_y 14)), 11589#(and (<= Main_y 15) (<= 15 Main_y)), 11590#(and (<= 16 Main_y) (<= Main_y 16)), 11591#(and (<= Main_y 17) (<= 17 Main_y)), 11592#(and (<= Main_y 18) (<= 18 Main_y)), 11593#(and (<= Main_y 19) (<= 19 Main_y)), 11594#(and (<= 20 Main_y) (<= Main_y 20)), 11595#(and (<= 21 Main_y) (<= Main_y 21)), 11596#(and (<= Main_y 22) (<= 22 Main_y)), 11597#(and (<= 23 Main_y) (<= Main_y 23)), 11598#(and (<= Main_y 24) (<= 24 Main_y)), 11572#true, 11573#false, 11574#(and (<= 0 Main_y) (<= Main_y 0)), 11575#(and (<= 1 Main_y) (<= Main_y 1)), 11576#(and (<= Main_y 2) (<= 2 Main_y)), 11577#(and (<= Main_y 3) (<= 3 Main_y)), 11578#(and (<= Main_y 4) (<= 4 Main_y)), 11579#(and (<= Main_y 5) (<= 5 Main_y)), 11580#(and (<= Main_y 6) (<= 6 Main_y)), 11581#(and (<= 7 Main_y) (<= Main_y 7)), 11582#(and (<= 8 Main_y) (<= Main_y 8)), 11583#(and (<= Main_y 9) (<= 9 Main_y))] [2018-07-23 13:56:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,622 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:56:11,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:56:11,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:56:11,622 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 27 states. [2018-07-23 13:56:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:11,844 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-07-23 13:56:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:56:11,844 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-07-23 13:56:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:11,845 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:56:11,845 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:56:11,845 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:56:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:56:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2018-07-23 13:56:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:56:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-07-23 13:56:11,873 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2018-07-23 13:56:11,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:11,873 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-07-23 13:56:11,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:56:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-07-23 13:56:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:56:11,874 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:11,874 INFO L357 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-07-23 13:56:11,874 INFO L414 AbstractCegarLoop]: === Iteration 74 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1566879033, now seen corresponding path program 71 times [2018-07-23 13:56:11,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:11,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:56:11,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:11,947 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:56:11,948 INFO L185 omatonBuilderFactory]: Interpolants [11904#(<= (+ Main_x 1) 0), 11877#true, 11878#false, 11879#(<= Main_x 0), 11880#(<= Main_x 1), 11881#(<= Main_x 2), 11882#(<= Main_x 3), 11883#(<= Main_x 4), 11884#(<= Main_x 5), 11885#(<= Main_x 6), 11886#(<= Main_x 7), 11887#(<= Main_x 8), 11888#(<= Main_x 9), 11889#(<= Main_x 10), 11890#(<= Main_x 11), 11891#(<= Main_x 12), 11892#(<= Main_x 13), 11893#(<= Main_x 14), 11894#(<= Main_x 15), 11895#(<= Main_x 16), 11896#(<= Main_x 17), 11897#(<= Main_x 18), 11898#(<= Main_x 19), 11899#(<= Main_x 20), 11900#(<= Main_x 21), 11901#(<= Main_x 22), 11902#(<= Main_x 23), 11903#(<= Main_x 24)] [2018-07-23 13:56:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:11,948 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:56:11,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:56:11,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:56:11,949 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 28 states. [2018-07-23 13:56:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:12,039 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-07-23 13:56:12,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:56:12,039 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-23 13:56:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:12,040 INFO L225 Difference]: With dead ends: 84 [2018-07-23 13:56:12,040 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 13:56:12,040 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:56:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 13:56:12,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 13:56:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 13:56:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-07-23 13:56:12,065 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 54 [2018-07-23 13:56:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:12,065 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-07-23 13:56:12,065 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:56:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-07-23 13:56:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 13:56:12,066 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:12,066 INFO L357 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-07-23 13:56:12,066 INFO L414 AbstractCegarLoop]: === Iteration 75 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash 399905389, now seen corresponding path program 72 times [2018-07-23 13:56:12,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,144 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:12,144 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:56:12,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:12,144 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:56:12,144 INFO L185 omatonBuilderFactory]: Interpolants [12183#true, 12184#false, 12185#(<= 0 Main_x), 12186#(<= 1 Main_x), 12187#(<= 2 Main_x), 12188#(<= 3 Main_x), 12189#(<= 4 Main_x), 12190#(<= 5 Main_x), 12191#(<= 6 Main_x), 12192#(<= 7 Main_x), 12193#(<= 8 Main_x), 12194#(<= 9 Main_x), 12195#(<= 10 Main_x), 12196#(<= 11 Main_x), 12197#(<= 12 Main_x), 12198#(<= 13 Main_x), 12199#(<= 14 Main_x), 12200#(<= 15 Main_x), 12201#(<= 16 Main_x), 12202#(<= 17 Main_x), 12203#(<= 18 Main_x), 12204#(<= 19 Main_x), 12205#(<= 20 Main_x), 12206#(<= 21 Main_x), 12207#(<= 22 Main_x), 12208#(<= 23 Main_x), 12209#(<= 24 Main_x), 12210#(<= 25 Main_x)] [2018-07-23 13:56:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,145 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:56:12,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:56:12,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:56:12,146 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-07-23 13:56:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:12,190 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-07-23 13:56:12,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:56:12,191 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-23 13:56:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:12,191 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:56:12,191 INFO L226 Difference]: Without dead ends: 56 [2018-07-23 13:56:12,192 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:56:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-23 13:56:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-23 13:56:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-23 13:56:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-07-23 13:56:12,219 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-07-23 13:56:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:12,220 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-07-23 13:56:12,220 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:56:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-07-23 13:56:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-23 13:56:12,221 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:12,221 INFO L357 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1] [2018-07-23 13:56:12,221 INFO L414 AbstractCegarLoop]: === Iteration 76 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash -487896351, now seen corresponding path program 73 times [2018-07-23 13:56:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,344 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:12,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:56:12,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:12,345 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:56:12,345 INFO L185 omatonBuilderFactory]: Interpolants [12441#true, 12442#false, 12443#(and (<= 0 Main_y) (<= Main_y 0)), 12444#(and (<= 1 Main_y) (<= Main_y 1)), 12445#(and (<= Main_y 2) (<= 2 Main_y)), 12446#(and (<= Main_y 3) (<= 3 Main_y)), 12447#(and (<= Main_y 4) (<= 4 Main_y)), 12448#(and (<= Main_y 5) (<= 5 Main_y)), 12449#(and (<= Main_y 6) (<= 6 Main_y)), 12450#(and (<= 7 Main_y) (<= Main_y 7)), 12451#(and (<= 8 Main_y) (<= Main_y 8)), 12452#(and (<= Main_y 9) (<= 9 Main_y)), 12453#(and (<= 10 Main_y) (<= Main_y 10)), 12454#(and (<= 11 Main_y) (<= Main_y 11)), 12455#(and (<= 12 Main_y) (<= Main_y 12)), 12456#(and (<= 13 Main_y) (<= Main_y 13)), 12457#(and (<= 14 Main_y) (<= Main_y 14)), 12458#(and (<= Main_y 15) (<= 15 Main_y)), 12459#(and (<= 16 Main_y) (<= Main_y 16)), 12460#(and (<= Main_y 17) (<= 17 Main_y)), 12461#(and (<= Main_y 18) (<= 18 Main_y)), 12462#(and (<= Main_y 19) (<= 19 Main_y)), 12463#(and (<= 20 Main_y) (<= Main_y 20)), 12464#(and (<= 21 Main_y) (<= Main_y 21)), 12465#(and (<= Main_y 22) (<= 22 Main_y)), 12466#(and (<= 23 Main_y) (<= Main_y 23)), 12467#(and (<= Main_y 24) (<= 24 Main_y)), 12468#(and (<= 25 Main_y) (<= Main_y 25))] [2018-07-23 13:56:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,346 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:56:12,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:56:12,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:56:12,346 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 28 states. [2018-07-23 13:56:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:12,577 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-07-23 13:56:12,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:56:12,578 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-07-23 13:56:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:12,578 INFO L225 Difference]: With dead ends: 86 [2018-07-23 13:56:12,578 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:56:12,579 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:56:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:56:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2018-07-23 13:56:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:56:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-07-23 13:56:12,611 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2018-07-23 13:56:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:12,611 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-07-23 13:56:12,611 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:56:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-07-23 13:56:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:56:12,612 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:12,612 INFO L357 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-07-23 13:56:12,612 INFO L414 AbstractCegarLoop]: === Iteration 77 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:12,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2055020781, now seen corresponding path program 74 times [2018-07-23 13:56:12,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,683 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:12,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:56:12,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:12,683 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:56:12,683 INFO L185 omatonBuilderFactory]: Interpolants [12757#true, 12758#false, 12759#(<= Main_x 0), 12760#(<= Main_x 1), 12761#(<= Main_x 2), 12762#(<= Main_x 3), 12763#(<= Main_x 4), 12764#(<= Main_x 5), 12765#(<= Main_x 6), 12766#(<= Main_x 7), 12767#(<= Main_x 8), 12768#(<= Main_x 9), 12769#(<= Main_x 10), 12770#(<= Main_x 11), 12771#(<= Main_x 12), 12772#(<= Main_x 13), 12773#(<= Main_x 14), 12774#(<= Main_x 15), 12775#(<= Main_x 16), 12776#(<= Main_x 17), 12777#(<= Main_x 18), 12778#(<= Main_x 19), 12779#(<= Main_x 20), 12780#(<= Main_x 21), 12781#(<= Main_x 22), 12782#(<= Main_x 23), 12783#(<= Main_x 24), 12784#(<= Main_x 25), 12785#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,684 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:56:12,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:56:12,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:56:12,685 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 29 states. [2018-07-23 13:56:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:12,780 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-07-23 13:56:12,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:56:12,780 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-23 13:56:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:12,781 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:56:12,781 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:56:12,782 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:56:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:56:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:56:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:56:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-07-23 13:56:12,809 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 56 [2018-07-23 13:56:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:12,810 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-07-23 13:56:12,810 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:56:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-07-23 13:56:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 13:56:12,810 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:12,811 INFO L357 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-07-23 13:56:12,811 INFO L414 AbstractCegarLoop]: === Iteration 78 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1399171577, now seen corresponding path program 75 times [2018-07-23 13:56:12,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,892 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:12,892 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:56:12,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:12,893 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:56:12,893 INFO L185 omatonBuilderFactory]: Interpolants [13074#true, 13075#false, 13076#(<= 0 Main_x), 13077#(<= 1 Main_x), 13078#(<= 2 Main_x), 13079#(<= 3 Main_x), 13080#(<= 4 Main_x), 13081#(<= 5 Main_x), 13082#(<= 6 Main_x), 13083#(<= 7 Main_x), 13084#(<= 8 Main_x), 13085#(<= 9 Main_x), 13086#(<= 10 Main_x), 13087#(<= 11 Main_x), 13088#(<= 12 Main_x), 13089#(<= 13 Main_x), 13090#(<= 14 Main_x), 13091#(<= 15 Main_x), 13092#(<= 16 Main_x), 13093#(<= 17 Main_x), 13094#(<= 18 Main_x), 13095#(<= 19 Main_x), 13096#(<= 20 Main_x), 13097#(<= 21 Main_x), 13098#(<= 22 Main_x), 13099#(<= 23 Main_x), 13100#(<= 24 Main_x), 13101#(<= 25 Main_x), 13102#(<= 26 Main_x)] [2018-07-23 13:56:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:12,893 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:56:12,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:56:12,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:56:12,894 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-07-23 13:56:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:12,938 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-07-23 13:56:12,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:56:12,939 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-23 13:56:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:12,939 INFO L225 Difference]: With dead ends: 61 [2018-07-23 13:56:12,940 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 13:56:12,940 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:56:12,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 13:56:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-23 13:56:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:56:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-07-23 13:56:12,966 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-07-23 13:56:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-07-23 13:56:12,966 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:56:12,966 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-07-23 13:56:12,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 13:56:12,967 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:12,967 INFO L357 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1] [2018-07-23 13:56:12,967 INFO L414 AbstractCegarLoop]: === Iteration 79 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:12,967 INFO L82 PathProgramCache]: Analyzing trace with hash -424707449, now seen corresponding path program 76 times [2018-07-23 13:56:12,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:13,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:56:13,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:13,100 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:56:13,100 INFO L185 omatonBuilderFactory]: Interpolants [13341#true, 13342#false, 13343#(and (<= 0 Main_y) (<= Main_y 0)), 13344#(and (<= 1 Main_y) (<= Main_y 1)), 13345#(and (<= Main_y 2) (<= 2 Main_y)), 13346#(and (<= Main_y 3) (<= 3 Main_y)), 13347#(and (<= Main_y 4) (<= 4 Main_y)), 13348#(and (<= Main_y 5) (<= 5 Main_y)), 13349#(and (<= Main_y 6) (<= 6 Main_y)), 13350#(and (<= 7 Main_y) (<= Main_y 7)), 13351#(and (<= 8 Main_y) (<= Main_y 8)), 13352#(and (<= Main_y 9) (<= 9 Main_y)), 13353#(and (<= 10 Main_y) (<= Main_y 10)), 13354#(and (<= 11 Main_y) (<= Main_y 11)), 13355#(and (<= 12 Main_y) (<= Main_y 12)), 13356#(and (<= 13 Main_y) (<= Main_y 13)), 13357#(and (<= 14 Main_y) (<= Main_y 14)), 13358#(and (<= Main_y 15) (<= 15 Main_y)), 13359#(and (<= 16 Main_y) (<= Main_y 16)), 13360#(and (<= Main_y 17) (<= 17 Main_y)), 13361#(and (<= Main_y 18) (<= 18 Main_y)), 13362#(and (<= Main_y 19) (<= 19 Main_y)), 13363#(and (<= 20 Main_y) (<= Main_y 20)), 13364#(and (<= 21 Main_y) (<= Main_y 21)), 13365#(and (<= Main_y 22) (<= 22 Main_y)), 13366#(and (<= 23 Main_y) (<= Main_y 23)), 13367#(and (<= Main_y 24) (<= 24 Main_y)), 13368#(and (<= 25 Main_y) (<= Main_y 25)), 13369#(and (<= Main_y 26) (<= 26 Main_y))] [2018-07-23 13:56:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,101 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:56:13,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:56:13,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:56:13,102 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 29 states. [2018-07-23 13:56:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:13,362 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-07-23 13:56:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:56:13,363 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-07-23 13:56:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:13,364 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:56:13,364 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:56:13,364 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:56:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:56:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-07-23 13:56:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 13:56:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-07-23 13:56:13,395 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2018-07-23 13:56:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:13,396 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-07-23 13:56:13,396 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:56:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-07-23 13:56:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:56:13,396 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:13,397 INFO L357 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-07-23 13:56:13,397 INFO L414 AbstractCegarLoop]: === Iteration 80 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:13,397 INFO L82 PathProgramCache]: Analyzing trace with hash -281090553, now seen corresponding path program 77 times [2018-07-23 13:56:13,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:13,479 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:56:13,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:13,480 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:56:13,480 INFO L185 omatonBuilderFactory]: Interpolants [13696#(<= Main_x 26), 13697#(<= (+ Main_x 1) 0), 13668#true, 13669#false, 13670#(<= Main_x 0), 13671#(<= Main_x 1), 13672#(<= Main_x 2), 13673#(<= Main_x 3), 13674#(<= Main_x 4), 13675#(<= Main_x 5), 13676#(<= Main_x 6), 13677#(<= Main_x 7), 13678#(<= Main_x 8), 13679#(<= Main_x 9), 13680#(<= Main_x 10), 13681#(<= Main_x 11), 13682#(<= Main_x 12), 13683#(<= Main_x 13), 13684#(<= Main_x 14), 13685#(<= Main_x 15), 13686#(<= Main_x 16), 13687#(<= Main_x 17), 13688#(<= Main_x 18), 13689#(<= Main_x 19), 13690#(<= Main_x 20), 13691#(<= Main_x 21), 13692#(<= Main_x 22), 13693#(<= Main_x 23), 13694#(<= Main_x 24), 13695#(<= Main_x 25)] [2018-07-23 13:56:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,483 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:56:13,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:56:13,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:56:13,484 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 30 states. [2018-07-23 13:56:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:13,588 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-07-23 13:56:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:56:13,588 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-23 13:56:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:13,589 INFO L225 Difference]: With dead ends: 90 [2018-07-23 13:56:13,589 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 13:56:13,590 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:56:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 13:56:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 13:56:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 13:56:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-07-23 13:56:13,618 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 58 [2018-07-23 13:56:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:13,618 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-07-23 13:56:13,618 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:56:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-07-23 13:56:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 13:56:13,619 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:13,619 INFO L357 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-07-23 13:56:13,619 INFO L414 AbstractCegarLoop]: === Iteration 81 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash 13128749, now seen corresponding path program 78 times [2018-07-23 13:56:13,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:13,703 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:56:13,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:13,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:56:13,703 INFO L185 omatonBuilderFactory]: Interpolants [14016#(<= 18 Main_x), 14017#(<= 19 Main_x), 14018#(<= 20 Main_x), 14019#(<= 21 Main_x), 14020#(<= 22 Main_x), 14021#(<= 23 Main_x), 14022#(<= 24 Main_x), 14023#(<= 25 Main_x), 14024#(<= 26 Main_x), 14025#(<= 27 Main_x), 13996#true, 13997#false, 13998#(<= 0 Main_x), 13999#(<= 1 Main_x), 14000#(<= 2 Main_x), 14001#(<= 3 Main_x), 14002#(<= 4 Main_x), 14003#(<= 5 Main_x), 14004#(<= 6 Main_x), 14005#(<= 7 Main_x), 14006#(<= 8 Main_x), 14007#(<= 9 Main_x), 14008#(<= 10 Main_x), 14009#(<= 11 Main_x), 14010#(<= 12 Main_x), 14011#(<= 13 Main_x), 14012#(<= 14 Main_x), 14013#(<= 15 Main_x), 14014#(<= 16 Main_x), 14015#(<= 17 Main_x)] [2018-07-23 13:56:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,704 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:56:13,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:56:13,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:56:13,705 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-07-23 13:56:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:13,751 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-07-23 13:56:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:56:13,752 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-23 13:56:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:13,752 INFO L225 Difference]: With dead ends: 63 [2018-07-23 13:56:13,752 INFO L226 Difference]: Without dead ends: 60 [2018-07-23 13:56:13,753 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:56:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-23 13:56:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-23 13:56:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-23 13:56:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-07-23 13:56:13,780 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-07-23 13:56:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:13,780 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-07-23 13:56:13,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:56:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-07-23 13:56:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-23 13:56:13,781 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:13,781 INFO L357 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1] [2018-07-23 13:56:13,781 INFO L414 AbstractCegarLoop]: === Iteration 82 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash 406929697, now seen corresponding path program 79 times [2018-07-23 13:56:13,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,908 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:13,908 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:56:13,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:13,908 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:56:13,909 INFO L185 omatonBuilderFactory]: Interpolants [14272#true, 14273#false, 14274#(and (<= 0 Main_y) (<= Main_y 0)), 14275#(and (<= 1 Main_y) (<= Main_y 1)), 14276#(and (<= Main_y 2) (<= 2 Main_y)), 14277#(and (<= Main_y 3) (<= 3 Main_y)), 14278#(and (<= Main_y 4) (<= 4 Main_y)), 14279#(and (<= Main_y 5) (<= 5 Main_y)), 14280#(and (<= Main_y 6) (<= 6 Main_y)), 14281#(and (<= 7 Main_y) (<= Main_y 7)), 14282#(and (<= 8 Main_y) (<= Main_y 8)), 14283#(and (<= Main_y 9) (<= 9 Main_y)), 14284#(and (<= 10 Main_y) (<= Main_y 10)), 14285#(and (<= 11 Main_y) (<= Main_y 11)), 14286#(and (<= 12 Main_y) (<= Main_y 12)), 14287#(and (<= 13 Main_y) (<= Main_y 13)), 14288#(and (<= 14 Main_y) (<= Main_y 14)), 14289#(and (<= Main_y 15) (<= 15 Main_y)), 14290#(and (<= 16 Main_y) (<= Main_y 16)), 14291#(and (<= Main_y 17) (<= 17 Main_y)), 14292#(and (<= Main_y 18) (<= 18 Main_y)), 14293#(and (<= Main_y 19) (<= 19 Main_y)), 14294#(and (<= 20 Main_y) (<= Main_y 20)), 14295#(and (<= 21 Main_y) (<= Main_y 21)), 14296#(and (<= Main_y 22) (<= 22 Main_y)), 14297#(and (<= 23 Main_y) (<= Main_y 23)), 14298#(and (<= Main_y 24) (<= 24 Main_y)), 14299#(and (<= 25 Main_y) (<= Main_y 25)), 14300#(and (<= Main_y 26) (<= 26 Main_y)), 14301#(and (<= 27 Main_y) (<= Main_y 27))] [2018-07-23 13:56:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:13,909 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:56:13,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:56:13,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:56:13,910 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2018-07-23 13:56:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:14,176 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-07-23 13:56:14,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:56:14,176 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2018-07-23 13:56:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:14,177 INFO L225 Difference]: With dead ends: 92 [2018-07-23 13:56:14,177 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:56:14,178 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:56:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:56:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-07-23 13:56:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 13:56:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-07-23 13:56:14,215 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2018-07-23 13:56:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:14,216 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-07-23 13:56:14,216 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:56:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-07-23 13:56:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:56:14,217 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:14,217 INFO L357 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-07-23 13:56:14,217 INFO L414 AbstractCegarLoop]: === Iteration 83 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:14,217 INFO L82 PathProgramCache]: Analyzing trace with hash -270142803, now seen corresponding path program 80 times [2018-07-23 13:56:14,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:14,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:14,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:14,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:56:14,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:14,313 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:56:14,313 INFO L185 omatonBuilderFactory]: Interpolants [14610#true, 14611#false, 14612#(<= Main_x 0), 14613#(<= Main_x 1), 14614#(<= Main_x 2), 14615#(<= Main_x 3), 14616#(<= Main_x 4), 14617#(<= Main_x 5), 14618#(<= Main_x 6), 14619#(<= Main_x 7), 14620#(<= Main_x 8), 14621#(<= Main_x 9), 14622#(<= Main_x 10), 14623#(<= Main_x 11), 14624#(<= Main_x 12), 14625#(<= Main_x 13), 14626#(<= Main_x 14), 14627#(<= Main_x 15), 14628#(<= Main_x 16), 14629#(<= Main_x 17), 14630#(<= Main_x 18), 14631#(<= Main_x 19), 14632#(<= Main_x 20), 14633#(<= Main_x 21), 14634#(<= Main_x 22), 14635#(<= Main_x 23), 14636#(<= Main_x 24), 14637#(<= Main_x 25), 14638#(<= Main_x 26), 14639#(<= Main_x 27), 14640#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:14,313 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:14,314 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:56:14,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:56:14,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:56:14,315 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 31 states. [2018-07-23 13:56:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:14,431 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-07-23 13:56:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:56:14,431 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-23 13:56:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:14,432 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:56:14,432 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 13:56:14,433 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:56:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 13:56:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 13:56:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 13:56:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-07-23 13:56:14,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 60 [2018-07-23 13:56:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:14,466 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-07-23 13:56:14,466 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:56:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-07-23 13:56:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 13:56:14,467 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:14,467 INFO L357 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-07-23 13:56:14,467 INFO L414 AbstractCegarLoop]: === Iteration 84 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 260720967, now seen corresponding path program 81 times [2018-07-23 13:56:14,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:14,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:14,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:56:14,567 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:14,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:56:14,568 INFO L185 omatonBuilderFactory]: Interpolants [14976#(<= 25 Main_x), 14977#(<= 26 Main_x), 14978#(<= 27 Main_x), 14979#(<= 28 Main_x), 14949#true, 14950#false, 14951#(<= 0 Main_x), 14952#(<= 1 Main_x), 14953#(<= 2 Main_x), 14954#(<= 3 Main_x), 14955#(<= 4 Main_x), 14956#(<= 5 Main_x), 14957#(<= 6 Main_x), 14958#(<= 7 Main_x), 14959#(<= 8 Main_x), 14960#(<= 9 Main_x), 14961#(<= 10 Main_x), 14962#(<= 11 Main_x), 14963#(<= 12 Main_x), 14964#(<= 13 Main_x), 14965#(<= 14 Main_x), 14966#(<= 15 Main_x), 14967#(<= 16 Main_x), 14968#(<= 17 Main_x), 14969#(<= 18 Main_x), 14970#(<= 19 Main_x), 14971#(<= 20 Main_x), 14972#(<= 21 Main_x), 14973#(<= 22 Main_x), 14974#(<= 23 Main_x), 14975#(<= 24 Main_x)] [2018-07-23 13:56:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:14,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:56:14,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:56:14,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:56:14,569 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-07-23 13:56:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:14,624 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-07-23 13:56:14,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:56:14,624 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-23 13:56:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:14,625 INFO L225 Difference]: With dead ends: 65 [2018-07-23 13:56:14,625 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 13:56:14,625 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:56:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 13:56:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-23 13:56:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-23 13:56:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-07-23 13:56:14,659 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2018-07-23 13:56:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:14,659 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-07-23 13:56:14,659 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:56:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-07-23 13:56:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-23 13:56:14,660 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:14,679 INFO L357 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1] [2018-07-23 13:56:14,679 INFO L414 AbstractCegarLoop]: === Iteration 85 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash -507646137, now seen corresponding path program 82 times [2018-07-23 13:56:14,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:14,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:14,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:56:14,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:14,800 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:56:14,801 INFO L185 omatonBuilderFactory]: Interpolants [15234#true, 15235#false, 15236#(and (<= 0 Main_y) (<= Main_y 0)), 15237#(and (<= 1 Main_y) (<= Main_y 1)), 15238#(and (<= Main_y 2) (<= 2 Main_y)), 15239#(and (<= Main_y 3) (<= 3 Main_y)), 15240#(and (<= Main_y 4) (<= 4 Main_y)), 15241#(and (<= Main_y 5) (<= 5 Main_y)), 15242#(and (<= Main_y 6) (<= 6 Main_y)), 15243#(and (<= 7 Main_y) (<= Main_y 7)), 15244#(and (<= 8 Main_y) (<= Main_y 8)), 15245#(and (<= Main_y 9) (<= 9 Main_y)), 15246#(and (<= 10 Main_y) (<= Main_y 10)), 15247#(and (<= 11 Main_y) (<= Main_y 11)), 15248#(and (<= 12 Main_y) (<= Main_y 12)), 15249#(and (<= 13 Main_y) (<= Main_y 13)), 15250#(and (<= 14 Main_y) (<= Main_y 14)), 15251#(and (<= Main_y 15) (<= 15 Main_y)), 15252#(and (<= 16 Main_y) (<= Main_y 16)), 15253#(and (<= Main_y 17) (<= 17 Main_y)), 15254#(and (<= Main_y 18) (<= 18 Main_y)), 15255#(and (<= Main_y 19) (<= 19 Main_y)), 15256#(and (<= 20 Main_y) (<= Main_y 20)), 15257#(and (<= 21 Main_y) (<= Main_y 21)), 15258#(and (<= Main_y 22) (<= 22 Main_y)), 15259#(and (<= 23 Main_y) (<= Main_y 23)), 15260#(and (<= Main_y 24) (<= 24 Main_y)), 15261#(and (<= 25 Main_y) (<= Main_y 25)), 15262#(and (<= Main_y 26) (<= 26 Main_y)), 15263#(and (<= 27 Main_y) (<= Main_y 27)), 15264#(and (<= 28 Main_y) (<= Main_y 28))] [2018-07-23 13:56:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:14,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:56:14,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:56:14,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:56:14,802 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 31 states. [2018-07-23 13:56:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:15,048 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-07-23 13:56:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:56:15,048 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-07-23 13:56:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:15,049 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:56:15,049 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:56:15,050 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:56:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:56:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-07-23 13:56:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 13:56:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-07-23 13:56:15,082 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2018-07-23 13:56:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:15,083 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-07-23 13:56:15,083 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:56:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-07-23 13:56:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:56:15,083 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:15,084 INFO L357 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-07-23 13:56:15,084 INFO L414 AbstractCegarLoop]: === Iteration 86 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1442777415, now seen corresponding path program 83 times [2018-07-23 13:56:15,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:15,157 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:56:15,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:15,158 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:56:15,158 INFO L185 omatonBuilderFactory]: Interpolants [15583#true, 15584#false, 15585#(<= Main_x 0), 15586#(<= Main_x 1), 15587#(<= Main_x 2), 15588#(<= Main_x 3), 15589#(<= Main_x 4), 15590#(<= Main_x 5), 15591#(<= Main_x 6), 15592#(<= Main_x 7), 15593#(<= Main_x 8), 15594#(<= Main_x 9), 15595#(<= Main_x 10), 15596#(<= Main_x 11), 15597#(<= Main_x 12), 15598#(<= Main_x 13), 15599#(<= Main_x 14), 15600#(<= Main_x 15), 15601#(<= Main_x 16), 15602#(<= Main_x 17), 15603#(<= Main_x 18), 15604#(<= Main_x 19), 15605#(<= Main_x 20), 15606#(<= Main_x 21), 15607#(<= Main_x 22), 15608#(<= Main_x 23), 15609#(<= Main_x 24), 15610#(<= Main_x 25), 15611#(<= Main_x 26), 15612#(<= Main_x 27), 15613#(<= Main_x 28), 15614#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,159 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:56:15,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:56:15,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:56:15,159 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 32 states. [2018-07-23 13:56:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:15,259 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-07-23 13:56:15,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:56:15,259 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-23 13:56:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:15,260 INFO L225 Difference]: With dead ends: 96 [2018-07-23 13:56:15,260 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 13:56:15,261 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:56:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 13:56:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 13:56:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 13:56:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-07-23 13:56:15,289 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 62 [2018-07-23 13:56:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:15,290 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-07-23 13:56:15,290 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:56:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-07-23 13:56:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 13:56:15,290 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:15,291 INFO L357 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-07-23 13:56:15,291 INFO L414 AbstractCegarLoop]: === Iteration 87 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash 719685101, now seen corresponding path program 84 times [2018-07-23 13:56:15,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:15,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:56:15,366 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:15,366 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:56:15,367 INFO L185 omatonBuilderFactory]: Interpolants [15936#(<= 1 Main_x), 15937#(<= 2 Main_x), 15938#(<= 3 Main_x), 15939#(<= 4 Main_x), 15940#(<= 5 Main_x), 15941#(<= 6 Main_x), 15942#(<= 7 Main_x), 15943#(<= 8 Main_x), 15944#(<= 9 Main_x), 15945#(<= 10 Main_x), 15946#(<= 11 Main_x), 15947#(<= 12 Main_x), 15948#(<= 13 Main_x), 15949#(<= 14 Main_x), 15950#(<= 15 Main_x), 15951#(<= 16 Main_x), 15952#(<= 17 Main_x), 15953#(<= 18 Main_x), 15954#(<= 19 Main_x), 15955#(<= 20 Main_x), 15956#(<= 21 Main_x), 15957#(<= 22 Main_x), 15958#(<= 23 Main_x), 15959#(<= 24 Main_x), 15960#(<= 25 Main_x), 15961#(<= 26 Main_x), 15962#(<= 27 Main_x), 15963#(<= 28 Main_x), 15964#(<= 29 Main_x), 15933#true, 15934#false, 15935#(<= 0 Main_x)] [2018-07-23 13:56:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,367 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:56:15,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:56:15,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:56:15,368 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-07-23 13:56:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:15,413 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-07-23 13:56:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:56:15,414 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-23 13:56:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:15,414 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:56:15,414 INFO L226 Difference]: Without dead ends: 64 [2018-07-23 13:56:15,415 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:56:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-23 13:56:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-23 13:56:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-23 13:56:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-07-23 13:56:15,446 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-07-23 13:56:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:15,446 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-07-23 13:56:15,446 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:56:15,446 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-07-23 13:56:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 13:56:15,447 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:15,447 INFO L357 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1] [2018-07-23 13:56:15,447 INFO L414 AbstractCegarLoop]: === Iteration 88 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash 835340129, now seen corresponding path program 85 times [2018-07-23 13:56:15,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:15,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:56:15,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:15,562 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:56:15,562 INFO L185 omatonBuilderFactory]: Interpolants [16256#(and (<= 27 Main_y) (<= Main_y 27)), 16257#(and (<= 28 Main_y) (<= Main_y 28)), 16258#(and (<= 29 Main_y) (<= Main_y 29)), 16227#true, 16228#false, 16229#(and (<= 0 Main_y) (<= Main_y 0)), 16230#(and (<= 1 Main_y) (<= Main_y 1)), 16231#(and (<= Main_y 2) (<= 2 Main_y)), 16232#(and (<= Main_y 3) (<= 3 Main_y)), 16233#(and (<= Main_y 4) (<= 4 Main_y)), 16234#(and (<= Main_y 5) (<= 5 Main_y)), 16235#(and (<= Main_y 6) (<= 6 Main_y)), 16236#(and (<= 7 Main_y) (<= Main_y 7)), 16237#(and (<= 8 Main_y) (<= Main_y 8)), 16238#(and (<= Main_y 9) (<= 9 Main_y)), 16239#(and (<= 10 Main_y) (<= Main_y 10)), 16240#(and (<= 11 Main_y) (<= Main_y 11)), 16241#(and (<= 12 Main_y) (<= Main_y 12)), 16242#(and (<= 13 Main_y) (<= Main_y 13)), 16243#(and (<= 14 Main_y) (<= Main_y 14)), 16244#(and (<= Main_y 15) (<= 15 Main_y)), 16245#(and (<= 16 Main_y) (<= Main_y 16)), 16246#(and (<= Main_y 17) (<= 17 Main_y)), 16247#(and (<= Main_y 18) (<= 18 Main_y)), 16248#(and (<= Main_y 19) (<= 19 Main_y)), 16249#(and (<= 20 Main_y) (<= Main_y 20)), 16250#(and (<= 21 Main_y) (<= Main_y 21)), 16251#(and (<= Main_y 22) (<= 22 Main_y)), 16252#(and (<= 23 Main_y) (<= Main_y 23)), 16253#(and (<= Main_y 24) (<= 24 Main_y)), 16254#(and (<= 25 Main_y) (<= Main_y 25)), 16255#(and (<= Main_y 26) (<= 26 Main_y))] [2018-07-23 13:56:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,563 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:56:15,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:56:15,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:56:15,563 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 32 states. [2018-07-23 13:56:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:15,817 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-07-23 13:56:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:56:15,818 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2018-07-23 13:56:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:15,819 INFO L225 Difference]: With dead ends: 98 [2018-07-23 13:56:15,819 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:56:15,819 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:56:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:56:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2018-07-23 13:56:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:56:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-07-23 13:56:15,852 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2018-07-23 13:56:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:15,853 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-07-23 13:56:15,853 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:56:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-07-23 13:56:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:56:15,853 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:15,854 INFO L357 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-07-23 13:56:15,854 INFO L414 AbstractCegarLoop]: === Iteration 89 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:15,854 INFO L82 PathProgramCache]: Analyzing trace with hash 125678701, now seen corresponding path program 86 times [2018-07-23 13:56:15,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:15,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:56:15,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:15,924 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:56:15,924 INFO L185 omatonBuilderFactory]: Interpolants [16587#true, 16588#false, 16589#(<= Main_x 0), 16590#(<= Main_x 1), 16591#(<= Main_x 2), 16592#(<= Main_x 3), 16593#(<= Main_x 4), 16594#(<= Main_x 5), 16595#(<= Main_x 6), 16596#(<= Main_x 7), 16597#(<= Main_x 8), 16598#(<= Main_x 9), 16599#(<= Main_x 10), 16600#(<= Main_x 11), 16601#(<= Main_x 12), 16602#(<= Main_x 13), 16603#(<= Main_x 14), 16604#(<= Main_x 15), 16605#(<= Main_x 16), 16606#(<= Main_x 17), 16607#(<= Main_x 18), 16608#(<= Main_x 19), 16609#(<= Main_x 20), 16610#(<= Main_x 21), 16611#(<= Main_x 22), 16612#(<= Main_x 23), 16613#(<= Main_x 24), 16614#(<= Main_x 25), 16615#(<= Main_x 26), 16616#(<= Main_x 27), 16617#(<= Main_x 28), 16618#(<= Main_x 29), 16619#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:15,925 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:56:15,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:56:15,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:56:15,926 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 33 states. [2018-07-23 13:56:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:16,031 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-07-23 13:56:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:56:16,031 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-23 13:56:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:16,032 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:56:16,032 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 13:56:16,032 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:56:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 13:56:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 13:56:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 13:56:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-07-23 13:56:16,064 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 64 [2018-07-23 13:56:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:16,064 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-07-23 13:56:16,064 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:56:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-07-23 13:56:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 13:56:16,065 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:16,065 INFO L357 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-07-23 13:56:16,065 INFO L414 AbstractCegarLoop]: === Iteration 90 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -815346553, now seen corresponding path program 87 times [2018-07-23 13:56:16,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:16,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:56:16,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:16,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:56:16,143 INFO L185 omatonBuilderFactory]: Interpolants [16960#(<= 10 Main_x), 16961#(<= 11 Main_x), 16962#(<= 12 Main_x), 16963#(<= 13 Main_x), 16964#(<= 14 Main_x), 16965#(<= 15 Main_x), 16966#(<= 16 Main_x), 16967#(<= 17 Main_x), 16968#(<= 18 Main_x), 16969#(<= 19 Main_x), 16970#(<= 20 Main_x), 16971#(<= 21 Main_x), 16972#(<= 22 Main_x), 16973#(<= 23 Main_x), 16974#(<= 24 Main_x), 16975#(<= 25 Main_x), 16976#(<= 26 Main_x), 16977#(<= 27 Main_x), 16978#(<= 28 Main_x), 16979#(<= 29 Main_x), 16980#(<= 30 Main_x), 16948#true, 16949#false, 16950#(<= 0 Main_x), 16951#(<= 1 Main_x), 16952#(<= 2 Main_x), 16953#(<= 3 Main_x), 16954#(<= 4 Main_x), 16955#(<= 5 Main_x), 16956#(<= 6 Main_x), 16957#(<= 7 Main_x), 16958#(<= 8 Main_x), 16959#(<= 9 Main_x)] [2018-07-23 13:56:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,143 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:56:16,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:56:16,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:56:16,144 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-07-23 13:56:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:16,194 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-07-23 13:56:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:56:16,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-23 13:56:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:16,195 INFO L225 Difference]: With dead ends: 69 [2018-07-23 13:56:16,195 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:56:16,196 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:56:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:56:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-23 13:56:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:56:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-07-23 13:56:16,228 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2018-07-23 13:56:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:16,228 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-07-23 13:56:16,228 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:56:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-07-23 13:56:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-23 13:56:16,229 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:16,229 INFO L357 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1] [2018-07-23 13:56:16,229 INFO L414 AbstractCegarLoop]: === Iteration 91 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash 493999111, now seen corresponding path program 88 times [2018-07-23 13:56:16,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,352 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:16,352 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:56:16,352 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:16,352 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:56:16,352 INFO L185 omatonBuilderFactory]: Interpolants [17280#(and (<= 27 Main_y) (<= Main_y 27)), 17281#(and (<= 28 Main_y) (<= Main_y 28)), 17282#(and (<= 29 Main_y) (<= Main_y 29)), 17283#(and (<= 30 Main_y) (<= Main_y 30)), 17251#true, 17252#false, 17253#(and (<= 0 Main_y) (<= Main_y 0)), 17254#(and (<= 1 Main_y) (<= Main_y 1)), 17255#(and (<= Main_y 2) (<= 2 Main_y)), 17256#(and (<= Main_y 3) (<= 3 Main_y)), 17257#(and (<= Main_y 4) (<= 4 Main_y)), 17258#(and (<= Main_y 5) (<= 5 Main_y)), 17259#(and (<= Main_y 6) (<= 6 Main_y)), 17260#(and (<= 7 Main_y) (<= Main_y 7)), 17261#(and (<= 8 Main_y) (<= Main_y 8)), 17262#(and (<= Main_y 9) (<= 9 Main_y)), 17263#(and (<= 10 Main_y) (<= Main_y 10)), 17264#(and (<= 11 Main_y) (<= Main_y 11)), 17265#(and (<= 12 Main_y) (<= Main_y 12)), 17266#(and (<= 13 Main_y) (<= Main_y 13)), 17267#(and (<= 14 Main_y) (<= Main_y 14)), 17268#(and (<= Main_y 15) (<= 15 Main_y)), 17269#(and (<= 16 Main_y) (<= Main_y 16)), 17270#(and (<= Main_y 17) (<= 17 Main_y)), 17271#(and (<= Main_y 18) (<= 18 Main_y)), 17272#(and (<= Main_y 19) (<= 19 Main_y)), 17273#(and (<= 20 Main_y) (<= Main_y 20)), 17274#(and (<= 21 Main_y) (<= Main_y 21)), 17275#(and (<= Main_y 22) (<= 22 Main_y)), 17276#(and (<= 23 Main_y) (<= Main_y 23)), 17277#(and (<= Main_y 24) (<= 24 Main_y)), 17278#(and (<= 25 Main_y) (<= Main_y 25)), 17279#(and (<= Main_y 26) (<= 26 Main_y))] [2018-07-23 13:56:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,353 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:56:16,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:56:16,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:56:16,354 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 33 states. [2018-07-23 13:56:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:16,612 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-07-23 13:56:16,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:56:16,612 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2018-07-23 13:56:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:16,613 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:56:16,613 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:56:16,614 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:56:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:56:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2018-07-23 13:56:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 13:56:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-07-23 13:56:16,651 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2018-07-23 13:56:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:16,651 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-07-23 13:56:16,651 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:56:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-07-23 13:56:16,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:56:16,652 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:16,652 INFO L357 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-07-23 13:56:16,652 INFO L414 AbstractCegarLoop]: === Iteration 92 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:16,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1865958265, now seen corresponding path program 89 times [2018-07-23 13:56:16,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,727 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:16,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:56:16,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:16,727 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:56:16,728 INFO L185 omatonBuilderFactory]: Interpolants [17622#true, 17623#false, 17624#(<= Main_x 0), 17625#(<= Main_x 1), 17626#(<= Main_x 2), 17627#(<= Main_x 3), 17628#(<= Main_x 4), 17629#(<= Main_x 5), 17630#(<= Main_x 6), 17631#(<= Main_x 7), 17632#(<= Main_x 8), 17633#(<= Main_x 9), 17634#(<= Main_x 10), 17635#(<= Main_x 11), 17636#(<= Main_x 12), 17637#(<= Main_x 13), 17638#(<= Main_x 14), 17639#(<= Main_x 15), 17640#(<= Main_x 16), 17641#(<= Main_x 17), 17642#(<= Main_x 18), 17643#(<= Main_x 19), 17644#(<= Main_x 20), 17645#(<= Main_x 21), 17646#(<= Main_x 22), 17647#(<= Main_x 23), 17648#(<= Main_x 24), 17649#(<= Main_x 25), 17650#(<= Main_x 26), 17651#(<= Main_x 27), 17652#(<= Main_x 28), 17653#(<= Main_x 29), 17654#(<= Main_x 30), 17655#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,728 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:56:16,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:56:16,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:56:16,729 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 34 states. [2018-07-23 13:56:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:16,844 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-07-23 13:56:16,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:56:16,844 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-23 13:56:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:16,845 INFO L225 Difference]: With dead ends: 102 [2018-07-23 13:56:16,845 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:56:16,845 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:56:16,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:56:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 13:56:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:56:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-07-23 13:56:16,878 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 66 [2018-07-23 13:56:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:16,878 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-07-23 13:56:16,879 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:56:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-07-23 13:56:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:56:16,879 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:16,879 INFO L357 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-07-23 13:56:16,880 INFO L414 AbstractCegarLoop]: === Iteration 93 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash -972970067, now seen corresponding path program 90 times [2018-07-23 13:56:16,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,958 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:16,958 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:56:16,958 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:16,958 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:56:16,958 INFO L185 omatonBuilderFactory]: Interpolants [17994#true, 17995#false, 17996#(<= 0 Main_x), 17997#(<= 1 Main_x), 17998#(<= 2 Main_x), 17999#(<= 3 Main_x), 18000#(<= 4 Main_x), 18001#(<= 5 Main_x), 18002#(<= 6 Main_x), 18003#(<= 7 Main_x), 18004#(<= 8 Main_x), 18005#(<= 9 Main_x), 18006#(<= 10 Main_x), 18007#(<= 11 Main_x), 18008#(<= 12 Main_x), 18009#(<= 13 Main_x), 18010#(<= 14 Main_x), 18011#(<= 15 Main_x), 18012#(<= 16 Main_x), 18013#(<= 17 Main_x), 18014#(<= 18 Main_x), 18015#(<= 19 Main_x), 18016#(<= 20 Main_x), 18017#(<= 21 Main_x), 18018#(<= 22 Main_x), 18019#(<= 23 Main_x), 18020#(<= 24 Main_x), 18021#(<= 25 Main_x), 18022#(<= 26 Main_x), 18023#(<= 27 Main_x), 18024#(<= 28 Main_x), 18025#(<= 29 Main_x), 18026#(<= 30 Main_x), 18027#(<= 31 Main_x)] [2018-07-23 13:56:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:16,959 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:56:16,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:56:16,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:56:16,960 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-07-23 13:56:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:17,011 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-07-23 13:56:17,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:56:17,011 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-23 13:56:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:17,012 INFO L225 Difference]: With dead ends: 71 [2018-07-23 13:56:17,012 INFO L226 Difference]: Without dead ends: 68 [2018-07-23 13:56:17,012 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:56:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-23 13:56:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-23 13:56:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-23 13:56:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-07-23 13:56:17,045 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2018-07-23 13:56:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:17,046 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-07-23 13:56:17,046 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:56:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-07-23 13:56:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-23 13:56:17,047 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:17,047 INFO L357 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1] [2018-07-23 13:56:17,047 INFO L414 AbstractCegarLoop]: === Iteration 94 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:17,047 INFO L82 PathProgramCache]: Analyzing trace with hash -97362527, now seen corresponding path program 91 times [2018-07-23 13:56:17,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:17,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:17,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:56:17,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:17,168 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:56:17,168 INFO L185 omatonBuilderFactory]: Interpolants [18306#true, 18307#false, 18308#(and (<= 0 Main_y) (<= Main_y 0)), 18309#(and (<= 1 Main_y) (<= Main_y 1)), 18310#(and (<= Main_y 2) (<= 2 Main_y)), 18311#(and (<= Main_y 3) (<= 3 Main_y)), 18312#(and (<= Main_y 4) (<= 4 Main_y)), 18313#(and (<= Main_y 5) (<= 5 Main_y)), 18314#(and (<= Main_y 6) (<= 6 Main_y)), 18315#(and (<= 7 Main_y) (<= Main_y 7)), 18316#(and (<= 8 Main_y) (<= Main_y 8)), 18317#(and (<= Main_y 9) (<= 9 Main_y)), 18318#(and (<= 10 Main_y) (<= Main_y 10)), 18319#(and (<= 11 Main_y) (<= Main_y 11)), 18320#(and (<= 12 Main_y) (<= Main_y 12)), 18321#(and (<= 13 Main_y) (<= Main_y 13)), 18322#(and (<= 14 Main_y) (<= Main_y 14)), 18323#(and (<= Main_y 15) (<= 15 Main_y)), 18324#(and (<= 16 Main_y) (<= Main_y 16)), 18325#(and (<= Main_y 17) (<= 17 Main_y)), 18326#(and (<= Main_y 18) (<= 18 Main_y)), 18327#(and (<= Main_y 19) (<= 19 Main_y)), 18328#(and (<= 20 Main_y) (<= Main_y 20)), 18329#(and (<= 21 Main_y) (<= Main_y 21)), 18330#(and (<= Main_y 22) (<= 22 Main_y)), 18331#(and (<= 23 Main_y) (<= Main_y 23)), 18332#(and (<= Main_y 24) (<= 24 Main_y)), 18333#(and (<= 25 Main_y) (<= Main_y 25)), 18334#(and (<= Main_y 26) (<= 26 Main_y)), 18335#(and (<= 27 Main_y) (<= Main_y 27)), 18336#(and (<= 28 Main_y) (<= Main_y 28)), 18337#(and (<= 29 Main_y) (<= Main_y 29)), 18338#(and (<= 30 Main_y) (<= Main_y 30)), 18339#(and (<= Main_y 31) (<= 31 Main_y))] [2018-07-23 13:56:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:17,168 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:56:17,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:56:17,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:56:17,169 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 34 states. [2018-07-23 13:56:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:17,468 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-07-23 13:56:17,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:56:17,469 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-07-23 13:56:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:17,470 INFO L225 Difference]: With dead ends: 104 [2018-07-23 13:56:17,470 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:56:17,470 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:56:17,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:56:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-07-23 13:56:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:56:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-07-23 13:56:17,513 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2018-07-23 13:56:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:17,513 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-07-23 13:56:17,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:56:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-07-23 13:56:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:56:17,514 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:17,514 INFO L357 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-07-23 13:56:17,514 INFO L414 AbstractCegarLoop]: === Iteration 95 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:17,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1276667437, now seen corresponding path program 92 times [2018-07-23 13:56:17,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:17,592 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:17,592 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:56:17,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:17,593 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:56:17,593 INFO L185 omatonBuilderFactory]: Interpolants [18688#true, 18689#false, 18690#(<= Main_x 0), 18691#(<= Main_x 1), 18692#(<= Main_x 2), 18693#(<= Main_x 3), 18694#(<= Main_x 4), 18695#(<= Main_x 5), 18696#(<= Main_x 6), 18697#(<= Main_x 7), 18698#(<= Main_x 8), 18699#(<= Main_x 9), 18700#(<= Main_x 10), 18701#(<= Main_x 11), 18702#(<= Main_x 12), 18703#(<= Main_x 13), 18704#(<= Main_x 14), 18705#(<= Main_x 15), 18706#(<= Main_x 16), 18707#(<= Main_x 17), 18708#(<= Main_x 18), 18709#(<= Main_x 19), 18710#(<= Main_x 20), 18711#(<= Main_x 21), 18712#(<= Main_x 22), 18713#(<= Main_x 23), 18714#(<= Main_x 24), 18715#(<= Main_x 25), 18716#(<= Main_x 26), 18717#(<= Main_x 27), 18718#(<= Main_x 28), 18719#(<= Main_x 29), 18720#(<= Main_x 30), 18721#(<= Main_x 31), 18722#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:17,593 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:56:17,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:56:17,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:56:17,594 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 35 states. [2018-07-23 13:56:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:17,711 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-07-23 13:56:17,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:56:17,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-23 13:56:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:17,712 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:56:17,712 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 13:56:17,713 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:56:17,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 13:56:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 13:56:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 13:56:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-07-23 13:56:17,752 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 68 [2018-07-23 13:56:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:17,752 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-07-23 13:56:17,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:56:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-07-23 13:56:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 13:56:17,753 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:17,753 INFO L357 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-07-23 13:56:17,753 INFO L414 AbstractCegarLoop]: === Iteration 96 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1105469497, now seen corresponding path program 93 times [2018-07-23 13:56:17,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:17,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:17,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:56:17,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:17,833 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:56:17,833 INFO L185 omatonBuilderFactory]: Interpolants [19072#false, 19073#(<= 0 Main_x), 19074#(<= 1 Main_x), 19075#(<= 2 Main_x), 19076#(<= 3 Main_x), 19077#(<= 4 Main_x), 19078#(<= 5 Main_x), 19079#(<= 6 Main_x), 19080#(<= 7 Main_x), 19081#(<= 8 Main_x), 19082#(<= 9 Main_x), 19083#(<= 10 Main_x), 19084#(<= 11 Main_x), 19085#(<= 12 Main_x), 19086#(<= 13 Main_x), 19087#(<= 14 Main_x), 19088#(<= 15 Main_x), 19089#(<= 16 Main_x), 19090#(<= 17 Main_x), 19091#(<= 18 Main_x), 19092#(<= 19 Main_x), 19093#(<= 20 Main_x), 19094#(<= 21 Main_x), 19095#(<= 22 Main_x), 19096#(<= 23 Main_x), 19097#(<= 24 Main_x), 19098#(<= 25 Main_x), 19099#(<= 26 Main_x), 19100#(<= 27 Main_x), 19101#(<= 28 Main_x), 19102#(<= 29 Main_x), 19103#(<= 30 Main_x), 19104#(<= 31 Main_x), 19105#(<= 32 Main_x), 19071#true] [2018-07-23 13:56:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:17,834 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:56:17,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:56:17,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:56:17,835 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-07-23 13:56:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:17,886 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-07-23 13:56:17,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:56:17,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-23 13:56:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:17,887 INFO L225 Difference]: With dead ends: 73 [2018-07-23 13:56:17,887 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 13:56:17,887 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:56:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 13:56:17,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-23 13:56:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-23 13:56:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-07-23 13:56:17,923 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-07-23 13:56:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:17,924 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-07-23 13:56:17,924 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:56:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-07-23 13:56:17,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-23 13:56:17,925 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:17,925 INFO L357 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1] [2018-07-23 13:56:17,925 INFO L414 AbstractCegarLoop]: === Iteration 97 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:17,925 INFO L82 PathProgramCache]: Analyzing trace with hash 90122439, now seen corresponding path program 94 times [2018-07-23 13:56:17,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,048 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:18,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:56:18,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:18,049 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:56:18,049 INFO L185 omatonBuilderFactory]: Interpolants [19392#true, 19393#false, 19394#(and (<= 0 Main_y) (<= Main_y 0)), 19395#(and (<= 1 Main_y) (<= Main_y 1)), 19396#(and (<= Main_y 2) (<= 2 Main_y)), 19397#(and (<= Main_y 3) (<= 3 Main_y)), 19398#(and (<= Main_y 4) (<= 4 Main_y)), 19399#(and (<= Main_y 5) (<= 5 Main_y)), 19400#(and (<= Main_y 6) (<= 6 Main_y)), 19401#(and (<= 7 Main_y) (<= Main_y 7)), 19402#(and (<= 8 Main_y) (<= Main_y 8)), 19403#(and (<= Main_y 9) (<= 9 Main_y)), 19404#(and (<= 10 Main_y) (<= Main_y 10)), 19405#(and (<= 11 Main_y) (<= Main_y 11)), 19406#(and (<= 12 Main_y) (<= Main_y 12)), 19407#(and (<= 13 Main_y) (<= Main_y 13)), 19408#(and (<= 14 Main_y) (<= Main_y 14)), 19409#(and (<= Main_y 15) (<= 15 Main_y)), 19410#(and (<= 16 Main_y) (<= Main_y 16)), 19411#(and (<= Main_y 17) (<= 17 Main_y)), 19412#(and (<= Main_y 18) (<= 18 Main_y)), 19413#(and (<= Main_y 19) (<= 19 Main_y)), 19414#(and (<= 20 Main_y) (<= Main_y 20)), 19415#(and (<= 21 Main_y) (<= Main_y 21)), 19416#(and (<= Main_y 22) (<= 22 Main_y)), 19417#(and (<= 23 Main_y) (<= Main_y 23)), 19418#(and (<= Main_y 24) (<= 24 Main_y)), 19419#(and (<= 25 Main_y) (<= Main_y 25)), 19420#(and (<= Main_y 26) (<= 26 Main_y)), 19421#(and (<= 27 Main_y) (<= Main_y 27)), 19422#(and (<= 28 Main_y) (<= Main_y 28)), 19423#(and (<= 29 Main_y) (<= Main_y 29)), 19424#(and (<= 30 Main_y) (<= Main_y 30)), 19425#(and (<= Main_y 31) (<= 31 Main_y)), 19426#(and (<= 32 Main_y) (<= Main_y 32))] [2018-07-23 13:56:18,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,049 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:56:18,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:56:18,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:56:18,050 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 35 states. [2018-07-23 13:56:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:18,315 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-07-23 13:56:18,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:56:18,315 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2018-07-23 13:56:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:18,316 INFO L225 Difference]: With dead ends: 107 [2018-07-23 13:56:18,316 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:56:18,316 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:56:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:56:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2018-07-23 13:56:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:56:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-07-23 13:56:18,359 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2018-07-23 13:56:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:18,359 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-07-23 13:56:18,359 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:56:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-07-23 13:56:18,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:56:18,360 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:18,360 INFO L357 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-07-23 13:56:18,360 INFO L414 AbstractCegarLoop]: === Iteration 98 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1501233209, now seen corresponding path program 95 times [2018-07-23 13:56:18,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:18,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:56:18,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:18,442 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:56:18,443 INFO L185 omatonBuilderFactory]: Interpolants [19785#true, 19786#false, 19787#(<= Main_x 0), 19788#(<= Main_x 1), 19789#(<= Main_x 2), 19790#(<= Main_x 3), 19791#(<= Main_x 4), 19792#(<= Main_x 5), 19793#(<= Main_x 6), 19794#(<= Main_x 7), 19795#(<= Main_x 8), 19796#(<= Main_x 9), 19797#(<= Main_x 10), 19798#(<= Main_x 11), 19799#(<= Main_x 12), 19800#(<= Main_x 13), 19801#(<= Main_x 14), 19802#(<= Main_x 15), 19803#(<= Main_x 16), 19804#(<= Main_x 17), 19805#(<= Main_x 18), 19806#(<= Main_x 19), 19807#(<= Main_x 20), 19808#(<= Main_x 21), 19809#(<= Main_x 22), 19810#(<= Main_x 23), 19811#(<= Main_x 24), 19812#(<= Main_x 25), 19813#(<= Main_x 26), 19814#(<= Main_x 27), 19815#(<= Main_x 28), 19816#(<= Main_x 29), 19817#(<= Main_x 30), 19818#(<= Main_x 31), 19819#(<= Main_x 32), 19820#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,443 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:56:18,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:56:18,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:56:18,444 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 36 states. [2018-07-23 13:56:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:18,563 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-07-23 13:56:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:56:18,563 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-23 13:56:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:18,564 INFO L225 Difference]: With dead ends: 108 [2018-07-23 13:56:18,564 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 13:56:18,564 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:56:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 13:56:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 13:56:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 13:56:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-07-23 13:56:18,602 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 70 [2018-07-23 13:56:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:18,602 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-07-23 13:56:18,602 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:56:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-07-23 13:56:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 13:56:18,603 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:18,603 INFO L357 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-07-23 13:56:18,603 INFO L414 AbstractCegarLoop]: === Iteration 99 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:18,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1961933165, now seen corresponding path program 96 times [2018-07-23 13:56:18,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:18,685 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:56:18,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:18,685 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:56:18,685 INFO L185 omatonBuilderFactory]: Interpolants [20179#true, 20180#false, 20181#(<= 0 Main_x), 20182#(<= 1 Main_x), 20183#(<= 2 Main_x), 20184#(<= 3 Main_x), 20185#(<= 4 Main_x), 20186#(<= 5 Main_x), 20187#(<= 6 Main_x), 20188#(<= 7 Main_x), 20189#(<= 8 Main_x), 20190#(<= 9 Main_x), 20191#(<= 10 Main_x), 20192#(<= 11 Main_x), 20193#(<= 12 Main_x), 20194#(<= 13 Main_x), 20195#(<= 14 Main_x), 20196#(<= 15 Main_x), 20197#(<= 16 Main_x), 20198#(<= 17 Main_x), 20199#(<= 18 Main_x), 20200#(<= 19 Main_x), 20201#(<= 20 Main_x), 20202#(<= 21 Main_x), 20203#(<= 22 Main_x), 20204#(<= 23 Main_x), 20205#(<= 24 Main_x), 20206#(<= 25 Main_x), 20207#(<= 26 Main_x), 20208#(<= 27 Main_x), 20209#(<= 28 Main_x), 20210#(<= 29 Main_x), 20211#(<= 30 Main_x), 20212#(<= 31 Main_x), 20213#(<= 32 Main_x), 20214#(<= 33 Main_x)] [2018-07-23 13:56:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,686 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:56:18,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:56:18,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:56:18,687 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-07-23 13:56:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:18,745 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-07-23 13:56:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:56:18,745 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-23 13:56:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:18,746 INFO L225 Difference]: With dead ends: 75 [2018-07-23 13:56:18,746 INFO L226 Difference]: Without dead ends: 72 [2018-07-23 13:56:18,747 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:56:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-23 13:56:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-23 13:56:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-23 13:56:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-07-23 13:56:18,789 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2018-07-23 13:56:18,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:18,789 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-07-23 13:56:18,789 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:56:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-07-23 13:56:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-23 13:56:18,790 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:18,790 INFO L357 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1] [2018-07-23 13:56:18,790 INFO L414 AbstractCegarLoop]: === Iteration 100 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash 690324449, now seen corresponding path program 97 times [2018-07-23 13:56:18,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:18,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:56:18,917 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:18,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:56:18,918 INFO L185 omatonBuilderFactory]: Interpolants [20544#(and (<= 33 Main_y) (<= Main_y 33)), 20509#true, 20510#false, 20511#(and (<= 0 Main_y) (<= Main_y 0)), 20512#(and (<= 1 Main_y) (<= Main_y 1)), 20513#(and (<= Main_y 2) (<= 2 Main_y)), 20514#(and (<= Main_y 3) (<= 3 Main_y)), 20515#(and (<= Main_y 4) (<= 4 Main_y)), 20516#(and (<= Main_y 5) (<= 5 Main_y)), 20517#(and (<= Main_y 6) (<= 6 Main_y)), 20518#(and (<= 7 Main_y) (<= Main_y 7)), 20519#(and (<= 8 Main_y) (<= Main_y 8)), 20520#(and (<= Main_y 9) (<= 9 Main_y)), 20521#(and (<= 10 Main_y) (<= Main_y 10)), 20522#(and (<= 11 Main_y) (<= Main_y 11)), 20523#(and (<= 12 Main_y) (<= Main_y 12)), 20524#(and (<= 13 Main_y) (<= Main_y 13)), 20525#(and (<= 14 Main_y) (<= Main_y 14)), 20526#(and (<= Main_y 15) (<= 15 Main_y)), 20527#(and (<= 16 Main_y) (<= Main_y 16)), 20528#(and (<= Main_y 17) (<= 17 Main_y)), 20529#(and (<= Main_y 18) (<= 18 Main_y)), 20530#(and (<= Main_y 19) (<= 19 Main_y)), 20531#(and (<= 20 Main_y) (<= Main_y 20)), 20532#(and (<= 21 Main_y) (<= Main_y 21)), 20533#(and (<= Main_y 22) (<= 22 Main_y)), 20534#(and (<= 23 Main_y) (<= Main_y 23)), 20535#(and (<= Main_y 24) (<= 24 Main_y)), 20536#(and (<= 25 Main_y) (<= Main_y 25)), 20537#(and (<= Main_y 26) (<= 26 Main_y)), 20538#(and (<= 27 Main_y) (<= Main_y 27)), 20539#(and (<= 28 Main_y) (<= Main_y 28)), 20540#(and (<= 29 Main_y) (<= Main_y 29)), 20541#(and (<= 30 Main_y) (<= Main_y 30)), 20542#(and (<= Main_y 31) (<= 31 Main_y)), 20543#(and (<= 32 Main_y) (<= Main_y 32))] [2018-07-23 13:56:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:18,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:56:18,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:56:18,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:56:18,919 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 36 states. [2018-07-23 13:56:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:19,210 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-07-23 13:56:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:56:19,210 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2018-07-23 13:56:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:19,212 INFO L225 Difference]: With dead ends: 110 [2018-07-23 13:56:19,212 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 13:56:19,213 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:56:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 13:56:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2018-07-23 13:56:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:56:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-07-23 13:56:19,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2018-07-23 13:56:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-07-23 13:56:19,262 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:56:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-07-23 13:56:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:56:19,262 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:19,263 INFO L357 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-07-23 13:56:19,263 INFO L414 AbstractCegarLoop]: === Iteration 101 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:19,263 INFO L82 PathProgramCache]: Analyzing trace with hash -74840083, now seen corresponding path program 98 times [2018-07-23 13:56:19,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:19,349 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:19,349 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:56:19,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:19,350 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:56:19,350 INFO L185 omatonBuilderFactory]: Interpolants [20928#(<= Main_x 13), 20929#(<= Main_x 14), 20930#(<= Main_x 15), 20931#(<= Main_x 16), 20932#(<= Main_x 17), 20933#(<= Main_x 18), 20934#(<= Main_x 19), 20935#(<= Main_x 20), 20936#(<= Main_x 21), 20937#(<= Main_x 22), 20938#(<= Main_x 23), 20939#(<= Main_x 24), 20940#(<= Main_x 25), 20941#(<= Main_x 26), 20942#(<= Main_x 27), 20943#(<= Main_x 28), 20944#(<= Main_x 29), 20945#(<= Main_x 30), 20946#(<= Main_x 31), 20947#(<= Main_x 32), 20948#(<= Main_x 33), 20949#(<= (+ Main_x 1) 0), 20913#true, 20914#false, 20915#(<= Main_x 0), 20916#(<= Main_x 1), 20917#(<= Main_x 2), 20918#(<= Main_x 3), 20919#(<= Main_x 4), 20920#(<= Main_x 5), 20921#(<= Main_x 6), 20922#(<= Main_x 7), 20923#(<= Main_x 8), 20924#(<= Main_x 9), 20925#(<= Main_x 10), 20926#(<= Main_x 11), 20927#(<= Main_x 12)] [2018-07-23 13:56:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:19,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:56:19,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:56:19,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:56:19,351 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 37 states. [2018-07-23 13:56:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:19,474 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-07-23 13:56:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:56:19,475 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-23 13:56:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:19,475 INFO L225 Difference]: With dead ends: 111 [2018-07-23 13:56:19,476 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 13:56:19,476 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:56:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 13:56:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 13:56:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 13:56:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-07-23 13:56:19,519 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 72 [2018-07-23 13:56:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:19,519 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-07-23 13:56:19,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:56:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-07-23 13:56:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 13:56:19,520 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:19,520 INFO L357 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-07-23 13:56:19,520 INFO L414 AbstractCegarLoop]: === Iteration 102 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash -90864889, now seen corresponding path program 99 times [2018-07-23 13:56:19,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:19,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:19,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:56:19,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:19,610 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:56:19,611 INFO L185 omatonBuilderFactory]: Interpolants [21318#true, 21319#false, 21320#(<= 0 Main_x), 21321#(<= 1 Main_x), 21322#(<= 2 Main_x), 21323#(<= 3 Main_x), 21324#(<= 4 Main_x), 21325#(<= 5 Main_x), 21326#(<= 6 Main_x), 21327#(<= 7 Main_x), 21328#(<= 8 Main_x), 21329#(<= 9 Main_x), 21330#(<= 10 Main_x), 21331#(<= 11 Main_x), 21332#(<= 12 Main_x), 21333#(<= 13 Main_x), 21334#(<= 14 Main_x), 21335#(<= 15 Main_x), 21336#(<= 16 Main_x), 21337#(<= 17 Main_x), 21338#(<= 18 Main_x), 21339#(<= 19 Main_x), 21340#(<= 20 Main_x), 21341#(<= 21 Main_x), 21342#(<= 22 Main_x), 21343#(<= 23 Main_x), 21344#(<= 24 Main_x), 21345#(<= 25 Main_x), 21346#(<= 26 Main_x), 21347#(<= 27 Main_x), 21348#(<= 28 Main_x), 21349#(<= 29 Main_x), 21350#(<= 30 Main_x), 21351#(<= 31 Main_x), 21352#(<= 32 Main_x), 21353#(<= 33 Main_x), 21354#(<= 34 Main_x)] [2018-07-23 13:56:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:19,611 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:56:19,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:56:19,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:56:19,612 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-07-23 13:56:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:19,674 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-07-23 13:56:19,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:56:19,674 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-23 13:56:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:19,675 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:56:19,675 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:56:19,676 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:56:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:56:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 13:56:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:56:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-07-23 13:56:19,720 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2018-07-23 13:56:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:19,721 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-07-23 13:56:19,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:56:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-07-23 13:56:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:56:19,722 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:19,722 INFO L357 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1] [2018-07-23 13:56:19,722 INFO L414 AbstractCegarLoop]: === Iteration 103 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1478094215, now seen corresponding path program 100 times [2018-07-23 13:56:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:19,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:19,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:56:19,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:19,859 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:56:19,859 INFO L185 omatonBuilderFactory]: Interpolants [21657#true, 21658#false, 21659#(and (<= 0 Main_y) (<= Main_y 0)), 21660#(and (<= 1 Main_y) (<= Main_y 1)), 21661#(and (<= Main_y 2) (<= 2 Main_y)), 21662#(and (<= Main_y 3) (<= 3 Main_y)), 21663#(and (<= Main_y 4) (<= 4 Main_y)), 21664#(and (<= Main_y 5) (<= 5 Main_y)), 21665#(and (<= Main_y 6) (<= 6 Main_y)), 21666#(and (<= 7 Main_y) (<= Main_y 7)), 21667#(and (<= 8 Main_y) (<= Main_y 8)), 21668#(and (<= Main_y 9) (<= 9 Main_y)), 21669#(and (<= 10 Main_y) (<= Main_y 10)), 21670#(and (<= 11 Main_y) (<= Main_y 11)), 21671#(and (<= 12 Main_y) (<= Main_y 12)), 21672#(and (<= 13 Main_y) (<= Main_y 13)), 21673#(and (<= 14 Main_y) (<= Main_y 14)), 21674#(and (<= Main_y 15) (<= 15 Main_y)), 21675#(and (<= 16 Main_y) (<= Main_y 16)), 21676#(and (<= Main_y 17) (<= 17 Main_y)), 21677#(and (<= Main_y 18) (<= 18 Main_y)), 21678#(and (<= Main_y 19) (<= 19 Main_y)), 21679#(and (<= 20 Main_y) (<= Main_y 20)), 21680#(and (<= 21 Main_y) (<= Main_y 21)), 21681#(and (<= Main_y 22) (<= 22 Main_y)), 21682#(and (<= 23 Main_y) (<= Main_y 23)), 21683#(and (<= Main_y 24) (<= 24 Main_y)), 21684#(and (<= 25 Main_y) (<= Main_y 25)), 21685#(and (<= Main_y 26) (<= 26 Main_y)), 21686#(and (<= 27 Main_y) (<= Main_y 27)), 21687#(and (<= 28 Main_y) (<= Main_y 28)), 21688#(and (<= 29 Main_y) (<= Main_y 29)), 21689#(and (<= 30 Main_y) (<= Main_y 30)), 21690#(and (<= Main_y 31) (<= 31 Main_y)), 21691#(and (<= 32 Main_y) (<= Main_y 32)), 21692#(and (<= 33 Main_y) (<= Main_y 33)), 21693#(and (<= Main_y 34) (<= 34 Main_y))] [2018-07-23 13:56:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:19,859 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:56:19,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:56:19,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:56:19,860 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 37 states. [2018-07-23 13:56:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:20,215 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-07-23 13:56:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:56:20,216 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2018-07-23 13:56:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:20,217 INFO L225 Difference]: With dead ends: 113 [2018-07-23 13:56:20,217 INFO L226 Difference]: Without dead ends: 110 [2018-07-23 13:56:20,217 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:56:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-23 13:56:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2018-07-23 13:56:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:56:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-07-23 13:56:20,268 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2018-07-23 13:56:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:20,268 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-07-23 13:56:20,268 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:56:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-07-23 13:56:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:56:20,269 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:20,269 INFO L357 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-07-23 13:56:20,269 INFO L414 AbstractCegarLoop]: === Iteration 104 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:20,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1423781113, now seen corresponding path program 101 times [2018-07-23 13:56:20,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:20,385 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:20,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:56:20,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:20,386 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:56:20,387 INFO L185 omatonBuilderFactory]: Interpolants [22080#(<= Main_x 6), 22081#(<= Main_x 7), 22082#(<= Main_x 8), 22083#(<= Main_x 9), 22084#(<= Main_x 10), 22085#(<= Main_x 11), 22086#(<= Main_x 12), 22087#(<= Main_x 13), 22088#(<= Main_x 14), 22089#(<= Main_x 15), 22090#(<= Main_x 16), 22091#(<= Main_x 17), 22092#(<= Main_x 18), 22093#(<= Main_x 19), 22094#(<= Main_x 20), 22095#(<= Main_x 21), 22096#(<= Main_x 22), 22097#(<= Main_x 23), 22098#(<= Main_x 24), 22099#(<= Main_x 25), 22100#(<= Main_x 26), 22101#(<= Main_x 27), 22102#(<= Main_x 28), 22103#(<= Main_x 29), 22104#(<= Main_x 30), 22105#(<= Main_x 31), 22106#(<= Main_x 32), 22107#(<= Main_x 33), 22108#(<= Main_x 34), 22109#(<= (+ Main_x 1) 0), 22072#true, 22073#false, 22074#(<= Main_x 0), 22075#(<= Main_x 1), 22076#(<= Main_x 2), 22077#(<= Main_x 3), 22078#(<= Main_x 4), 22079#(<= Main_x 5)] [2018-07-23 13:56:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:20,387 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:56:20,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:56:20,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:56:20,388 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 38 states. [2018-07-23 13:56:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:20,586 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-07-23 13:56:20,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:56:20,587 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-23 13:56:20,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:20,587 INFO L225 Difference]: With dead ends: 114 [2018-07-23 13:56:20,588 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:56:20,588 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:56:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:56:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 13:56:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 13:56:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-07-23 13:56:20,648 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 74 [2018-07-23 13:56:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:20,648 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-07-23 13:56:20,648 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:56:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-07-23 13:56:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 13:56:20,649 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:20,649 INFO L357 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-07-23 13:56:20,650 INFO L414 AbstractCegarLoop]: === Iteration 105 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1920550099, now seen corresponding path program 102 times [2018-07-23 13:56:20,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:20,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:20,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:56:20,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:20,790 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:56:20,790 INFO L185 omatonBuilderFactory]: Interpolants [22488#true, 22489#false, 22490#(<= 0 Main_x), 22491#(<= 1 Main_x), 22492#(<= 2 Main_x), 22493#(<= 3 Main_x), 22494#(<= 4 Main_x), 22495#(<= 5 Main_x), 22496#(<= 6 Main_x), 22497#(<= 7 Main_x), 22498#(<= 8 Main_x), 22499#(<= 9 Main_x), 22500#(<= 10 Main_x), 22501#(<= 11 Main_x), 22502#(<= 12 Main_x), 22503#(<= 13 Main_x), 22504#(<= 14 Main_x), 22505#(<= 15 Main_x), 22506#(<= 16 Main_x), 22507#(<= 17 Main_x), 22508#(<= 18 Main_x), 22509#(<= 19 Main_x), 22510#(<= 20 Main_x), 22511#(<= 21 Main_x), 22512#(<= 22 Main_x), 22513#(<= 23 Main_x), 22514#(<= 24 Main_x), 22515#(<= 25 Main_x), 22516#(<= 26 Main_x), 22517#(<= 27 Main_x), 22518#(<= 28 Main_x), 22519#(<= 29 Main_x), 22520#(<= 30 Main_x), 22521#(<= 31 Main_x), 22522#(<= 32 Main_x), 22523#(<= 33 Main_x), 22524#(<= 34 Main_x), 22525#(<= 35 Main_x)] [2018-07-23 13:56:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:20,791 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:56:20,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:56:20,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:56:20,793 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-07-23 13:56:20,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:20,873 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-07-23 13:56:20,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:56:20,874 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-23 13:56:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:20,874 INFO L225 Difference]: With dead ends: 79 [2018-07-23 13:56:20,875 INFO L226 Difference]: Without dead ends: 76 [2018-07-23 13:56:20,875 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:56:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-23 13:56:20,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-23 13:56:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:56:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-07-23 13:56:20,938 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-07-23 13:56:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:20,938 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-07-23 13:56:20,938 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:56:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-07-23 13:56:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-23 13:56:20,939 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:20,939 INFO L357 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1] [2018-07-23 13:56:20,939 INFO L414 AbstractCegarLoop]: === Iteration 106 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash 592427553, now seen corresponding path program 103 times [2018-07-23 13:56:20,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:21,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:21,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:56:21,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:21,167 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:56:21,168 INFO L185 omatonBuilderFactory]: Interpolants [22848#(and (<= 10 Main_y) (<= Main_y 10)), 22849#(and (<= 11 Main_y) (<= Main_y 11)), 22850#(and (<= 12 Main_y) (<= Main_y 12)), 22851#(and (<= 13 Main_y) (<= Main_y 13)), 22852#(and (<= 14 Main_y) (<= Main_y 14)), 22853#(and (<= Main_y 15) (<= 15 Main_y)), 22854#(and (<= 16 Main_y) (<= Main_y 16)), 22855#(and (<= Main_y 17) (<= 17 Main_y)), 22856#(and (<= Main_y 18) (<= 18 Main_y)), 22857#(and (<= Main_y 19) (<= 19 Main_y)), 22858#(and (<= 20 Main_y) (<= Main_y 20)), 22859#(and (<= 21 Main_y) (<= Main_y 21)), 22860#(and (<= Main_y 22) (<= 22 Main_y)), 22861#(and (<= 23 Main_y) (<= Main_y 23)), 22862#(and (<= Main_y 24) (<= 24 Main_y)), 22863#(and (<= 25 Main_y) (<= Main_y 25)), 22864#(and (<= Main_y 26) (<= 26 Main_y)), 22865#(and (<= 27 Main_y) (<= Main_y 27)), 22866#(and (<= 28 Main_y) (<= Main_y 28)), 22867#(and (<= 29 Main_y) (<= Main_y 29)), 22868#(and (<= 30 Main_y) (<= Main_y 30)), 22869#(and (<= Main_y 31) (<= 31 Main_y)), 22870#(and (<= 32 Main_y) (<= Main_y 32)), 22871#(and (<= 33 Main_y) (<= Main_y 33)), 22872#(and (<= Main_y 34) (<= 34 Main_y)), 22873#(and (<= 35 Main_y) (<= Main_y 35)), 22836#true, 22837#false, 22838#(and (<= 0 Main_y) (<= Main_y 0)), 22839#(and (<= 1 Main_y) (<= Main_y 1)), 22840#(and (<= Main_y 2) (<= 2 Main_y)), 22841#(and (<= Main_y 3) (<= 3 Main_y)), 22842#(and (<= Main_y 4) (<= 4 Main_y)), 22843#(and (<= Main_y 5) (<= 5 Main_y)), 22844#(and (<= Main_y 6) (<= 6 Main_y)), 22845#(and (<= 7 Main_y) (<= Main_y 7)), 22846#(and (<= 8 Main_y) (<= Main_y 8)), 22847#(and (<= Main_y 9) (<= 9 Main_y))] [2018-07-23 13:56:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:21,168 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:56:21,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:56:21,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:56:21,169 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 38 states. [2018-07-23 13:56:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:21,580 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-07-23 13:56:21,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:56:21,580 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 75 [2018-07-23 13:56:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:21,586 INFO L225 Difference]: With dead ends: 116 [2018-07-23 13:56:21,586 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 13:56:21,586 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:56:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 13:56:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2018-07-23 13:56:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:56:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-07-23 13:56:21,652 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2018-07-23 13:56:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:21,652 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-07-23 13:56:21,652 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:56:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-07-23 13:56:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:56:21,653 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:21,653 INFO L357 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-07-23 13:56:21,653 INFO L414 AbstractCegarLoop]: === Iteration 107 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1185323437, now seen corresponding path program 104 times [2018-07-23 13:56:21,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:21,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:21,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:56:21,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:21,788 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:56:21,789 INFO L185 omatonBuilderFactory]: Interpolants [23296#(<= Main_x 32), 23297#(<= Main_x 33), 23298#(<= Main_x 34), 23299#(<= Main_x 35), 23300#(<= (+ Main_x 1) 0), 23262#true, 23263#false, 23264#(<= Main_x 0), 23265#(<= Main_x 1), 23266#(<= Main_x 2), 23267#(<= Main_x 3), 23268#(<= Main_x 4), 23269#(<= Main_x 5), 23270#(<= Main_x 6), 23271#(<= Main_x 7), 23272#(<= Main_x 8), 23273#(<= Main_x 9), 23274#(<= Main_x 10), 23275#(<= Main_x 11), 23276#(<= Main_x 12), 23277#(<= Main_x 13), 23278#(<= Main_x 14), 23279#(<= Main_x 15), 23280#(<= Main_x 16), 23281#(<= Main_x 17), 23282#(<= Main_x 18), 23283#(<= Main_x 19), 23284#(<= Main_x 20), 23285#(<= Main_x 21), 23286#(<= Main_x 22), 23287#(<= Main_x 23), 23288#(<= Main_x 24), 23289#(<= Main_x 25), 23290#(<= Main_x 26), 23291#(<= Main_x 27), 23292#(<= Main_x 28), 23293#(<= Main_x 29), 23294#(<= Main_x 30), 23295#(<= Main_x 31)] [2018-07-23 13:56:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:21,790 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:56:21,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:56:21,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:56:21,793 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 39 states. [2018-07-23 13:56:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:21,982 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-07-23 13:56:21,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:56:21,983 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-23 13:56:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:21,983 INFO L225 Difference]: With dead ends: 117 [2018-07-23 13:56:21,984 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:56:21,984 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:56:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:56:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 13:56:22,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 13:56:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-07-23 13:56:22,037 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 76 [2018-07-23 13:56:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:22,037 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-07-23 13:56:22,038 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:56:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-07-23 13:56:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 13:56:22,039 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:22,039 INFO L357 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-07-23 13:56:22,039 INFO L414 AbstractCegarLoop]: === Iteration 108 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:22,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1329613241, now seen corresponding path program 105 times [2018-07-23 13:56:22,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:22,160 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:22,160 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:56:22,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:22,160 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:56:22,161 INFO L185 omatonBuilderFactory]: Interpolants [23689#true, 23690#false, 23691#(<= 0 Main_x), 23692#(<= 1 Main_x), 23693#(<= 2 Main_x), 23694#(<= 3 Main_x), 23695#(<= 4 Main_x), 23696#(<= 5 Main_x), 23697#(<= 6 Main_x), 23698#(<= 7 Main_x), 23699#(<= 8 Main_x), 23700#(<= 9 Main_x), 23701#(<= 10 Main_x), 23702#(<= 11 Main_x), 23703#(<= 12 Main_x), 23704#(<= 13 Main_x), 23705#(<= 14 Main_x), 23706#(<= 15 Main_x), 23707#(<= 16 Main_x), 23708#(<= 17 Main_x), 23709#(<= 18 Main_x), 23710#(<= 19 Main_x), 23711#(<= 20 Main_x), 23712#(<= 21 Main_x), 23713#(<= 22 Main_x), 23714#(<= 23 Main_x), 23715#(<= 24 Main_x), 23716#(<= 25 Main_x), 23717#(<= 26 Main_x), 23718#(<= 27 Main_x), 23719#(<= 28 Main_x), 23720#(<= 29 Main_x), 23721#(<= 30 Main_x), 23722#(<= 31 Main_x), 23723#(<= 32 Main_x), 23724#(<= 33 Main_x), 23725#(<= 34 Main_x), 23726#(<= 35 Main_x), 23727#(<= 36 Main_x)] [2018-07-23 13:56:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:22,161 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:56:22,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:56:22,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:56:22,162 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-07-23 13:56:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:22,227 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-07-23 13:56:22,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:56:22,227 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-23 13:56:22,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:22,228 INFO L225 Difference]: With dead ends: 81 [2018-07-23 13:56:22,228 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 13:56:22,229 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:56:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 13:56:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-23 13:56:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-23 13:56:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-07-23 13:56:22,280 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2018-07-23 13:56:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:22,280 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-07-23 13:56:22,280 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:56:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-07-23 13:56:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-23 13:56:22,281 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:22,281 INFO L357 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1] [2018-07-23 13:56:22,281 INFO L414 AbstractCegarLoop]: === Iteration 109 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1731600967, now seen corresponding path program 106 times [2018-07-23 13:56:22,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:22,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:22,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:56:22,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:22,442 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:56:22,442 INFO L185 omatonBuilderFactory]: Interpolants [24064#(and (<= 16 Main_y) (<= Main_y 16)), 24065#(and (<= Main_y 17) (<= 17 Main_y)), 24066#(and (<= Main_y 18) (<= 18 Main_y)), 24067#(and (<= Main_y 19) (<= 19 Main_y)), 24068#(and (<= 20 Main_y) (<= Main_y 20)), 24069#(and (<= 21 Main_y) (<= Main_y 21)), 24070#(and (<= Main_y 22) (<= 22 Main_y)), 24071#(and (<= 23 Main_y) (<= Main_y 23)), 24072#(and (<= Main_y 24) (<= 24 Main_y)), 24073#(and (<= 25 Main_y) (<= Main_y 25)), 24074#(and (<= Main_y 26) (<= 26 Main_y)), 24075#(and (<= 27 Main_y) (<= Main_y 27)), 24076#(and (<= 28 Main_y) (<= Main_y 28)), 24077#(and (<= 29 Main_y) (<= Main_y 29)), 24078#(and (<= 30 Main_y) (<= Main_y 30)), 24079#(and (<= Main_y 31) (<= 31 Main_y)), 24080#(and (<= 32 Main_y) (<= Main_y 32)), 24081#(and (<= 33 Main_y) (<= Main_y 33)), 24082#(and (<= Main_y 34) (<= 34 Main_y)), 24083#(and (<= 35 Main_y) (<= Main_y 35)), 24084#(and (<= 36 Main_y) (<= Main_y 36)), 24046#true, 24047#false, 24048#(and (<= 0 Main_y) (<= Main_y 0)), 24049#(and (<= 1 Main_y) (<= Main_y 1)), 24050#(and (<= Main_y 2) (<= 2 Main_y)), 24051#(and (<= Main_y 3) (<= 3 Main_y)), 24052#(and (<= Main_y 4) (<= 4 Main_y)), 24053#(and (<= Main_y 5) (<= 5 Main_y)), 24054#(and (<= Main_y 6) (<= 6 Main_y)), 24055#(and (<= 7 Main_y) (<= Main_y 7)), 24056#(and (<= 8 Main_y) (<= Main_y 8)), 24057#(and (<= Main_y 9) (<= 9 Main_y)), 24058#(and (<= 10 Main_y) (<= Main_y 10)), 24059#(and (<= 11 Main_y) (<= Main_y 11)), 24060#(and (<= 12 Main_y) (<= Main_y 12)), 24061#(and (<= 13 Main_y) (<= Main_y 13)), 24062#(and (<= 14 Main_y) (<= Main_y 14)), 24063#(and (<= Main_y 15) (<= 15 Main_y))] [2018-07-23 13:56:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:22,442 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:56:22,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:56:22,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:56:22,443 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 39 states. [2018-07-23 13:56:22,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:22,793 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-07-23 13:56:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:56:22,794 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2018-07-23 13:56:22,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:22,794 INFO L225 Difference]: With dead ends: 119 [2018-07-23 13:56:22,794 INFO L226 Difference]: Without dead ends: 116 [2018-07-23 13:56:22,795 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:56:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-23 13:56:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2018-07-23 13:56:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:56:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-07-23 13:56:22,848 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2018-07-23 13:56:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-07-23 13:56:22,849 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:56:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-07-23 13:56:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:56:22,849 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:22,850 INFO L357 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-07-23 13:56:22,850 INFO L414 AbstractCegarLoop]: === Iteration 110 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash 2139960903, now seen corresponding path program 107 times [2018-07-23 13:56:22,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:22,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:22,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:56:22,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:22,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:56:22,948 INFO L185 omatonBuilderFactory]: Interpolants [24512#(<= Main_x 27), 24513#(<= Main_x 28), 24514#(<= Main_x 29), 24515#(<= Main_x 30), 24516#(<= Main_x 31), 24517#(<= Main_x 32), 24518#(<= Main_x 33), 24519#(<= Main_x 34), 24520#(<= Main_x 35), 24521#(<= Main_x 36), 24522#(<= (+ Main_x 1) 0), 24483#true, 24484#false, 24485#(<= Main_x 0), 24486#(<= Main_x 1), 24487#(<= Main_x 2), 24488#(<= Main_x 3), 24489#(<= Main_x 4), 24490#(<= Main_x 5), 24491#(<= Main_x 6), 24492#(<= Main_x 7), 24493#(<= Main_x 8), 24494#(<= Main_x 9), 24495#(<= Main_x 10), 24496#(<= Main_x 11), 24497#(<= Main_x 12), 24498#(<= Main_x 13), 24499#(<= Main_x 14), 24500#(<= Main_x 15), 24501#(<= Main_x 16), 24502#(<= Main_x 17), 24503#(<= Main_x 18), 24504#(<= Main_x 19), 24505#(<= Main_x 20), 24506#(<= Main_x 21), 24507#(<= Main_x 22), 24508#(<= Main_x 23), 24509#(<= Main_x 24), 24510#(<= Main_x 25), 24511#(<= Main_x 26)] [2018-07-23 13:56:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:22,949 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:56:22,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:56:22,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:56:22,950 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 40 states. [2018-07-23 13:56:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:23,075 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-07-23 13:56:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:56:23,075 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-23 13:56:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:23,075 INFO L225 Difference]: With dead ends: 120 [2018-07-23 13:56:23,075 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 13:56:23,076 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:56:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 13:56:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 13:56:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 13:56:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-07-23 13:56:23,114 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 78 [2018-07-23 13:56:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-07-23 13:56:23,114 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:56:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-07-23 13:56:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 13:56:23,115 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:23,115 INFO L357 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-07-23 13:56:23,116 INFO L414 AbstractCegarLoop]: === Iteration 111 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1486335213, now seen corresponding path program 108 times [2018-07-23 13:56:23,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:23,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:23,212 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:23,212 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:56:23,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:23,212 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:56:23,212 INFO L185 omatonBuilderFactory]: Interpolants [24960#(<= 37 Main_x), 24921#true, 24922#false, 24923#(<= 0 Main_x), 24924#(<= 1 Main_x), 24925#(<= 2 Main_x), 24926#(<= 3 Main_x), 24927#(<= 4 Main_x), 24928#(<= 5 Main_x), 24929#(<= 6 Main_x), 24930#(<= 7 Main_x), 24931#(<= 8 Main_x), 24932#(<= 9 Main_x), 24933#(<= 10 Main_x), 24934#(<= 11 Main_x), 24935#(<= 12 Main_x), 24936#(<= 13 Main_x), 24937#(<= 14 Main_x), 24938#(<= 15 Main_x), 24939#(<= 16 Main_x), 24940#(<= 17 Main_x), 24941#(<= 18 Main_x), 24942#(<= 19 Main_x), 24943#(<= 20 Main_x), 24944#(<= 21 Main_x), 24945#(<= 22 Main_x), 24946#(<= 23 Main_x), 24947#(<= 24 Main_x), 24948#(<= 25 Main_x), 24949#(<= 26 Main_x), 24950#(<= 27 Main_x), 24951#(<= 28 Main_x), 24952#(<= 29 Main_x), 24953#(<= 30 Main_x), 24954#(<= 31 Main_x), 24955#(<= 32 Main_x), 24956#(<= 33 Main_x), 24957#(<= 34 Main_x), 24958#(<= 35 Main_x), 24959#(<= 36 Main_x)] [2018-07-23 13:56:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:23,213 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:56:23,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:56:23,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:56:23,214 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-07-23 13:56:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:23,281 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-07-23 13:56:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:56:23,282 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-23 13:56:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:23,282 INFO L225 Difference]: With dead ends: 83 [2018-07-23 13:56:23,282 INFO L226 Difference]: Without dead ends: 80 [2018-07-23 13:56:23,283 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:56:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-23 13:56:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-23 13:56:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-23 13:56:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-07-23 13:56:23,330 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2018-07-23 13:56:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:23,330 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-07-23 13:56:23,331 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:56:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-07-23 13:56:23,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-23 13:56:23,331 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:23,331 INFO L357 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1] [2018-07-23 13:56:23,332 INFO L414 AbstractCegarLoop]: === Iteration 112 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:23,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1168310175, now seen corresponding path program 109 times [2018-07-23 13:56:23,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:23,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:23,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:56:23,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:23,498 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:56:23,498 INFO L185 omatonBuilderFactory]: Interpolants [25287#true, 25288#false, 25289#(and (<= 0 Main_y) (<= Main_y 0)), 25290#(and (<= 1 Main_y) (<= Main_y 1)), 25291#(and (<= Main_y 2) (<= 2 Main_y)), 25292#(and (<= Main_y 3) (<= 3 Main_y)), 25293#(and (<= Main_y 4) (<= 4 Main_y)), 25294#(and (<= Main_y 5) (<= 5 Main_y)), 25295#(and (<= Main_y 6) (<= 6 Main_y)), 25296#(and (<= 7 Main_y) (<= Main_y 7)), 25297#(and (<= 8 Main_y) (<= Main_y 8)), 25298#(and (<= Main_y 9) (<= 9 Main_y)), 25299#(and (<= 10 Main_y) (<= Main_y 10)), 25300#(and (<= 11 Main_y) (<= Main_y 11)), 25301#(and (<= 12 Main_y) (<= Main_y 12)), 25302#(and (<= 13 Main_y) (<= Main_y 13)), 25303#(and (<= 14 Main_y) (<= Main_y 14)), 25304#(and (<= Main_y 15) (<= 15 Main_y)), 25305#(and (<= 16 Main_y) (<= Main_y 16)), 25306#(and (<= Main_y 17) (<= 17 Main_y)), 25307#(and (<= Main_y 18) (<= 18 Main_y)), 25308#(and (<= Main_y 19) (<= 19 Main_y)), 25309#(and (<= 20 Main_y) (<= Main_y 20)), 25310#(and (<= 21 Main_y) (<= Main_y 21)), 25311#(and (<= Main_y 22) (<= 22 Main_y)), 25312#(and (<= 23 Main_y) (<= Main_y 23)), 25313#(and (<= Main_y 24) (<= 24 Main_y)), 25314#(and (<= 25 Main_y) (<= Main_y 25)), 25315#(and (<= Main_y 26) (<= 26 Main_y)), 25316#(and (<= 27 Main_y) (<= Main_y 27)), 25317#(and (<= 28 Main_y) (<= Main_y 28)), 25318#(and (<= 29 Main_y) (<= Main_y 29)), 25319#(and (<= 30 Main_y) (<= Main_y 30)), 25320#(and (<= Main_y 31) (<= 31 Main_y)), 25321#(and (<= 32 Main_y) (<= Main_y 32)), 25322#(and (<= 33 Main_y) (<= Main_y 33)), 25323#(and (<= Main_y 34) (<= 34 Main_y)), 25324#(and (<= 35 Main_y) (<= Main_y 35)), 25325#(and (<= 36 Main_y) (<= Main_y 36)), 25326#(and (<= Main_y 37) (<= 37 Main_y))] [2018-07-23 13:56:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:23,499 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:56:23,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:56:23,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:56:23,499 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 40 states. [2018-07-23 13:56:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:23,878 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-07-23 13:56:23,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:56:23,878 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 79 [2018-07-23 13:56:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:23,879 INFO L225 Difference]: With dead ends: 122 [2018-07-23 13:56:23,879 INFO L226 Difference]: Without dead ends: 119 [2018-07-23 13:56:23,879 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:56:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-23 13:56:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2018-07-23 13:56:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 13:56:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-07-23 13:56:23,946 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2018-07-23 13:56:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:23,946 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-07-23 13:56:23,946 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:56:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-07-23 13:56:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:56:23,947 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:23,947 INFO L357 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-07-23 13:56:23,947 INFO L414 AbstractCegarLoop]: === Iteration 113 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1857938579, now seen corresponding path program 110 times [2018-07-23 13:56:23,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:24,084 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:24,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:56:24,085 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:24,085 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:56:24,085 INFO L185 omatonBuilderFactory]: Interpolants [25735#true, 25736#false, 25737#(<= Main_x 0), 25738#(<= Main_x 1), 25739#(<= Main_x 2), 25740#(<= Main_x 3), 25741#(<= Main_x 4), 25742#(<= Main_x 5), 25743#(<= Main_x 6), 25744#(<= Main_x 7), 25745#(<= Main_x 8), 25746#(<= Main_x 9), 25747#(<= Main_x 10), 25748#(<= Main_x 11), 25749#(<= Main_x 12), 25750#(<= Main_x 13), 25751#(<= Main_x 14), 25752#(<= Main_x 15), 25753#(<= Main_x 16), 25754#(<= Main_x 17), 25755#(<= Main_x 18), 25756#(<= Main_x 19), 25757#(<= Main_x 20), 25758#(<= Main_x 21), 25759#(<= Main_x 22), 25760#(<= Main_x 23), 25761#(<= Main_x 24), 25762#(<= Main_x 25), 25763#(<= Main_x 26), 25764#(<= Main_x 27), 25765#(<= Main_x 28), 25766#(<= Main_x 29), 25767#(<= Main_x 30), 25768#(<= Main_x 31), 25769#(<= Main_x 32), 25770#(<= Main_x 33), 25771#(<= Main_x 34), 25772#(<= Main_x 35), 25773#(<= Main_x 36), 25774#(<= Main_x 37), 25775#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:24,086 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:56:24,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:56:24,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:56:24,087 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 41 states. [2018-07-23 13:56:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:24,260 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-07-23 13:56:24,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:56:24,260 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-23 13:56:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:24,261 INFO L225 Difference]: With dead ends: 123 [2018-07-23 13:56:24,261 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 13:56:24,261 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:56:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 13:56:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 13:56:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 13:56:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-07-23 13:56:24,309 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 80 [2018-07-23 13:56:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:24,309 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-07-23 13:56:24,309 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:56:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-07-23 13:56:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 13:56:24,310 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:24,312 INFO L357 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-07-23 13:56:24,312 INFO L414 AbstractCegarLoop]: === Iteration 114 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash -645498489, now seen corresponding path program 111 times [2018-07-23 13:56:24,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:24,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:24,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:56:24,410 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:24,411 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:56:24,411 INFO L185 omatonBuilderFactory]: Interpolants [26184#true, 26185#false, 26186#(<= 0 Main_x), 26187#(<= 1 Main_x), 26188#(<= 2 Main_x), 26189#(<= 3 Main_x), 26190#(<= 4 Main_x), 26191#(<= 5 Main_x), 26192#(<= 6 Main_x), 26193#(<= 7 Main_x), 26194#(<= 8 Main_x), 26195#(<= 9 Main_x), 26196#(<= 10 Main_x), 26197#(<= 11 Main_x), 26198#(<= 12 Main_x), 26199#(<= 13 Main_x), 26200#(<= 14 Main_x), 26201#(<= 15 Main_x), 26202#(<= 16 Main_x), 26203#(<= 17 Main_x), 26204#(<= 18 Main_x), 26205#(<= 19 Main_x), 26206#(<= 20 Main_x), 26207#(<= 21 Main_x), 26208#(<= 22 Main_x), 26209#(<= 23 Main_x), 26210#(<= 24 Main_x), 26211#(<= 25 Main_x), 26212#(<= 26 Main_x), 26213#(<= 27 Main_x), 26214#(<= 28 Main_x), 26215#(<= 29 Main_x), 26216#(<= 30 Main_x), 26217#(<= 31 Main_x), 26218#(<= 32 Main_x), 26219#(<= 33 Main_x), 26220#(<= 34 Main_x), 26221#(<= 35 Main_x), 26222#(<= 36 Main_x), 26223#(<= 37 Main_x), 26224#(<= 38 Main_x)] [2018-07-23 13:56:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:24,411 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:56:24,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:56:24,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:56:24,412 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-07-23 13:56:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:24,481 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-07-23 13:56:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:56:24,482 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-23 13:56:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:24,482 INFO L225 Difference]: With dead ends: 85 [2018-07-23 13:56:24,482 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 13:56:24,483 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:56:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 13:56:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-23 13:56:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-23 13:56:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-07-23 13:56:24,530 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-07-23 13:56:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:24,531 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-07-23 13:56:24,531 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:56:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-07-23 13:56:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-23 13:56:24,531 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:24,532 INFO L357 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1] [2018-07-23 13:56:24,532 INFO L414 AbstractCegarLoop]: === Iteration 115 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1464321799, now seen corresponding path program 112 times [2018-07-23 13:56:24,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:24,690 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:24,690 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:56:24,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:24,691 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:56:24,691 INFO L185 omatonBuilderFactory]: Interpolants [26560#false, 26561#(and (<= 0 Main_y) (<= Main_y 0)), 26562#(and (<= 1 Main_y) (<= Main_y 1)), 26563#(and (<= Main_y 2) (<= 2 Main_y)), 26564#(and (<= Main_y 3) (<= 3 Main_y)), 26565#(and (<= Main_y 4) (<= 4 Main_y)), 26566#(and (<= Main_y 5) (<= 5 Main_y)), 26567#(and (<= Main_y 6) (<= 6 Main_y)), 26568#(and (<= 7 Main_y) (<= Main_y 7)), 26569#(and (<= 8 Main_y) (<= Main_y 8)), 26570#(and (<= Main_y 9) (<= 9 Main_y)), 26571#(and (<= 10 Main_y) (<= Main_y 10)), 26572#(and (<= 11 Main_y) (<= Main_y 11)), 26573#(and (<= 12 Main_y) (<= Main_y 12)), 26574#(and (<= 13 Main_y) (<= Main_y 13)), 26575#(and (<= 14 Main_y) (<= Main_y 14)), 26576#(and (<= Main_y 15) (<= 15 Main_y)), 26577#(and (<= 16 Main_y) (<= Main_y 16)), 26578#(and (<= Main_y 17) (<= 17 Main_y)), 26579#(and (<= Main_y 18) (<= 18 Main_y)), 26580#(and (<= Main_y 19) (<= 19 Main_y)), 26581#(and (<= 20 Main_y) (<= Main_y 20)), 26582#(and (<= 21 Main_y) (<= Main_y 21)), 26583#(and (<= Main_y 22) (<= 22 Main_y)), 26584#(and (<= 23 Main_y) (<= Main_y 23)), 26585#(and (<= Main_y 24) (<= 24 Main_y)), 26586#(and (<= 25 Main_y) (<= Main_y 25)), 26587#(and (<= Main_y 26) (<= 26 Main_y)), 26588#(and (<= 27 Main_y) (<= Main_y 27)), 26589#(and (<= 28 Main_y) (<= Main_y 28)), 26590#(and (<= 29 Main_y) (<= Main_y 29)), 26591#(and (<= 30 Main_y) (<= Main_y 30)), 26592#(and (<= Main_y 31) (<= 31 Main_y)), 26593#(and (<= 32 Main_y) (<= Main_y 32)), 26594#(and (<= 33 Main_y) (<= Main_y 33)), 26595#(and (<= Main_y 34) (<= 34 Main_y)), 26596#(and (<= 35 Main_y) (<= Main_y 35)), 26597#(and (<= 36 Main_y) (<= Main_y 36)), 26598#(and (<= Main_y 37) (<= 37 Main_y)), 26599#(and (<= Main_y 38) (<= 38 Main_y)), 26559#true] [2018-07-23 13:56:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:24,692 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:56:24,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:56:24,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:56:24,692 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 41 states. [2018-07-23 13:56:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:25,068 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-07-23 13:56:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:56:25,068 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 81 [2018-07-23 13:56:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:25,069 INFO L225 Difference]: With dead ends: 125 [2018-07-23 13:56:25,069 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 13:56:25,070 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:56:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 13:56:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2018-07-23 13:56:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:56:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-07-23 13:56:25,136 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2018-07-23 13:56:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:25,137 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-07-23 13:56:25,137 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:56:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-07-23 13:56:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:56:25,138 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:25,138 INFO L357 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-07-23 13:56:25,138 INFO L414 AbstractCegarLoop]: === Iteration 116 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1850726009, now seen corresponding path program 113 times [2018-07-23 13:56:25,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:25,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:25,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:56:25,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:25,246 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:56:25,246 INFO L185 omatonBuilderFactory]: Interpolants [27018#true, 27019#false, 27020#(<= Main_x 0), 27021#(<= Main_x 1), 27022#(<= Main_x 2), 27023#(<= Main_x 3), 27024#(<= Main_x 4), 27025#(<= Main_x 5), 27026#(<= Main_x 6), 27027#(<= Main_x 7), 27028#(<= Main_x 8), 27029#(<= Main_x 9), 27030#(<= Main_x 10), 27031#(<= Main_x 11), 27032#(<= Main_x 12), 27033#(<= Main_x 13), 27034#(<= Main_x 14), 27035#(<= Main_x 15), 27036#(<= Main_x 16), 27037#(<= Main_x 17), 27038#(<= Main_x 18), 27039#(<= Main_x 19), 27040#(<= Main_x 20), 27041#(<= Main_x 21), 27042#(<= Main_x 22), 27043#(<= Main_x 23), 27044#(<= Main_x 24), 27045#(<= Main_x 25), 27046#(<= Main_x 26), 27047#(<= Main_x 27), 27048#(<= Main_x 28), 27049#(<= Main_x 29), 27050#(<= Main_x 30), 27051#(<= Main_x 31), 27052#(<= Main_x 32), 27053#(<= Main_x 33), 27054#(<= Main_x 34), 27055#(<= Main_x 35), 27056#(<= Main_x 36), 27057#(<= Main_x 37), 27058#(<= Main_x 38), 27059#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:25,247 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:56:25,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:56:25,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:56:25,248 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 42 states. [2018-07-23 13:56:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:25,444 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-07-23 13:56:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:56:25,444 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-23 13:56:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:25,445 INFO L225 Difference]: With dead ends: 126 [2018-07-23 13:56:25,445 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 13:56:25,446 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:56:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 13:56:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 13:56:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 13:56:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-07-23 13:56:25,507 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 82 [2018-07-23 13:56:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:25,507 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-07-23 13:56:25,508 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:56:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-07-23 13:56:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 13:56:25,508 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:25,509 INFO L357 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-07-23 13:56:25,509 INFO L414 AbstractCegarLoop]: === Iteration 117 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:25,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1375178413, now seen corresponding path program 114 times [2018-07-23 13:56:25,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:25,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:25,627 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:56:25,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:25,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:56:25,627 INFO L185 omatonBuilderFactory]: Interpolants [27478#true, 27479#false, 27480#(<= 0 Main_x), 27481#(<= 1 Main_x), 27482#(<= 2 Main_x), 27483#(<= 3 Main_x), 27484#(<= 4 Main_x), 27485#(<= 5 Main_x), 27486#(<= 6 Main_x), 27487#(<= 7 Main_x), 27488#(<= 8 Main_x), 27489#(<= 9 Main_x), 27490#(<= 10 Main_x), 27491#(<= 11 Main_x), 27492#(<= 12 Main_x), 27493#(<= 13 Main_x), 27494#(<= 14 Main_x), 27495#(<= 15 Main_x), 27496#(<= 16 Main_x), 27497#(<= 17 Main_x), 27498#(<= 18 Main_x), 27499#(<= 19 Main_x), 27500#(<= 20 Main_x), 27501#(<= 21 Main_x), 27502#(<= 22 Main_x), 27503#(<= 23 Main_x), 27504#(<= 24 Main_x), 27505#(<= 25 Main_x), 27506#(<= 26 Main_x), 27507#(<= 27 Main_x), 27508#(<= 28 Main_x), 27509#(<= 29 Main_x), 27510#(<= 30 Main_x), 27511#(<= 31 Main_x), 27512#(<= 32 Main_x), 27513#(<= 33 Main_x), 27514#(<= 34 Main_x), 27515#(<= 35 Main_x), 27516#(<= 36 Main_x), 27517#(<= 37 Main_x), 27518#(<= 38 Main_x), 27519#(<= 39 Main_x)] [2018-07-23 13:56:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:25,628 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:56:25,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:56:25,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:56:25,629 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-07-23 13:56:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:25,711 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-07-23 13:56:25,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:56:25,711 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-23 13:56:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:25,712 INFO L225 Difference]: With dead ends: 87 [2018-07-23 13:56:25,712 INFO L226 Difference]: Without dead ends: 84 [2018-07-23 13:56:25,713 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:56:25,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-23 13:56:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-23 13:56:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:56:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-07-23 13:56:25,776 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2018-07-23 13:56:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:25,777 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-07-23 13:56:25,777 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:56:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-07-23 13:56:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:56:25,778 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:25,778 INFO L357 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1] [2018-07-23 13:56:25,778 INFO L414 AbstractCegarLoop]: === Iteration 118 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash -319203679, now seen corresponding path program 115 times [2018-07-23 13:56:25,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:25,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:25,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:56:25,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:25,966 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:56:25,966 INFO L185 omatonBuilderFactory]: Interpolants [27862#true, 27863#false, 27864#(and (<= 0 Main_y) (<= Main_y 0)), 27865#(and (<= 1 Main_y) (<= Main_y 1)), 27866#(and (<= Main_y 2) (<= 2 Main_y)), 27867#(and (<= Main_y 3) (<= 3 Main_y)), 27868#(and (<= Main_y 4) (<= 4 Main_y)), 27869#(and (<= Main_y 5) (<= 5 Main_y)), 27870#(and (<= Main_y 6) (<= 6 Main_y)), 27871#(and (<= 7 Main_y) (<= Main_y 7)), 27872#(and (<= 8 Main_y) (<= Main_y 8)), 27873#(and (<= Main_y 9) (<= 9 Main_y)), 27874#(and (<= 10 Main_y) (<= Main_y 10)), 27875#(and (<= 11 Main_y) (<= Main_y 11)), 27876#(and (<= 12 Main_y) (<= Main_y 12)), 27877#(and (<= 13 Main_y) (<= Main_y 13)), 27878#(and (<= 14 Main_y) (<= Main_y 14)), 27879#(and (<= Main_y 15) (<= 15 Main_y)), 27880#(and (<= 16 Main_y) (<= Main_y 16)), 27881#(and (<= Main_y 17) (<= 17 Main_y)), 27882#(and (<= Main_y 18) (<= 18 Main_y)), 27883#(and (<= Main_y 19) (<= 19 Main_y)), 27884#(and (<= 20 Main_y) (<= Main_y 20)), 27885#(and (<= 21 Main_y) (<= Main_y 21)), 27886#(and (<= Main_y 22) (<= 22 Main_y)), 27887#(and (<= 23 Main_y) (<= Main_y 23)), 27888#(and (<= Main_y 24) (<= 24 Main_y)), 27889#(and (<= 25 Main_y) (<= Main_y 25)), 27890#(and (<= Main_y 26) (<= 26 Main_y)), 27891#(and (<= 27 Main_y) (<= Main_y 27)), 27892#(and (<= 28 Main_y) (<= Main_y 28)), 27893#(and (<= 29 Main_y) (<= Main_y 29)), 27894#(and (<= 30 Main_y) (<= Main_y 30)), 27895#(and (<= Main_y 31) (<= 31 Main_y)), 27896#(and (<= 32 Main_y) (<= Main_y 32)), 27897#(and (<= 33 Main_y) (<= Main_y 33)), 27898#(and (<= Main_y 34) (<= 34 Main_y)), 27899#(and (<= 35 Main_y) (<= Main_y 35)), 27900#(and (<= 36 Main_y) (<= Main_y 36)), 27901#(and (<= Main_y 37) (<= 37 Main_y)), 27902#(and (<= Main_y 38) (<= 38 Main_y)), 27903#(and (<= 39 Main_y) (<= Main_y 39))] [2018-07-23 13:56:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:25,967 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:56:25,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:56:25,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:56:25,968 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states. [2018-07-23 13:56:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:26,352 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-07-23 13:56:26,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:56:26,352 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2018-07-23 13:56:26,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:26,352 INFO L225 Difference]: With dead ends: 128 [2018-07-23 13:56:26,353 INFO L226 Difference]: Without dead ends: 125 [2018-07-23 13:56:26,353 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:56:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-23 13:56:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2018-07-23 13:56:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:56:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-07-23 13:56:26,413 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2018-07-23 13:56:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:26,414 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-07-23 13:56:26,414 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:56:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-07-23 13:56:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:56:26,414 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:26,415 INFO L357 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-07-23 13:56:26,415 INFO L414 AbstractCegarLoop]: === Iteration 119 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1305440979, now seen corresponding path program 116 times [2018-07-23 13:56:26,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:26,515 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:26,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:56:26,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:26,515 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:56:26,516 INFO L185 omatonBuilderFactory]: Interpolants [28352#(<= Main_x 18), 28353#(<= Main_x 19), 28354#(<= Main_x 20), 28355#(<= Main_x 21), 28356#(<= Main_x 22), 28357#(<= Main_x 23), 28358#(<= Main_x 24), 28359#(<= Main_x 25), 28360#(<= Main_x 26), 28361#(<= Main_x 27), 28362#(<= Main_x 28), 28363#(<= Main_x 29), 28364#(<= Main_x 30), 28365#(<= Main_x 31), 28366#(<= Main_x 32), 28367#(<= Main_x 33), 28368#(<= Main_x 34), 28369#(<= Main_x 35), 28370#(<= Main_x 36), 28371#(<= Main_x 37), 28372#(<= Main_x 38), 28373#(<= Main_x 39), 28374#(<= (+ Main_x 1) 0), 28332#true, 28333#false, 28334#(<= Main_x 0), 28335#(<= Main_x 1), 28336#(<= Main_x 2), 28337#(<= Main_x 3), 28338#(<= Main_x 4), 28339#(<= Main_x 5), 28340#(<= Main_x 6), 28341#(<= Main_x 7), 28342#(<= Main_x 8), 28343#(<= Main_x 9), 28344#(<= Main_x 10), 28345#(<= Main_x 11), 28346#(<= Main_x 12), 28347#(<= Main_x 13), 28348#(<= Main_x 14), 28349#(<= Main_x 15), 28350#(<= Main_x 16), 28351#(<= Main_x 17)] [2018-07-23 13:56:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:26,516 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:56:26,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:56:26,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:56:26,517 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 43 states. [2018-07-23 13:56:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:26,675 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-07-23 13:56:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:56:26,676 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-23 13:56:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:26,676 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:56:26,677 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 13:56:26,677 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:56:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 13:56:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 13:56:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 13:56:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-07-23 13:56:26,743 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 84 [2018-07-23 13:56:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:26,744 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-07-23 13:56:26,744 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:56:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-07-23 13:56:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 13:56:26,745 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:26,745 INFO L357 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-07-23 13:56:26,745 INFO L414 AbstractCegarLoop]: === Iteration 120 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:26,745 INFO L82 PathProgramCache]: Analyzing trace with hash -86651705, now seen corresponding path program 117 times [2018-07-23 13:56:26,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:26,853 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:26,853 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:56:26,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:26,853 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:56:26,854 INFO L185 omatonBuilderFactory]: Interpolants [28803#true, 28804#false, 28805#(<= 0 Main_x), 28806#(<= 1 Main_x), 28807#(<= 2 Main_x), 28808#(<= 3 Main_x), 28809#(<= 4 Main_x), 28810#(<= 5 Main_x), 28811#(<= 6 Main_x), 28812#(<= 7 Main_x), 28813#(<= 8 Main_x), 28814#(<= 9 Main_x), 28815#(<= 10 Main_x), 28816#(<= 11 Main_x), 28817#(<= 12 Main_x), 28818#(<= 13 Main_x), 28819#(<= 14 Main_x), 28820#(<= 15 Main_x), 28821#(<= 16 Main_x), 28822#(<= 17 Main_x), 28823#(<= 18 Main_x), 28824#(<= 19 Main_x), 28825#(<= 20 Main_x), 28826#(<= 21 Main_x), 28827#(<= 22 Main_x), 28828#(<= 23 Main_x), 28829#(<= 24 Main_x), 28830#(<= 25 Main_x), 28831#(<= 26 Main_x), 28832#(<= 27 Main_x), 28833#(<= 28 Main_x), 28834#(<= 29 Main_x), 28835#(<= 30 Main_x), 28836#(<= 31 Main_x), 28837#(<= 32 Main_x), 28838#(<= 33 Main_x), 28839#(<= 34 Main_x), 28840#(<= 35 Main_x), 28841#(<= 36 Main_x), 28842#(<= 37 Main_x), 28843#(<= 38 Main_x), 28844#(<= 39 Main_x), 28845#(<= 40 Main_x)] [2018-07-23 13:56:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:26,854 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:56:26,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:56:26,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:56:26,855 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-07-23 13:56:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:26,931 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-07-23 13:56:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:56:26,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-23 13:56:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:26,932 INFO L225 Difference]: With dead ends: 89 [2018-07-23 13:56:26,932 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 13:56:26,932 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:56:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 13:56:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-23 13:56:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:56:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-07-23 13:56:26,986 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2018-07-23 13:56:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:26,986 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-07-23 13:56:26,986 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:56:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-07-23 13:56:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-23 13:56:26,987 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:26,987 INFO L357 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1] [2018-07-23 13:56:26,987 INFO L414 AbstractCegarLoop]: === Iteration 121 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1608702919, now seen corresponding path program 118 times [2018-07-23 13:56:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:27,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:27,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:56:27,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:27,185 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:56:27,186 INFO L185 omatonBuilderFactory]: Interpolants [29196#true, 29197#false, 29198#(and (<= 0 Main_y) (<= Main_y 0)), 29199#(and (<= 1 Main_y) (<= Main_y 1)), 29200#(and (<= Main_y 2) (<= 2 Main_y)), 29201#(and (<= Main_y 3) (<= 3 Main_y)), 29202#(and (<= Main_y 4) (<= 4 Main_y)), 29203#(and (<= Main_y 5) (<= 5 Main_y)), 29204#(and (<= Main_y 6) (<= 6 Main_y)), 29205#(and (<= 7 Main_y) (<= Main_y 7)), 29206#(and (<= 8 Main_y) (<= Main_y 8)), 29207#(and (<= Main_y 9) (<= 9 Main_y)), 29208#(and (<= 10 Main_y) (<= Main_y 10)), 29209#(and (<= 11 Main_y) (<= Main_y 11)), 29210#(and (<= 12 Main_y) (<= Main_y 12)), 29211#(and (<= 13 Main_y) (<= Main_y 13)), 29212#(and (<= 14 Main_y) (<= Main_y 14)), 29213#(and (<= Main_y 15) (<= 15 Main_y)), 29214#(and (<= 16 Main_y) (<= Main_y 16)), 29215#(and (<= Main_y 17) (<= 17 Main_y)), 29216#(and (<= Main_y 18) (<= 18 Main_y)), 29217#(and (<= Main_y 19) (<= 19 Main_y)), 29218#(and (<= 20 Main_y) (<= Main_y 20)), 29219#(and (<= 21 Main_y) (<= Main_y 21)), 29220#(and (<= Main_y 22) (<= 22 Main_y)), 29221#(and (<= 23 Main_y) (<= Main_y 23)), 29222#(and (<= Main_y 24) (<= 24 Main_y)), 29223#(and (<= 25 Main_y) (<= Main_y 25)), 29224#(and (<= Main_y 26) (<= 26 Main_y)), 29225#(and (<= 27 Main_y) (<= Main_y 27)), 29226#(and (<= 28 Main_y) (<= Main_y 28)), 29227#(and (<= 29 Main_y) (<= Main_y 29)), 29228#(and (<= 30 Main_y) (<= Main_y 30)), 29229#(and (<= Main_y 31) (<= 31 Main_y)), 29230#(and (<= 32 Main_y) (<= Main_y 32)), 29231#(and (<= 33 Main_y) (<= Main_y 33)), 29232#(and (<= Main_y 34) (<= 34 Main_y)), 29233#(and (<= 35 Main_y) (<= Main_y 35)), 29234#(and (<= 36 Main_y) (<= Main_y 36)), 29235#(and (<= Main_y 37) (<= 37 Main_y)), 29236#(and (<= Main_y 38) (<= 38 Main_y)), 29237#(and (<= 39 Main_y) (<= Main_y 39)), 29238#(and (<= 40 Main_y) (<= Main_y 40))] [2018-07-23 13:56:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:27,187 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:56:27,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:56:27,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:56:27,187 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 43 states. [2018-07-23 13:56:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:27,585 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-07-23 13:56:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:56:27,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2018-07-23 13:56:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:27,586 INFO L225 Difference]: With dead ends: 131 [2018-07-23 13:56:27,586 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 13:56:27,587 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:56:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 13:56:27,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2018-07-23 13:56:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 13:56:27,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-07-23 13:56:27,640 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2018-07-23 13:56:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:27,641 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-07-23 13:56:27,641 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:56:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-07-23 13:56:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:56:27,642 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:27,642 INFO L357 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-07-23 13:56:27,642 INFO L414 AbstractCegarLoop]: === Iteration 122 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:27,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1669878585, now seen corresponding path program 119 times [2018-07-23 13:56:27,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:27,774 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:27,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:56:27,774 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:27,774 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:56:27,775 INFO L185 omatonBuilderFactory]: Interpolants [29696#(<= Main_x 17), 29697#(<= Main_x 18), 29698#(<= Main_x 19), 29699#(<= Main_x 20), 29700#(<= Main_x 21), 29701#(<= Main_x 22), 29702#(<= Main_x 23), 29703#(<= Main_x 24), 29704#(<= Main_x 25), 29705#(<= Main_x 26), 29706#(<= Main_x 27), 29707#(<= Main_x 28), 29708#(<= Main_x 29), 29709#(<= Main_x 30), 29710#(<= Main_x 31), 29711#(<= Main_x 32), 29712#(<= Main_x 33), 29713#(<= Main_x 34), 29714#(<= Main_x 35), 29715#(<= Main_x 36), 29716#(<= Main_x 37), 29717#(<= Main_x 38), 29718#(<= Main_x 39), 29719#(<= Main_x 40), 29720#(<= (+ Main_x 1) 0), 29677#true, 29678#false, 29679#(<= Main_x 0), 29680#(<= Main_x 1), 29681#(<= Main_x 2), 29682#(<= Main_x 3), 29683#(<= Main_x 4), 29684#(<= Main_x 5), 29685#(<= Main_x 6), 29686#(<= Main_x 7), 29687#(<= Main_x 8), 29688#(<= Main_x 9), 29689#(<= Main_x 10), 29690#(<= Main_x 11), 29691#(<= Main_x 12), 29692#(<= Main_x 13), 29693#(<= Main_x 14), 29694#(<= Main_x 15), 29695#(<= Main_x 16)] [2018-07-23 13:56:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:27,775 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:56:27,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:56:27,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:56:27,776 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 44 states. [2018-07-23 13:56:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:27,943 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-07-23 13:56:27,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:56:27,943 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-23 13:56:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:27,944 INFO L225 Difference]: With dead ends: 132 [2018-07-23 13:56:27,944 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:56:27,944 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:56:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:56:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 13:56:28,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 13:56:28,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-07-23 13:56:28,008 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 86 [2018-07-23 13:56:28,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:28,008 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-07-23 13:56:28,008 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:56:28,008 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-07-23 13:56:28,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 13:56:28,009 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:28,009 INFO L357 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-07-23 13:56:28,009 INFO L414 AbstractCegarLoop]: === Iteration 123 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1752850541, now seen corresponding path program 120 times [2018-07-23 13:56:28,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:28,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:28,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:56:28,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:28,123 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:56:28,123 INFO L185 omatonBuilderFactory]: Interpolants [30159#true, 30160#false, 30161#(<= 0 Main_x), 30162#(<= 1 Main_x), 30163#(<= 2 Main_x), 30164#(<= 3 Main_x), 30165#(<= 4 Main_x), 30166#(<= 5 Main_x), 30167#(<= 6 Main_x), 30168#(<= 7 Main_x), 30169#(<= 8 Main_x), 30170#(<= 9 Main_x), 30171#(<= 10 Main_x), 30172#(<= 11 Main_x), 30173#(<= 12 Main_x), 30174#(<= 13 Main_x), 30175#(<= 14 Main_x), 30176#(<= 15 Main_x), 30177#(<= 16 Main_x), 30178#(<= 17 Main_x), 30179#(<= 18 Main_x), 30180#(<= 19 Main_x), 30181#(<= 20 Main_x), 30182#(<= 21 Main_x), 30183#(<= 22 Main_x), 30184#(<= 23 Main_x), 30185#(<= 24 Main_x), 30186#(<= 25 Main_x), 30187#(<= 26 Main_x), 30188#(<= 27 Main_x), 30189#(<= 28 Main_x), 30190#(<= 29 Main_x), 30191#(<= 30 Main_x), 30192#(<= 31 Main_x), 30193#(<= 32 Main_x), 30194#(<= 33 Main_x), 30195#(<= 34 Main_x), 30196#(<= 35 Main_x), 30197#(<= 36 Main_x), 30198#(<= 37 Main_x), 30199#(<= 38 Main_x), 30200#(<= 39 Main_x), 30201#(<= 40 Main_x), 30202#(<= 41 Main_x)] [2018-07-23 13:56:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:28,124 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:56:28,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:56:28,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:56:28,125 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-07-23 13:56:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:28,210 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-07-23 13:56:28,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:56:28,210 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-23 13:56:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:28,211 INFO L225 Difference]: With dead ends: 91 [2018-07-23 13:56:28,211 INFO L226 Difference]: Without dead ends: 88 [2018-07-23 13:56:28,211 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:56:28,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-23 13:56:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-23 13:56:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-23 13:56:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-07-23 13:56:28,270 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-07-23 13:56:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:28,271 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-07-23 13:56:28,271 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:56:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-07-23 13:56:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-23 13:56:28,271 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:28,272 INFO L357 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1] [2018-07-23 13:56:28,272 INFO L414 AbstractCegarLoop]: === Iteration 124 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1496269599, now seen corresponding path program 121 times [2018-07-23 13:56:28,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:28,451 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:28,451 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:56:28,451 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:28,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:56:28,452 INFO L185 omatonBuilderFactory]: Interpolants [30592#(and (<= 29 Main_y) (<= Main_y 29)), 30593#(and (<= 30 Main_y) (<= Main_y 30)), 30594#(and (<= Main_y 31) (<= 31 Main_y)), 30595#(and (<= 32 Main_y) (<= Main_y 32)), 30596#(and (<= 33 Main_y) (<= Main_y 33)), 30597#(and (<= Main_y 34) (<= 34 Main_y)), 30598#(and (<= 35 Main_y) (<= Main_y 35)), 30599#(and (<= 36 Main_y) (<= Main_y 36)), 30600#(and (<= Main_y 37) (<= 37 Main_y)), 30601#(and (<= Main_y 38) (<= 38 Main_y)), 30602#(and (<= 39 Main_y) (<= Main_y 39)), 30603#(and (<= 40 Main_y) (<= Main_y 40)), 30604#(and (<= Main_y 41) (<= 41 Main_y)), 30561#true, 30562#false, 30563#(and (<= 0 Main_y) (<= Main_y 0)), 30564#(and (<= 1 Main_y) (<= Main_y 1)), 30565#(and (<= Main_y 2) (<= 2 Main_y)), 30566#(and (<= Main_y 3) (<= 3 Main_y)), 30567#(and (<= Main_y 4) (<= 4 Main_y)), 30568#(and (<= Main_y 5) (<= 5 Main_y)), 30569#(and (<= Main_y 6) (<= 6 Main_y)), 30570#(and (<= 7 Main_y) (<= Main_y 7)), 30571#(and (<= 8 Main_y) (<= Main_y 8)), 30572#(and (<= Main_y 9) (<= 9 Main_y)), 30573#(and (<= 10 Main_y) (<= Main_y 10)), 30574#(and (<= 11 Main_y) (<= Main_y 11)), 30575#(and (<= 12 Main_y) (<= Main_y 12)), 30576#(and (<= 13 Main_y) (<= Main_y 13)), 30577#(and (<= 14 Main_y) (<= Main_y 14)), 30578#(and (<= Main_y 15) (<= 15 Main_y)), 30579#(and (<= 16 Main_y) (<= Main_y 16)), 30580#(and (<= Main_y 17) (<= 17 Main_y)), 30581#(and (<= Main_y 18) (<= 18 Main_y)), 30582#(and (<= Main_y 19) (<= 19 Main_y)), 30583#(and (<= 20 Main_y) (<= Main_y 20)), 30584#(and (<= 21 Main_y) (<= Main_y 21)), 30585#(and (<= Main_y 22) (<= 22 Main_y)), 30586#(and (<= 23 Main_y) (<= Main_y 23)), 30587#(and (<= Main_y 24) (<= 24 Main_y)), 30588#(and (<= 25 Main_y) (<= Main_y 25)), 30589#(and (<= Main_y 26) (<= 26 Main_y)), 30590#(and (<= 27 Main_y) (<= Main_y 27)), 30591#(and (<= 28 Main_y) (<= Main_y 28))] [2018-07-23 13:56:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:28,452 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:56:28,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:56:28,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:56:28,453 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 44 states. [2018-07-23 13:56:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:28,770 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-07-23 13:56:28,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:56:28,770 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 87 [2018-07-23 13:56:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:28,771 INFO L225 Difference]: With dead ends: 134 [2018-07-23 13:56:28,771 INFO L226 Difference]: Without dead ends: 131 [2018-07-23 13:56:28,771 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:56:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-23 13:56:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2018-07-23 13:56:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 13:56:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-07-23 13:56:28,820 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2018-07-23 13:56:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:28,820 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-07-23 13:56:28,820 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:56:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-07-23 13:56:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:56:28,821 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:28,821 INFO L357 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-07-23 13:56:28,821 INFO L414 AbstractCegarLoop]: === Iteration 125 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 860221165, now seen corresponding path program 122 times [2018-07-23 13:56:28,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:28,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:28,921 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:56:28,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:28,922 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:56:28,922 INFO L185 omatonBuilderFactory]: Interpolants [31053#true, 31054#false, 31055#(<= Main_x 0), 31056#(<= Main_x 1), 31057#(<= Main_x 2), 31058#(<= Main_x 3), 31059#(<= Main_x 4), 31060#(<= Main_x 5), 31061#(<= Main_x 6), 31062#(<= Main_x 7), 31063#(<= Main_x 8), 31064#(<= Main_x 9), 31065#(<= Main_x 10), 31066#(<= Main_x 11), 31067#(<= Main_x 12), 31068#(<= Main_x 13), 31069#(<= Main_x 14), 31070#(<= Main_x 15), 31071#(<= Main_x 16), 31072#(<= Main_x 17), 31073#(<= Main_x 18), 31074#(<= Main_x 19), 31075#(<= Main_x 20), 31076#(<= Main_x 21), 31077#(<= Main_x 22), 31078#(<= Main_x 23), 31079#(<= Main_x 24), 31080#(<= Main_x 25), 31081#(<= Main_x 26), 31082#(<= Main_x 27), 31083#(<= Main_x 28), 31084#(<= Main_x 29), 31085#(<= Main_x 30), 31086#(<= Main_x 31), 31087#(<= Main_x 32), 31088#(<= Main_x 33), 31089#(<= Main_x 34), 31090#(<= Main_x 35), 31091#(<= Main_x 36), 31092#(<= Main_x 37), 31093#(<= Main_x 38), 31094#(<= Main_x 39), 31095#(<= Main_x 40), 31096#(<= Main_x 41), 31097#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:28,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:56:28,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:56:28,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:56:28,924 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 45 states. [2018-07-23 13:56:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:29,090 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-07-23 13:56:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:56:29,090 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-23 13:56:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:29,090 INFO L225 Difference]: With dead ends: 135 [2018-07-23 13:56:29,090 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 13:56:29,091 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:56:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 13:56:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 13:56:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 13:56:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-07-23 13:56:29,132 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 88 [2018-07-23 13:56:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:29,133 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-07-23 13:56:29,133 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:56:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-07-23 13:56:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 13:56:29,133 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:29,133 INFO L357 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-07-23 13:56:29,134 INFO L414 AbstractCegarLoop]: === Iteration 126 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:29,134 INFO L82 PathProgramCache]: Analyzing trace with hash -409358329, now seen corresponding path program 123 times [2018-07-23 13:56:29,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:29,237 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:29,238 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:56:29,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:29,238 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:56:29,238 INFO L185 omatonBuilderFactory]: Interpolants [31552#(<= 4 Main_x), 31553#(<= 5 Main_x), 31554#(<= 6 Main_x), 31555#(<= 7 Main_x), 31556#(<= 8 Main_x), 31557#(<= 9 Main_x), 31558#(<= 10 Main_x), 31559#(<= 11 Main_x), 31560#(<= 12 Main_x), 31561#(<= 13 Main_x), 31562#(<= 14 Main_x), 31563#(<= 15 Main_x), 31564#(<= 16 Main_x), 31565#(<= 17 Main_x), 31566#(<= 18 Main_x), 31567#(<= 19 Main_x), 31568#(<= 20 Main_x), 31569#(<= 21 Main_x), 31570#(<= 22 Main_x), 31571#(<= 23 Main_x), 31572#(<= 24 Main_x), 31573#(<= 25 Main_x), 31574#(<= 26 Main_x), 31575#(<= 27 Main_x), 31576#(<= 28 Main_x), 31577#(<= 29 Main_x), 31578#(<= 30 Main_x), 31579#(<= 31 Main_x), 31580#(<= 32 Main_x), 31581#(<= 33 Main_x), 31582#(<= 34 Main_x), 31583#(<= 35 Main_x), 31584#(<= 36 Main_x), 31585#(<= 37 Main_x), 31586#(<= 38 Main_x), 31587#(<= 39 Main_x), 31588#(<= 40 Main_x), 31589#(<= 41 Main_x), 31590#(<= 42 Main_x), 31546#true, 31547#false, 31548#(<= 0 Main_x), 31549#(<= 1 Main_x), 31550#(<= 2 Main_x), 31551#(<= 3 Main_x)] [2018-07-23 13:56:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:29,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:56:29,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:56:29,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:56:29,240 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-07-23 13:56:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:29,314 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-07-23 13:56:29,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:56:29,314 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-23 13:56:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:29,315 INFO L225 Difference]: With dead ends: 93 [2018-07-23 13:56:29,315 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 13:56:29,315 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:56:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 13:56:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-23 13:56:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-23 13:56:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-07-23 13:56:29,366 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2018-07-23 13:56:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:29,367 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-07-23 13:56:29,367 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:56:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-07-23 13:56:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-23 13:56:29,368 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:29,368 INFO L357 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1] [2018-07-23 13:56:29,368 INFO L414 AbstractCegarLoop]: === Iteration 127 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash 194732167, now seen corresponding path program 124 times [2018-07-23 13:56:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:29,550 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:29,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:56:29,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:29,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:56:29,551 INFO L185 omatonBuilderFactory]: Interpolants [32000#(and (<= Main_y 41) (<= 41 Main_y)), 32001#(and (<= 42 Main_y) (<= Main_y 42)), 31957#true, 31958#false, 31959#(and (<= 0 Main_y) (<= Main_y 0)), 31960#(and (<= 1 Main_y) (<= Main_y 1)), 31961#(and (<= Main_y 2) (<= 2 Main_y)), 31962#(and (<= Main_y 3) (<= 3 Main_y)), 31963#(and (<= Main_y 4) (<= 4 Main_y)), 31964#(and (<= Main_y 5) (<= 5 Main_y)), 31965#(and (<= Main_y 6) (<= 6 Main_y)), 31966#(and (<= 7 Main_y) (<= Main_y 7)), 31967#(and (<= 8 Main_y) (<= Main_y 8)), 31968#(and (<= Main_y 9) (<= 9 Main_y)), 31969#(and (<= 10 Main_y) (<= Main_y 10)), 31970#(and (<= 11 Main_y) (<= Main_y 11)), 31971#(and (<= 12 Main_y) (<= Main_y 12)), 31972#(and (<= 13 Main_y) (<= Main_y 13)), 31973#(and (<= 14 Main_y) (<= Main_y 14)), 31974#(and (<= Main_y 15) (<= 15 Main_y)), 31975#(and (<= 16 Main_y) (<= Main_y 16)), 31976#(and (<= Main_y 17) (<= 17 Main_y)), 31977#(and (<= Main_y 18) (<= 18 Main_y)), 31978#(and (<= Main_y 19) (<= 19 Main_y)), 31979#(and (<= 20 Main_y) (<= Main_y 20)), 31980#(and (<= 21 Main_y) (<= Main_y 21)), 31981#(and (<= Main_y 22) (<= 22 Main_y)), 31982#(and (<= 23 Main_y) (<= Main_y 23)), 31983#(and (<= Main_y 24) (<= 24 Main_y)), 31984#(and (<= 25 Main_y) (<= Main_y 25)), 31985#(and (<= Main_y 26) (<= 26 Main_y)), 31986#(and (<= 27 Main_y) (<= Main_y 27)), 31987#(and (<= 28 Main_y) (<= Main_y 28)), 31988#(and (<= 29 Main_y) (<= Main_y 29)), 31989#(and (<= 30 Main_y) (<= Main_y 30)), 31990#(and (<= Main_y 31) (<= 31 Main_y)), 31991#(and (<= 32 Main_y) (<= Main_y 32)), 31992#(and (<= 33 Main_y) (<= Main_y 33)), 31993#(and (<= Main_y 34) (<= 34 Main_y)), 31994#(and (<= 35 Main_y) (<= Main_y 35)), 31995#(and (<= 36 Main_y) (<= Main_y 36)), 31996#(and (<= Main_y 37) (<= 37 Main_y)), 31997#(and (<= Main_y 38) (<= 38 Main_y)), 31998#(and (<= 39 Main_y) (<= Main_y 39)), 31999#(and (<= 40 Main_y) (<= Main_y 40))] [2018-07-23 13:56:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:29,552 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:56:29,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:56:29,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:56:29,552 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 45 states. [2018-07-23 13:56:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:29,961 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-07-23 13:56:29,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:56:29,962 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2018-07-23 13:56:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:29,962 INFO L225 Difference]: With dead ends: 137 [2018-07-23 13:56:29,962 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 13:56:29,963 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:56:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 13:56:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2018-07-23 13:56:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:56:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-07-23 13:56:30,023 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2018-07-23 13:56:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:30,024 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-07-23 13:56:30,024 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:56:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-07-23 13:56:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:56:30,024 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:30,025 INFO L357 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-07-23 13:56:30,025 INFO L414 AbstractCegarLoop]: === Iteration 128 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:30,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1741668359, now seen corresponding path program 125 times [2018-07-23 13:56:30,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:30,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:30,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:56:30,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:30,144 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:56:30,144 INFO L185 omatonBuilderFactory]: Interpolants [32460#true, 32461#false, 32462#(<= Main_x 0), 32463#(<= Main_x 1), 32464#(<= Main_x 2), 32465#(<= Main_x 3), 32466#(<= Main_x 4), 32467#(<= Main_x 5), 32468#(<= Main_x 6), 32469#(<= Main_x 7), 32470#(<= Main_x 8), 32471#(<= Main_x 9), 32472#(<= Main_x 10), 32473#(<= Main_x 11), 32474#(<= Main_x 12), 32475#(<= Main_x 13), 32476#(<= Main_x 14), 32477#(<= Main_x 15), 32478#(<= Main_x 16), 32479#(<= Main_x 17), 32480#(<= Main_x 18), 32481#(<= Main_x 19), 32482#(<= Main_x 20), 32483#(<= Main_x 21), 32484#(<= Main_x 22), 32485#(<= Main_x 23), 32486#(<= Main_x 24), 32487#(<= Main_x 25), 32488#(<= Main_x 26), 32489#(<= Main_x 27), 32490#(<= Main_x 28), 32491#(<= Main_x 29), 32492#(<= Main_x 30), 32493#(<= Main_x 31), 32494#(<= Main_x 32), 32495#(<= Main_x 33), 32496#(<= Main_x 34), 32497#(<= Main_x 35), 32498#(<= Main_x 36), 32499#(<= Main_x 37), 32500#(<= Main_x 38), 32501#(<= Main_x 39), 32502#(<= Main_x 40), 32503#(<= Main_x 41), 32504#(<= Main_x 42), 32505#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:30,144 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:56:30,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:56:30,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:56:30,145 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 46 states. [2018-07-23 13:56:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:30,361 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-07-23 13:56:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:56:30,361 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-23 13:56:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:30,362 INFO L225 Difference]: With dead ends: 138 [2018-07-23 13:56:30,362 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 13:56:30,362 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:56:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 13:56:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 13:56:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 13:56:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-07-23 13:56:30,428 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 90 [2018-07-23 13:56:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:30,429 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-07-23 13:56:30,429 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:56:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-07-23 13:56:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 13:56:30,429 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:30,430 INFO L357 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-07-23 13:56:30,430 INFO L414 AbstractCegarLoop]: === Iteration 129 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1039409709, now seen corresponding path program 126 times [2018-07-23 13:56:30,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:30,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:30,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:56:30,555 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:30,555 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:56:30,555 INFO L185 omatonBuilderFactory]: Interpolants [32964#true, 32965#false, 32966#(<= 0 Main_x), 32967#(<= 1 Main_x), 32968#(<= 2 Main_x), 32969#(<= 3 Main_x), 32970#(<= 4 Main_x), 32971#(<= 5 Main_x), 32972#(<= 6 Main_x), 32973#(<= 7 Main_x), 32974#(<= 8 Main_x), 32975#(<= 9 Main_x), 32976#(<= 10 Main_x), 32977#(<= 11 Main_x), 32978#(<= 12 Main_x), 32979#(<= 13 Main_x), 32980#(<= 14 Main_x), 32981#(<= 15 Main_x), 32982#(<= 16 Main_x), 32983#(<= 17 Main_x), 32984#(<= 18 Main_x), 32985#(<= 19 Main_x), 32986#(<= 20 Main_x), 32987#(<= 21 Main_x), 32988#(<= 22 Main_x), 32989#(<= 23 Main_x), 32990#(<= 24 Main_x), 32991#(<= 25 Main_x), 32992#(<= 26 Main_x), 32993#(<= 27 Main_x), 32994#(<= 28 Main_x), 32995#(<= 29 Main_x), 32996#(<= 30 Main_x), 32997#(<= 31 Main_x), 32998#(<= 32 Main_x), 32999#(<= 33 Main_x), 33000#(<= 34 Main_x), 33001#(<= 35 Main_x), 33002#(<= 36 Main_x), 33003#(<= 37 Main_x), 33004#(<= 38 Main_x), 33005#(<= 39 Main_x), 33006#(<= 40 Main_x), 33007#(<= 41 Main_x), 33008#(<= 42 Main_x), 33009#(<= 43 Main_x)] [2018-07-23 13:56:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:30,556 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:56:30,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:56:30,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:56:30,557 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-07-23 13:56:30,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:30,638 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-07-23 13:56:30,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:56:30,638 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-23 13:56:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:30,639 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:56:30,639 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:56:30,639 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:56:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:56:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:56:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:56:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-07-23 13:56:30,699 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2018-07-23 13:56:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:30,700 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-07-23 13:56:30,700 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:56:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-07-23 13:56:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 13:56:30,700 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:30,701 INFO L357 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1] [2018-07-23 13:56:30,701 INFO L414 AbstractCegarLoop]: === Iteration 130 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2138098911, now seen corresponding path program 127 times [2018-07-23 13:56:30,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:30,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:30,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:56:30,916 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:30,917 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:56:30,917 INFO L185 omatonBuilderFactory]: Interpolants [33408#(and (<= Main_y 22) (<= 22 Main_y)), 33409#(and (<= 23 Main_y) (<= Main_y 23)), 33410#(and (<= Main_y 24) (<= 24 Main_y)), 33411#(and (<= 25 Main_y) (<= Main_y 25)), 33412#(and (<= Main_y 26) (<= 26 Main_y)), 33413#(and (<= 27 Main_y) (<= Main_y 27)), 33414#(and (<= 28 Main_y) (<= Main_y 28)), 33415#(and (<= 29 Main_y) (<= Main_y 29)), 33416#(and (<= 30 Main_y) (<= Main_y 30)), 33417#(and (<= Main_y 31) (<= 31 Main_y)), 33418#(and (<= 32 Main_y) (<= Main_y 32)), 33419#(and (<= 33 Main_y) (<= Main_y 33)), 33420#(and (<= Main_y 34) (<= 34 Main_y)), 33421#(and (<= 35 Main_y) (<= Main_y 35)), 33422#(and (<= 36 Main_y) (<= Main_y 36)), 33423#(and (<= Main_y 37) (<= 37 Main_y)), 33424#(and (<= Main_y 38) (<= 38 Main_y)), 33425#(and (<= 39 Main_y) (<= Main_y 39)), 33426#(and (<= 40 Main_y) (<= Main_y 40)), 33427#(and (<= Main_y 41) (<= 41 Main_y)), 33428#(and (<= 42 Main_y) (<= Main_y 42)), 33429#(and (<= 43 Main_y) (<= Main_y 43)), 33384#true, 33385#false, 33386#(and (<= 0 Main_y) (<= Main_y 0)), 33387#(and (<= 1 Main_y) (<= Main_y 1)), 33388#(and (<= Main_y 2) (<= 2 Main_y)), 33389#(and (<= Main_y 3) (<= 3 Main_y)), 33390#(and (<= Main_y 4) (<= 4 Main_y)), 33391#(and (<= Main_y 5) (<= 5 Main_y)), 33392#(and (<= Main_y 6) (<= 6 Main_y)), 33393#(and (<= 7 Main_y) (<= Main_y 7)), 33394#(and (<= 8 Main_y) (<= Main_y 8)), 33395#(and (<= Main_y 9) (<= 9 Main_y)), 33396#(and (<= 10 Main_y) (<= Main_y 10)), 33397#(and (<= 11 Main_y) (<= Main_y 11)), 33398#(and (<= 12 Main_y) (<= Main_y 12)), 33399#(and (<= 13 Main_y) (<= Main_y 13)), 33400#(and (<= 14 Main_y) (<= Main_y 14)), 33401#(and (<= Main_y 15) (<= 15 Main_y)), 33402#(and (<= 16 Main_y) (<= Main_y 16)), 33403#(and (<= Main_y 17) (<= 17 Main_y)), 33404#(and (<= Main_y 18) (<= 18 Main_y)), 33405#(and (<= Main_y 19) (<= 19 Main_y)), 33406#(and (<= 20 Main_y) (<= Main_y 20)), 33407#(and (<= 21 Main_y) (<= Main_y 21))] [2018-07-23 13:56:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:30,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:56:30,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:56:30,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:56:30,918 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 46 states. [2018-07-23 13:56:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:31,248 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-07-23 13:56:31,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:56:31,248 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-07-23 13:56:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:31,249 INFO L225 Difference]: With dead ends: 140 [2018-07-23 13:56:31,249 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 13:56:31,249 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:56:31,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 13:56:31,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2018-07-23 13:56:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:56:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-07-23 13:56:31,294 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2018-07-23 13:56:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:31,295 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-07-23 13:56:31,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:56:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-07-23 13:56:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:56:31,295 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:31,295 INFO L357 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-07-23 13:56:31,295 INFO L414 AbstractCegarLoop]: === Iteration 131 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1856618323, now seen corresponding path program 128 times [2018-07-23 13:56:31,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:31,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:31,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:56:31,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:31,380 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:56:31,380 INFO L185 omatonBuilderFactory]: Interpolants [33920#(<= Main_x 20), 33921#(<= Main_x 21), 33922#(<= Main_x 22), 33923#(<= Main_x 23), 33924#(<= Main_x 24), 33925#(<= Main_x 25), 33926#(<= Main_x 26), 33927#(<= Main_x 27), 33928#(<= Main_x 28), 33929#(<= Main_x 29), 33930#(<= Main_x 30), 33931#(<= Main_x 31), 33932#(<= Main_x 32), 33933#(<= Main_x 33), 33934#(<= Main_x 34), 33935#(<= Main_x 35), 33936#(<= Main_x 36), 33937#(<= Main_x 37), 33938#(<= Main_x 38), 33939#(<= Main_x 39), 33940#(<= Main_x 40), 33941#(<= Main_x 41), 33942#(<= Main_x 42), 33943#(<= Main_x 43), 33944#(<= (+ Main_x 1) 0), 33898#true, 33899#false, 33900#(<= Main_x 0), 33901#(<= Main_x 1), 33902#(<= Main_x 2), 33903#(<= Main_x 3), 33904#(<= Main_x 4), 33905#(<= Main_x 5), 33906#(<= Main_x 6), 33907#(<= Main_x 7), 33908#(<= Main_x 8), 33909#(<= Main_x 9), 33910#(<= Main_x 10), 33911#(<= Main_x 11), 33912#(<= Main_x 12), 33913#(<= Main_x 13), 33914#(<= Main_x 14), 33915#(<= Main_x 15), 33916#(<= Main_x 16), 33917#(<= Main_x 17), 33918#(<= Main_x 18), 33919#(<= Main_x 19)] [2018-07-23 13:56:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:31,380 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:56:31,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:56:31,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:56:31,381 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 47 states. [2018-07-23 13:56:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:31,518 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-07-23 13:56:31,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:56:31,518 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-23 13:56:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:31,518 INFO L225 Difference]: With dead ends: 141 [2018-07-23 13:56:31,519 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:56:31,519 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:56:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:56:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 13:56:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 13:56:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-07-23 13:56:31,574 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 92 [2018-07-23 13:56:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:31,574 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-07-23 13:56:31,574 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:56:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-07-23 13:56:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 13:56:31,575 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:31,575 INFO L357 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-07-23 13:56:31,575 INFO L414 AbstractCegarLoop]: === Iteration 132 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash 2143167303, now seen corresponding path program 129 times [2018-07-23 13:56:31,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:31,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:31,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:56:31,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:31,665 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:56:31,665 INFO L185 omatonBuilderFactory]: Interpolants [34432#(<= 17 Main_x), 34433#(<= 18 Main_x), 34434#(<= 19 Main_x), 34435#(<= 20 Main_x), 34436#(<= 21 Main_x), 34437#(<= 22 Main_x), 34438#(<= 23 Main_x), 34439#(<= 24 Main_x), 34440#(<= 25 Main_x), 34441#(<= 26 Main_x), 34442#(<= 27 Main_x), 34443#(<= 28 Main_x), 34444#(<= 29 Main_x), 34445#(<= 30 Main_x), 34446#(<= 31 Main_x), 34447#(<= 32 Main_x), 34448#(<= 33 Main_x), 34449#(<= 34 Main_x), 34450#(<= 35 Main_x), 34451#(<= 36 Main_x), 34452#(<= 37 Main_x), 34453#(<= 38 Main_x), 34454#(<= 39 Main_x), 34455#(<= 40 Main_x), 34456#(<= 41 Main_x), 34457#(<= 42 Main_x), 34458#(<= 43 Main_x), 34459#(<= 44 Main_x), 34413#true, 34414#false, 34415#(<= 0 Main_x), 34416#(<= 1 Main_x), 34417#(<= 2 Main_x), 34418#(<= 3 Main_x), 34419#(<= 4 Main_x), 34420#(<= 5 Main_x), 34421#(<= 6 Main_x), 34422#(<= 7 Main_x), 34423#(<= 8 Main_x), 34424#(<= 9 Main_x), 34425#(<= 10 Main_x), 34426#(<= 11 Main_x), 34427#(<= 12 Main_x), 34428#(<= 13 Main_x), 34429#(<= 14 Main_x), 34430#(<= 15 Main_x), 34431#(<= 16 Main_x)] [2018-07-23 13:56:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:31,666 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:56:31,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:56:31,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:56:31,667 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-07-23 13:56:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:31,727 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-07-23 13:56:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:56:31,727 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-23 13:56:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:31,728 INFO L225 Difference]: With dead ends: 97 [2018-07-23 13:56:31,728 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 13:56:31,728 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:56:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 13:56:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-23 13:56:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-23 13:56:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-07-23 13:56:31,774 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-07-23 13:56:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:31,774 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-07-23 13:56:31,775 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:56:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-07-23 13:56:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:56:31,775 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:31,775 INFO L357 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1] [2018-07-23 13:56:31,775 INFO L414 AbstractCegarLoop]: === Iteration 133 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2013615431, now seen corresponding path program 130 times [2018-07-23 13:56:31,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:31,965 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:31,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:56:31,965 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:31,965 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:56:31,965 INFO L185 omatonBuilderFactory]: Interpolants [34880#(and (<= 36 Main_y) (<= Main_y 36)), 34881#(and (<= Main_y 37) (<= 37 Main_y)), 34882#(and (<= Main_y 38) (<= 38 Main_y)), 34883#(and (<= 39 Main_y) (<= Main_y 39)), 34884#(and (<= 40 Main_y) (<= Main_y 40)), 34885#(and (<= Main_y 41) (<= 41 Main_y)), 34886#(and (<= 42 Main_y) (<= Main_y 42)), 34887#(and (<= 43 Main_y) (<= Main_y 43)), 34888#(and (<= 44 Main_y) (<= Main_y 44)), 34842#true, 34843#false, 34844#(and (<= 0 Main_y) (<= Main_y 0)), 34845#(and (<= 1 Main_y) (<= Main_y 1)), 34846#(and (<= Main_y 2) (<= 2 Main_y)), 34847#(and (<= Main_y 3) (<= 3 Main_y)), 34848#(and (<= Main_y 4) (<= 4 Main_y)), 34849#(and (<= Main_y 5) (<= 5 Main_y)), 34850#(and (<= Main_y 6) (<= 6 Main_y)), 34851#(and (<= 7 Main_y) (<= Main_y 7)), 34852#(and (<= 8 Main_y) (<= Main_y 8)), 34853#(and (<= Main_y 9) (<= 9 Main_y)), 34854#(and (<= 10 Main_y) (<= Main_y 10)), 34855#(and (<= 11 Main_y) (<= Main_y 11)), 34856#(and (<= 12 Main_y) (<= Main_y 12)), 34857#(and (<= 13 Main_y) (<= Main_y 13)), 34858#(and (<= 14 Main_y) (<= Main_y 14)), 34859#(and (<= Main_y 15) (<= 15 Main_y)), 34860#(and (<= 16 Main_y) (<= Main_y 16)), 34861#(and (<= Main_y 17) (<= 17 Main_y)), 34862#(and (<= Main_y 18) (<= 18 Main_y)), 34863#(and (<= Main_y 19) (<= 19 Main_y)), 34864#(and (<= 20 Main_y) (<= Main_y 20)), 34865#(and (<= 21 Main_y) (<= Main_y 21)), 34866#(and (<= Main_y 22) (<= 22 Main_y)), 34867#(and (<= 23 Main_y) (<= Main_y 23)), 34868#(and (<= Main_y 24) (<= 24 Main_y)), 34869#(and (<= 25 Main_y) (<= Main_y 25)), 34870#(and (<= Main_y 26) (<= 26 Main_y)), 34871#(and (<= 27 Main_y) (<= Main_y 27)), 34872#(and (<= 28 Main_y) (<= Main_y 28)), 34873#(and (<= 29 Main_y) (<= Main_y 29)), 34874#(and (<= 30 Main_y) (<= Main_y 30)), 34875#(and (<= Main_y 31) (<= 31 Main_y)), 34876#(and (<= 32 Main_y) (<= Main_y 32)), 34877#(and (<= 33 Main_y) (<= Main_y 33)), 34878#(and (<= Main_y 34) (<= 34 Main_y)), 34879#(and (<= 35 Main_y) (<= Main_y 35))] [2018-07-23 13:56:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:31,966 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:56:31,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:56:31,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:56:31,967 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 47 states. [2018-07-23 13:56:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:32,289 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-07-23 13:56:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:56:32,290 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 93 [2018-07-23 13:56:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:32,290 INFO L225 Difference]: With dead ends: 143 [2018-07-23 13:56:32,290 INFO L226 Difference]: Without dead ends: 140 [2018-07-23 13:56:32,291 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:56:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-23 13:56:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-07-23 13:56:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:56:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-07-23 13:56:32,337 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2018-07-23 13:56:32,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:32,337 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-07-23 13:56:32,338 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:56:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-07-23 13:56:32,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:56:32,338 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:32,338 INFO L357 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-07-23 13:56:32,338 INFO L414 AbstractCegarLoop]: === Iteration 134 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2002492601, now seen corresponding path program 131 times [2018-07-23 13:56:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:32,417 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:32,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:56:32,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:32,418 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:56:32,418 INFO L185 omatonBuilderFactory]: Interpolants [35392#(<= Main_x 23), 35393#(<= Main_x 24), 35394#(<= Main_x 25), 35395#(<= Main_x 26), 35396#(<= Main_x 27), 35397#(<= Main_x 28), 35398#(<= Main_x 29), 35399#(<= Main_x 30), 35400#(<= Main_x 31), 35401#(<= Main_x 32), 35402#(<= Main_x 33), 35403#(<= Main_x 34), 35404#(<= Main_x 35), 35405#(<= Main_x 36), 35406#(<= Main_x 37), 35407#(<= Main_x 38), 35408#(<= Main_x 39), 35409#(<= Main_x 40), 35410#(<= Main_x 41), 35411#(<= Main_x 42), 35412#(<= Main_x 43), 35413#(<= Main_x 44), 35414#(<= (+ Main_x 1) 0), 35367#true, 35368#false, 35369#(<= Main_x 0), 35370#(<= Main_x 1), 35371#(<= Main_x 2), 35372#(<= Main_x 3), 35373#(<= Main_x 4), 35374#(<= Main_x 5), 35375#(<= Main_x 6), 35376#(<= Main_x 7), 35377#(<= Main_x 8), 35378#(<= Main_x 9), 35379#(<= Main_x 10), 35380#(<= Main_x 11), 35381#(<= Main_x 12), 35382#(<= Main_x 13), 35383#(<= Main_x 14), 35384#(<= Main_x 15), 35385#(<= Main_x 16), 35386#(<= Main_x 17), 35387#(<= Main_x 18), 35388#(<= Main_x 19), 35389#(<= Main_x 20), 35390#(<= Main_x 21), 35391#(<= Main_x 22)] [2018-07-23 13:56:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:32,419 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:56:32,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:56:32,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:56:32,420 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 48 states. [2018-07-23 13:56:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:32,579 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-07-23 13:56:32,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:56:32,579 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-23 13:56:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:32,580 INFO L225 Difference]: With dead ends: 144 [2018-07-23 13:56:32,580 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 13:56:32,580 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:56:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 13:56:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 13:56:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 13:56:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-07-23 13:56:32,646 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 94 [2018-07-23 13:56:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:32,646 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-07-23 13:56:32,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:56:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-07-23 13:56:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 13:56:32,646 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:32,647 INFO L357 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-07-23 13:56:32,647 INFO L414 AbstractCegarLoop]: === Iteration 135 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1731777517, now seen corresponding path program 132 times [2018-07-23 13:56:32,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:32,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:32,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:56:32,765 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:32,765 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:56:32,765 INFO L185 omatonBuilderFactory]: Interpolants [35904#(<= 9 Main_x), 35905#(<= 10 Main_x), 35906#(<= 11 Main_x), 35907#(<= 12 Main_x), 35908#(<= 13 Main_x), 35909#(<= 14 Main_x), 35910#(<= 15 Main_x), 35911#(<= 16 Main_x), 35912#(<= 17 Main_x), 35913#(<= 18 Main_x), 35914#(<= 19 Main_x), 35915#(<= 20 Main_x), 35916#(<= 21 Main_x), 35917#(<= 22 Main_x), 35918#(<= 23 Main_x), 35919#(<= 24 Main_x), 35920#(<= 25 Main_x), 35921#(<= 26 Main_x), 35922#(<= 27 Main_x), 35923#(<= 28 Main_x), 35924#(<= 29 Main_x), 35925#(<= 30 Main_x), 35926#(<= 31 Main_x), 35927#(<= 32 Main_x), 35928#(<= 33 Main_x), 35929#(<= 34 Main_x), 35930#(<= 35 Main_x), 35931#(<= 36 Main_x), 35932#(<= 37 Main_x), 35933#(<= 38 Main_x), 35934#(<= 39 Main_x), 35935#(<= 40 Main_x), 35936#(<= 41 Main_x), 35937#(<= 42 Main_x), 35938#(<= 43 Main_x), 35939#(<= 44 Main_x), 35940#(<= 45 Main_x), 35893#true, 35894#false, 35895#(<= 0 Main_x), 35896#(<= 1 Main_x), 35897#(<= 2 Main_x), 35898#(<= 3 Main_x), 35899#(<= 4 Main_x), 35900#(<= 5 Main_x), 35901#(<= 6 Main_x), 35902#(<= 7 Main_x), 35903#(<= 8 Main_x)] [2018-07-23 13:56:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:32,765 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:56:32,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:56:32,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:56:32,766 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-07-23 13:56:32,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:32,832 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-07-23 13:56:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:56:32,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-23 13:56:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:32,832 INFO L225 Difference]: With dead ends: 99 [2018-07-23 13:56:32,832 INFO L226 Difference]: Without dead ends: 96 [2018-07-23 13:56:32,833 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:56:32,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-23 13:56:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-23 13:56:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:56:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-07-23 13:56:32,875 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2018-07-23 13:56:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:32,875 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-07-23 13:56:32,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:56:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-07-23 13:56:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-23 13:56:32,876 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:32,876 INFO L357 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1] [2018-07-23 13:56:32,876 INFO L414 AbstractCegarLoop]: === Iteration 136 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2145433953, now seen corresponding path program 133 times [2018-07-23 13:56:32,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:33,022 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:33,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:56:33,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:33,023 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:56:33,023 INFO L185 omatonBuilderFactory]: Interpolants [36352#(and (<= Main_y 19) (<= 19 Main_y)), 36353#(and (<= 20 Main_y) (<= Main_y 20)), 36354#(and (<= 21 Main_y) (<= Main_y 21)), 36355#(and (<= Main_y 22) (<= 22 Main_y)), 36356#(and (<= 23 Main_y) (<= Main_y 23)), 36357#(and (<= Main_y 24) (<= 24 Main_y)), 36358#(and (<= 25 Main_y) (<= Main_y 25)), 36359#(and (<= Main_y 26) (<= 26 Main_y)), 36360#(and (<= 27 Main_y) (<= Main_y 27)), 36361#(and (<= 28 Main_y) (<= Main_y 28)), 36362#(and (<= 29 Main_y) (<= Main_y 29)), 36363#(and (<= 30 Main_y) (<= Main_y 30)), 36364#(and (<= Main_y 31) (<= 31 Main_y)), 36365#(and (<= 32 Main_y) (<= Main_y 32)), 36366#(and (<= 33 Main_y) (<= Main_y 33)), 36367#(and (<= Main_y 34) (<= 34 Main_y)), 36368#(and (<= 35 Main_y) (<= Main_y 35)), 36369#(and (<= 36 Main_y) (<= Main_y 36)), 36370#(and (<= Main_y 37) (<= 37 Main_y)), 36371#(and (<= Main_y 38) (<= 38 Main_y)), 36372#(and (<= 39 Main_y) (<= Main_y 39)), 36373#(and (<= 40 Main_y) (<= Main_y 40)), 36374#(and (<= Main_y 41) (<= 41 Main_y)), 36375#(and (<= 42 Main_y) (<= Main_y 42)), 36376#(and (<= 43 Main_y) (<= Main_y 43)), 36377#(and (<= 44 Main_y) (<= Main_y 44)), 36378#(and (<= Main_y 45) (<= 45 Main_y)), 36331#true, 36332#false, 36333#(and (<= 0 Main_y) (<= Main_y 0)), 36334#(and (<= 1 Main_y) (<= Main_y 1)), 36335#(and (<= Main_y 2) (<= 2 Main_y)), 36336#(and (<= Main_y 3) (<= 3 Main_y)), 36337#(and (<= Main_y 4) (<= 4 Main_y)), 36338#(and (<= Main_y 5) (<= 5 Main_y)), 36339#(and (<= Main_y 6) (<= 6 Main_y)), 36340#(and (<= 7 Main_y) (<= Main_y 7)), 36341#(and (<= 8 Main_y) (<= Main_y 8)), 36342#(and (<= Main_y 9) (<= 9 Main_y)), 36343#(and (<= 10 Main_y) (<= Main_y 10)), 36344#(and (<= 11 Main_y) (<= Main_y 11)), 36345#(and (<= 12 Main_y) (<= Main_y 12)), 36346#(and (<= 13 Main_y) (<= Main_y 13)), 36347#(and (<= 14 Main_y) (<= Main_y 14)), 36348#(and (<= Main_y 15) (<= 15 Main_y)), 36349#(and (<= 16 Main_y) (<= Main_y 16)), 36350#(and (<= Main_y 17) (<= 17 Main_y)), 36351#(and (<= Main_y 18) (<= 18 Main_y))] [2018-07-23 13:56:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:33,024 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:56:33,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:56:33,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:56:33,024 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 48 states. [2018-07-23 13:56:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:33,383 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-07-23 13:56:33,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:56:33,383 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 95 [2018-07-23 13:56:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:33,384 INFO L225 Difference]: With dead ends: 146 [2018-07-23 13:56:33,384 INFO L226 Difference]: Without dead ends: 143 [2018-07-23 13:56:33,384 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:56:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-23 13:56:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-07-23 13:56:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:56:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-07-23 13:56:33,440 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2018-07-23 13:56:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:33,440 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-07-23 13:56:33,440 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:56:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-07-23 13:56:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:56:33,441 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:33,441 INFO L357 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-07-23 13:56:33,442 INFO L414 AbstractCegarLoop]: === Iteration 137 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:33,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2083881581, now seen corresponding path program 134 times [2018-07-23 13:56:33,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:33,588 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:33,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:56:33,589 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:33,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:56:33,589 INFO L185 omatonBuilderFactory]: Interpolants [36867#true, 36868#false, 36869#(<= Main_x 0), 36870#(<= Main_x 1), 36871#(<= Main_x 2), 36872#(<= Main_x 3), 36873#(<= Main_x 4), 36874#(<= Main_x 5), 36875#(<= Main_x 6), 36876#(<= Main_x 7), 36877#(<= Main_x 8), 36878#(<= Main_x 9), 36879#(<= Main_x 10), 36880#(<= Main_x 11), 36881#(<= Main_x 12), 36882#(<= Main_x 13), 36883#(<= Main_x 14), 36884#(<= Main_x 15), 36885#(<= Main_x 16), 36886#(<= Main_x 17), 36887#(<= Main_x 18), 36888#(<= Main_x 19), 36889#(<= Main_x 20), 36890#(<= Main_x 21), 36891#(<= Main_x 22), 36892#(<= Main_x 23), 36893#(<= Main_x 24), 36894#(<= Main_x 25), 36895#(<= Main_x 26), 36896#(<= Main_x 27), 36897#(<= Main_x 28), 36898#(<= Main_x 29), 36899#(<= Main_x 30), 36900#(<= Main_x 31), 36901#(<= Main_x 32), 36902#(<= Main_x 33), 36903#(<= Main_x 34), 36904#(<= Main_x 35), 36905#(<= Main_x 36), 36906#(<= Main_x 37), 36907#(<= Main_x 38), 36908#(<= Main_x 39), 36909#(<= Main_x 40), 36910#(<= Main_x 41), 36911#(<= Main_x 42), 36912#(<= Main_x 43), 36913#(<= Main_x 44), 36914#(<= Main_x 45), 36915#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:33,590 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:56:33,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:56:33,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:56:33,590 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 49 states. [2018-07-23 13:56:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:33,798 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-07-23 13:56:33,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:56:33,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-23 13:56:33,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:33,799 INFO L225 Difference]: With dead ends: 147 [2018-07-23 13:56:33,799 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:56:33,799 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:56:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:56:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 13:56:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 13:56:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-07-23 13:56:33,850 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 96 [2018-07-23 13:56:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:33,850 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-07-23 13:56:33,851 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:56:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-07-23 13:56:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 13:56:33,851 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:33,851 INFO L357 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-07-23 13:56:33,851 INFO L414 AbstractCegarLoop]: === Iteration 138 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1882138247, now seen corresponding path program 135 times [2018-07-23 13:56:33,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:33,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:33,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:56:33,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:33,949 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:56:33,949 INFO L185 omatonBuilderFactory]: Interpolants [37404#true, 37405#false, 37406#(<= 0 Main_x), 37407#(<= 1 Main_x), 37408#(<= 2 Main_x), 37409#(<= 3 Main_x), 37410#(<= 4 Main_x), 37411#(<= 5 Main_x), 37412#(<= 6 Main_x), 37413#(<= 7 Main_x), 37414#(<= 8 Main_x), 37415#(<= 9 Main_x), 37416#(<= 10 Main_x), 37417#(<= 11 Main_x), 37418#(<= 12 Main_x), 37419#(<= 13 Main_x), 37420#(<= 14 Main_x), 37421#(<= 15 Main_x), 37422#(<= 16 Main_x), 37423#(<= 17 Main_x), 37424#(<= 18 Main_x), 37425#(<= 19 Main_x), 37426#(<= 20 Main_x), 37427#(<= 21 Main_x), 37428#(<= 22 Main_x), 37429#(<= 23 Main_x), 37430#(<= 24 Main_x), 37431#(<= 25 Main_x), 37432#(<= 26 Main_x), 37433#(<= 27 Main_x), 37434#(<= 28 Main_x), 37435#(<= 29 Main_x), 37436#(<= 30 Main_x), 37437#(<= 31 Main_x), 37438#(<= 32 Main_x), 37439#(<= 33 Main_x), 37440#(<= 34 Main_x), 37441#(<= 35 Main_x), 37442#(<= 36 Main_x), 37443#(<= 37 Main_x), 37444#(<= 38 Main_x), 37445#(<= 39 Main_x), 37446#(<= 40 Main_x), 37447#(<= 41 Main_x), 37448#(<= 42 Main_x), 37449#(<= 43 Main_x), 37450#(<= 44 Main_x), 37451#(<= 45 Main_x), 37452#(<= 46 Main_x)] [2018-07-23 13:56:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:33,949 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:56:33,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:56:33,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:56:33,950 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-07-23 13:56:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:34,022 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-07-23 13:56:34,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:56:34,022 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-23 13:56:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:34,022 INFO L225 Difference]: With dead ends: 101 [2018-07-23 13:56:34,022 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 13:56:34,023 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:56:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 13:56:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-23 13:56:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-23 13:56:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-07-23 13:56:34,074 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2018-07-23 13:56:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:34,074 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-07-23 13:56:34,074 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:56:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-07-23 13:56:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-23 13:56:34,074 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:34,074 INFO L357 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1] [2018-07-23 13:56:34,074 INFO L414 AbstractCegarLoop]: === Iteration 139 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1783318009, now seen corresponding path program 136 times [2018-07-23 13:56:34,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:34,221 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:34,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:56:34,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:34,221 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:56:34,221 INFO L185 omatonBuilderFactory]: Interpolants [37888#(and (<= 35 Main_y) (<= Main_y 35)), 37889#(and (<= 36 Main_y) (<= Main_y 36)), 37890#(and (<= Main_y 37) (<= 37 Main_y)), 37891#(and (<= Main_y 38) (<= 38 Main_y)), 37892#(and (<= 39 Main_y) (<= Main_y 39)), 37893#(and (<= 40 Main_y) (<= Main_y 40)), 37894#(and (<= Main_y 41) (<= 41 Main_y)), 37895#(and (<= 42 Main_y) (<= Main_y 42)), 37896#(and (<= 43 Main_y) (<= Main_y 43)), 37897#(and (<= 44 Main_y) (<= Main_y 44)), 37898#(and (<= Main_y 45) (<= 45 Main_y)), 37899#(and (<= 46 Main_y) (<= Main_y 46)), 37851#true, 37852#false, 37853#(and (<= 0 Main_y) (<= Main_y 0)), 37854#(and (<= 1 Main_y) (<= Main_y 1)), 37855#(and (<= Main_y 2) (<= 2 Main_y)), 37856#(and (<= Main_y 3) (<= 3 Main_y)), 37857#(and (<= Main_y 4) (<= 4 Main_y)), 37858#(and (<= Main_y 5) (<= 5 Main_y)), 37859#(and (<= Main_y 6) (<= 6 Main_y)), 37860#(and (<= 7 Main_y) (<= Main_y 7)), 37861#(and (<= 8 Main_y) (<= Main_y 8)), 37862#(and (<= Main_y 9) (<= 9 Main_y)), 37863#(and (<= 10 Main_y) (<= Main_y 10)), 37864#(and (<= 11 Main_y) (<= Main_y 11)), 37865#(and (<= 12 Main_y) (<= Main_y 12)), 37866#(and (<= 13 Main_y) (<= Main_y 13)), 37867#(and (<= 14 Main_y) (<= Main_y 14)), 37868#(and (<= Main_y 15) (<= 15 Main_y)), 37869#(and (<= 16 Main_y) (<= Main_y 16)), 37870#(and (<= Main_y 17) (<= 17 Main_y)), 37871#(and (<= Main_y 18) (<= 18 Main_y)), 37872#(and (<= Main_y 19) (<= 19 Main_y)), 37873#(and (<= 20 Main_y) (<= Main_y 20)), 37874#(and (<= 21 Main_y) (<= Main_y 21)), 37875#(and (<= Main_y 22) (<= 22 Main_y)), 37876#(and (<= 23 Main_y) (<= Main_y 23)), 37877#(and (<= Main_y 24) (<= 24 Main_y)), 37878#(and (<= 25 Main_y) (<= Main_y 25)), 37879#(and (<= Main_y 26) (<= 26 Main_y)), 37880#(and (<= 27 Main_y) (<= Main_y 27)), 37881#(and (<= 28 Main_y) (<= Main_y 28)), 37882#(and (<= 29 Main_y) (<= Main_y 29)), 37883#(and (<= 30 Main_y) (<= Main_y 30)), 37884#(and (<= Main_y 31) (<= 31 Main_y)), 37885#(and (<= 32 Main_y) (<= Main_y 32)), 37886#(and (<= 33 Main_y) (<= Main_y 33)), 37887#(and (<= Main_y 34) (<= 34 Main_y))] [2018-07-23 13:56:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:34,222 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:56:34,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:56:34,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:56:34,223 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 49 states. [2018-07-23 13:56:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:34,552 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-07-23 13:56:34,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:56:34,553 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 97 [2018-07-23 13:56:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:34,553 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:56:34,553 INFO L226 Difference]: Without dead ends: 146 [2018-07-23 13:56:34,554 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:56:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-23 13:56:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2018-07-23 13:56:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:56:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-07-23 13:56:34,604 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2018-07-23 13:56:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:34,604 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-07-23 13:56:34,604 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:56:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-07-23 13:56:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:56:34,605 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:34,605 INFO L357 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-07-23 13:56:34,605 INFO L414 AbstractCegarLoop]: === Iteration 140 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash 551655047, now seen corresponding path program 137 times [2018-07-23 13:56:34,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:34,698 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:34,699 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:56:34,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:34,699 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:56:34,699 INFO L185 omatonBuilderFactory]: Interpolants [38400#(<= Main_x 0), 38401#(<= Main_x 1), 38402#(<= Main_x 2), 38403#(<= Main_x 3), 38404#(<= Main_x 4), 38405#(<= Main_x 5), 38406#(<= Main_x 6), 38407#(<= Main_x 7), 38408#(<= Main_x 8), 38409#(<= Main_x 9), 38410#(<= Main_x 10), 38411#(<= Main_x 11), 38412#(<= Main_x 12), 38413#(<= Main_x 13), 38414#(<= Main_x 14), 38415#(<= Main_x 15), 38416#(<= Main_x 16), 38417#(<= Main_x 17), 38418#(<= Main_x 18), 38419#(<= Main_x 19), 38420#(<= Main_x 20), 38421#(<= Main_x 21), 38422#(<= Main_x 22), 38423#(<= Main_x 23), 38424#(<= Main_x 24), 38425#(<= Main_x 25), 38426#(<= Main_x 26), 38427#(<= Main_x 27), 38428#(<= Main_x 28), 38429#(<= Main_x 29), 38430#(<= Main_x 30), 38431#(<= Main_x 31), 38432#(<= Main_x 32), 38433#(<= Main_x 33), 38434#(<= Main_x 34), 38435#(<= Main_x 35), 38436#(<= Main_x 36), 38437#(<= Main_x 37), 38438#(<= Main_x 38), 38439#(<= Main_x 39), 38440#(<= Main_x 40), 38441#(<= Main_x 41), 38442#(<= Main_x 42), 38443#(<= Main_x 43), 38444#(<= Main_x 44), 38445#(<= Main_x 45), 38446#(<= Main_x 46), 38447#(<= (+ Main_x 1) 0), 38398#true, 38399#false] [2018-07-23 13:56:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:34,699 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:56:34,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:56:34,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:56:34,700 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 50 states. [2018-07-23 13:56:34,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:34,859 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-07-23 13:56:34,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:56:34,859 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-23 13:56:34,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:34,859 INFO L225 Difference]: With dead ends: 150 [2018-07-23 13:56:34,859 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 13:56:34,860 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:56:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 13:56:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 13:56:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 13:56:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-07-23 13:56:34,905 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 98 [2018-07-23 13:56:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:34,905 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-07-23 13:56:34,905 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:56:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-07-23 13:56:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 13:56:34,905 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:34,906 INFO L357 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-07-23 13:56:34,906 INFO L414 AbstractCegarLoop]: === Iteration 141 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1407421011, now seen corresponding path program 138 times [2018-07-23 13:56:34,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:35,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:35,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:56:35,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:35,043 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:56:35,044 INFO L185 omatonBuilderFactory]: Interpolants [38946#true, 38947#false, 38948#(<= 0 Main_x), 38949#(<= 1 Main_x), 38950#(<= 2 Main_x), 38951#(<= 3 Main_x), 38952#(<= 4 Main_x), 38953#(<= 5 Main_x), 38954#(<= 6 Main_x), 38955#(<= 7 Main_x), 38956#(<= 8 Main_x), 38957#(<= 9 Main_x), 38958#(<= 10 Main_x), 38959#(<= 11 Main_x), 38960#(<= 12 Main_x), 38961#(<= 13 Main_x), 38962#(<= 14 Main_x), 38963#(<= 15 Main_x), 38964#(<= 16 Main_x), 38965#(<= 17 Main_x), 38966#(<= 18 Main_x), 38967#(<= 19 Main_x), 38968#(<= 20 Main_x), 38969#(<= 21 Main_x), 38970#(<= 22 Main_x), 38971#(<= 23 Main_x), 38972#(<= 24 Main_x), 38973#(<= 25 Main_x), 38974#(<= 26 Main_x), 38975#(<= 27 Main_x), 38976#(<= 28 Main_x), 38977#(<= 29 Main_x), 38978#(<= 30 Main_x), 38979#(<= 31 Main_x), 38980#(<= 32 Main_x), 38981#(<= 33 Main_x), 38982#(<= 34 Main_x), 38983#(<= 35 Main_x), 38984#(<= 36 Main_x), 38985#(<= 37 Main_x), 38986#(<= 38 Main_x), 38987#(<= 39 Main_x), 38988#(<= 40 Main_x), 38989#(<= 41 Main_x), 38990#(<= 42 Main_x), 38991#(<= 43 Main_x), 38992#(<= 44 Main_x), 38993#(<= 45 Main_x), 38994#(<= 46 Main_x), 38995#(<= 47 Main_x)] [2018-07-23 13:56:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:35,044 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:56:35,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:56:35,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:56:35,045 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-07-23 13:56:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:35,138 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-07-23 13:56:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:56:35,139 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-23 13:56:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:35,140 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:56:35,140 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 13:56:35,140 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:56:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 13:56:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-23 13:56:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:56:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-07-23 13:56:35,188 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-07-23 13:56:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:35,188 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-07-23 13:56:35,188 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:56:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-07-23 13:56:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-23 13:56:35,189 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:35,189 INFO L357 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1] [2018-07-23 13:56:35,189 INFO L414 AbstractCegarLoop]: === Iteration 142 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -680439903, now seen corresponding path program 139 times [2018-07-23 13:56:35,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:35,355 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:35,355 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:56:35,355 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:35,355 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:56:35,356 INFO L185 omatonBuilderFactory]: Interpolants [39424#(and (<= 20 Main_y) (<= Main_y 20)), 39425#(and (<= 21 Main_y) (<= Main_y 21)), 39426#(and (<= Main_y 22) (<= 22 Main_y)), 39427#(and (<= 23 Main_y) (<= Main_y 23)), 39428#(and (<= Main_y 24) (<= 24 Main_y)), 39429#(and (<= 25 Main_y) (<= Main_y 25)), 39430#(and (<= Main_y 26) (<= 26 Main_y)), 39431#(and (<= 27 Main_y) (<= Main_y 27)), 39432#(and (<= 28 Main_y) (<= Main_y 28)), 39433#(and (<= 29 Main_y) (<= Main_y 29)), 39434#(and (<= 30 Main_y) (<= Main_y 30)), 39435#(and (<= Main_y 31) (<= 31 Main_y)), 39436#(and (<= 32 Main_y) (<= Main_y 32)), 39437#(and (<= 33 Main_y) (<= Main_y 33)), 39438#(and (<= Main_y 34) (<= 34 Main_y)), 39439#(and (<= 35 Main_y) (<= Main_y 35)), 39440#(and (<= 36 Main_y) (<= Main_y 36)), 39441#(and (<= Main_y 37) (<= 37 Main_y)), 39442#(and (<= Main_y 38) (<= 38 Main_y)), 39443#(and (<= 39 Main_y) (<= Main_y 39)), 39444#(and (<= 40 Main_y) (<= Main_y 40)), 39445#(and (<= Main_y 41) (<= 41 Main_y)), 39446#(and (<= 42 Main_y) (<= Main_y 42)), 39447#(and (<= 43 Main_y) (<= Main_y 43)), 39448#(and (<= 44 Main_y) (<= Main_y 44)), 39449#(and (<= Main_y 45) (<= 45 Main_y)), 39450#(and (<= 46 Main_y) (<= Main_y 46)), 39451#(and (<= 47 Main_y) (<= Main_y 47)), 39402#true, 39403#false, 39404#(and (<= 0 Main_y) (<= Main_y 0)), 39405#(and (<= 1 Main_y) (<= Main_y 1)), 39406#(and (<= Main_y 2) (<= 2 Main_y)), 39407#(and (<= Main_y 3) (<= 3 Main_y)), 39408#(and (<= Main_y 4) (<= 4 Main_y)), 39409#(and (<= Main_y 5) (<= 5 Main_y)), 39410#(and (<= Main_y 6) (<= 6 Main_y)), 39411#(and (<= 7 Main_y) (<= Main_y 7)), 39412#(and (<= 8 Main_y) (<= Main_y 8)), 39413#(and (<= Main_y 9) (<= 9 Main_y)), 39414#(and (<= 10 Main_y) (<= Main_y 10)), 39415#(and (<= 11 Main_y) (<= Main_y 11)), 39416#(and (<= 12 Main_y) (<= Main_y 12)), 39417#(and (<= 13 Main_y) (<= Main_y 13)), 39418#(and (<= 14 Main_y) (<= Main_y 14)), 39419#(and (<= Main_y 15) (<= 15 Main_y)), 39420#(and (<= 16 Main_y) (<= Main_y 16)), 39421#(and (<= Main_y 17) (<= 17 Main_y)), 39422#(and (<= Main_y 18) (<= 18 Main_y)), 39423#(and (<= Main_y 19) (<= 19 Main_y))] [2018-07-23 13:56:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:35,356 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:56:35,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:56:35,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:56:35,357 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 50 states. [2018-07-23 13:56:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:35,673 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-07-23 13:56:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:56:35,673 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2018-07-23 13:56:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:35,673 INFO L225 Difference]: With dead ends: 152 [2018-07-23 13:56:35,674 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 13:56:35,674 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:56:35,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 13:56:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2018-07-23 13:56:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 13:56:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-07-23 13:56:35,721 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2018-07-23 13:56:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:35,721 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-07-23 13:56:35,721 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:56:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-07-23 13:56:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:56:35,722 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:35,722 INFO L357 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-07-23 13:56:35,722 INFO L414 AbstractCegarLoop]: === Iteration 143 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 381137965, now seen corresponding path program 140 times [2018-07-23 13:56:35,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:35,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:35,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:56:35,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:35,809 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:56:35,809 INFO L185 omatonBuilderFactory]: Interpolants [39960#true, 39961#false, 39962#(<= Main_x 0), 39963#(<= Main_x 1), 39964#(<= Main_x 2), 39965#(<= Main_x 3), 39966#(<= Main_x 4), 39967#(<= Main_x 5), 39968#(<= Main_x 6), 39969#(<= Main_x 7), 39970#(<= Main_x 8), 39971#(<= Main_x 9), 39972#(<= Main_x 10), 39973#(<= Main_x 11), 39974#(<= Main_x 12), 39975#(<= Main_x 13), 39976#(<= Main_x 14), 39977#(<= Main_x 15), 39978#(<= Main_x 16), 39979#(<= Main_x 17), 39980#(<= Main_x 18), 39981#(<= Main_x 19), 39982#(<= Main_x 20), 39983#(<= Main_x 21), 39984#(<= Main_x 22), 39985#(<= Main_x 23), 39986#(<= Main_x 24), 39987#(<= Main_x 25), 39988#(<= Main_x 26), 39989#(<= Main_x 27), 39990#(<= Main_x 28), 39991#(<= Main_x 29), 39992#(<= Main_x 30), 39993#(<= Main_x 31), 39994#(<= Main_x 32), 39995#(<= Main_x 33), 39996#(<= Main_x 34), 39997#(<= Main_x 35), 39998#(<= Main_x 36), 39999#(<= Main_x 37), 40000#(<= Main_x 38), 40001#(<= Main_x 39), 40002#(<= Main_x 40), 40003#(<= Main_x 41), 40004#(<= Main_x 42), 40005#(<= Main_x 43), 40006#(<= Main_x 44), 40007#(<= Main_x 45), 40008#(<= Main_x 46), 40009#(<= Main_x 47), 40010#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:35,809 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:56:35,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:56:35,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:56:35,810 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 51 states. [2018-07-23 13:56:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:35,959 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-07-23 13:56:35,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:56:35,959 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-23 13:56:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:35,959 INFO L225 Difference]: With dead ends: 153 [2018-07-23 13:56:35,960 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 13:56:35,960 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:56:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 13:56:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 13:56:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 13:56:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-07-23 13:56:36,033 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 100 [2018-07-23 13:56:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:36,033 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-07-23 13:56:36,033 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:56:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-07-23 13:56:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 13:56:36,034 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:36,034 INFO L357 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-07-23 13:56:36,034 INFO L414 AbstractCegarLoop]: === Iteration 144 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash -220677689, now seen corresponding path program 141 times [2018-07-23 13:56:36,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:36,176 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:36,176 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:56:36,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:36,176 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:56:36,176 INFO L185 omatonBuilderFactory]: Interpolants [40519#true, 40520#false, 40521#(<= 0 Main_x), 40522#(<= 1 Main_x), 40523#(<= 2 Main_x), 40524#(<= 3 Main_x), 40525#(<= 4 Main_x), 40526#(<= 5 Main_x), 40527#(<= 6 Main_x), 40528#(<= 7 Main_x), 40529#(<= 8 Main_x), 40530#(<= 9 Main_x), 40531#(<= 10 Main_x), 40532#(<= 11 Main_x), 40533#(<= 12 Main_x), 40534#(<= 13 Main_x), 40535#(<= 14 Main_x), 40536#(<= 15 Main_x), 40537#(<= 16 Main_x), 40538#(<= 17 Main_x), 40539#(<= 18 Main_x), 40540#(<= 19 Main_x), 40541#(<= 20 Main_x), 40542#(<= 21 Main_x), 40543#(<= 22 Main_x), 40544#(<= 23 Main_x), 40545#(<= 24 Main_x), 40546#(<= 25 Main_x), 40547#(<= 26 Main_x), 40548#(<= 27 Main_x), 40549#(<= 28 Main_x), 40550#(<= 29 Main_x), 40551#(<= 30 Main_x), 40552#(<= 31 Main_x), 40553#(<= 32 Main_x), 40554#(<= 33 Main_x), 40555#(<= 34 Main_x), 40556#(<= 35 Main_x), 40557#(<= 36 Main_x), 40558#(<= 37 Main_x), 40559#(<= 38 Main_x), 40560#(<= 39 Main_x), 40561#(<= 40 Main_x), 40562#(<= 41 Main_x), 40563#(<= 42 Main_x), 40564#(<= 43 Main_x), 40565#(<= 44 Main_x), 40566#(<= 45 Main_x), 40567#(<= 46 Main_x), 40568#(<= 47 Main_x), 40569#(<= 48 Main_x)] [2018-07-23 13:56:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:36,177 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:56:36,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:56:36,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:56:36,178 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-07-23 13:56:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:36,248 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-07-23 13:56:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:56:36,248 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-23 13:56:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:36,249 INFO L225 Difference]: With dead ends: 105 [2018-07-23 13:56:36,249 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 13:56:36,249 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:56:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 13:56:36,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-23 13:56:36,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-23 13:56:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-07-23 13:56:36,296 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 100 [2018-07-23 13:56:36,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:36,296 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-07-23 13:56:36,296 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:56:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-07-23 13:56:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-23 13:56:36,296 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:36,296 INFO L357 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1] [2018-07-23 13:56:36,296 INFO L414 AbstractCegarLoop]: === Iteration 145 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1748864711, now seen corresponding path program 142 times [2018-07-23 13:56:36,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:36,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:36,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:56:36,461 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:36,461 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:56:36,461 INFO L185 omatonBuilderFactory]: Interpolants [40984#true, 40985#false, 40986#(and (<= 0 Main_y) (<= Main_y 0)), 40987#(and (<= 1 Main_y) (<= Main_y 1)), 40988#(and (<= Main_y 2) (<= 2 Main_y)), 40989#(and (<= Main_y 3) (<= 3 Main_y)), 40990#(and (<= Main_y 4) (<= 4 Main_y)), 40991#(and (<= Main_y 5) (<= 5 Main_y)), 40992#(and (<= Main_y 6) (<= 6 Main_y)), 40993#(and (<= 7 Main_y) (<= Main_y 7)), 40994#(and (<= 8 Main_y) (<= Main_y 8)), 40995#(and (<= Main_y 9) (<= 9 Main_y)), 40996#(and (<= 10 Main_y) (<= Main_y 10)), 40997#(and (<= 11 Main_y) (<= Main_y 11)), 40998#(and (<= 12 Main_y) (<= Main_y 12)), 40999#(and (<= 13 Main_y) (<= Main_y 13)), 41000#(and (<= 14 Main_y) (<= Main_y 14)), 41001#(and (<= Main_y 15) (<= 15 Main_y)), 41002#(and (<= 16 Main_y) (<= Main_y 16)), 41003#(and (<= Main_y 17) (<= 17 Main_y)), 41004#(and (<= Main_y 18) (<= 18 Main_y)), 41005#(and (<= Main_y 19) (<= 19 Main_y)), 41006#(and (<= 20 Main_y) (<= Main_y 20)), 41007#(and (<= 21 Main_y) (<= Main_y 21)), 41008#(and (<= Main_y 22) (<= 22 Main_y)), 41009#(and (<= 23 Main_y) (<= Main_y 23)), 41010#(and (<= Main_y 24) (<= 24 Main_y)), 41011#(and (<= 25 Main_y) (<= Main_y 25)), 41012#(and (<= Main_y 26) (<= 26 Main_y)), 41013#(and (<= 27 Main_y) (<= Main_y 27)), 41014#(and (<= 28 Main_y) (<= Main_y 28)), 41015#(and (<= 29 Main_y) (<= Main_y 29)), 41016#(and (<= 30 Main_y) (<= Main_y 30)), 41017#(and (<= Main_y 31) (<= 31 Main_y)), 41018#(and (<= 32 Main_y) (<= Main_y 32)), 41019#(and (<= 33 Main_y) (<= Main_y 33)), 41020#(and (<= Main_y 34) (<= 34 Main_y)), 41021#(and (<= 35 Main_y) (<= Main_y 35)), 41022#(and (<= 36 Main_y) (<= Main_y 36)), 41023#(and (<= Main_y 37) (<= 37 Main_y)), 41024#(and (<= Main_y 38) (<= 38 Main_y)), 41025#(and (<= 39 Main_y) (<= Main_y 39)), 41026#(and (<= 40 Main_y) (<= Main_y 40)), 41027#(and (<= Main_y 41) (<= 41 Main_y)), 41028#(and (<= 42 Main_y) (<= Main_y 42)), 41029#(and (<= 43 Main_y) (<= Main_y 43)), 41030#(and (<= 44 Main_y) (<= Main_y 44)), 41031#(and (<= Main_y 45) (<= 45 Main_y)), 41032#(and (<= 46 Main_y) (<= Main_y 46)), 41033#(and (<= 47 Main_y) (<= Main_y 47)), 41034#(and (<= 48 Main_y) (<= Main_y 48))] [2018-07-23 13:56:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:36,461 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:56:36,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:56:36,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:56:36,462 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 51 states. [2018-07-23 13:56:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:36,823 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-07-23 13:56:36,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:56:36,823 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 101 [2018-07-23 13:56:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:36,824 INFO L225 Difference]: With dead ends: 155 [2018-07-23 13:56:36,824 INFO L226 Difference]: Without dead ends: 152 [2018-07-23 13:56:36,824 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:56:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-23 13:56:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 104. [2018-07-23 13:56:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:56:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-07-23 13:56:36,881 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2018-07-23 13:56:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-07-23 13:56:36,882 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:56:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-07-23 13:56:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 13:56:36,882 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:36,882 INFO L357 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-07-23 13:56:36,882 INFO L414 AbstractCegarLoop]: === Iteration 146 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:36,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1619830329, now seen corresponding path program 143 times [2018-07-23 13:56:36,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:36,983 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:36,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:56:36,983 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:36,984 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:56:36,984 INFO L185 omatonBuilderFactory]: Interpolants [41600#(<= Main_x 45), 41601#(<= Main_x 46), 41602#(<= Main_x 47), 41603#(<= Main_x 48), 41604#(<= (+ Main_x 1) 0), 41553#true, 41554#false, 41555#(<= Main_x 0), 41556#(<= Main_x 1), 41557#(<= Main_x 2), 41558#(<= Main_x 3), 41559#(<= Main_x 4), 41560#(<= Main_x 5), 41561#(<= Main_x 6), 41562#(<= Main_x 7), 41563#(<= Main_x 8), 41564#(<= Main_x 9), 41565#(<= Main_x 10), 41566#(<= Main_x 11), 41567#(<= Main_x 12), 41568#(<= Main_x 13), 41569#(<= Main_x 14), 41570#(<= Main_x 15), 41571#(<= Main_x 16), 41572#(<= Main_x 17), 41573#(<= Main_x 18), 41574#(<= Main_x 19), 41575#(<= Main_x 20), 41576#(<= Main_x 21), 41577#(<= Main_x 22), 41578#(<= Main_x 23), 41579#(<= Main_x 24), 41580#(<= Main_x 25), 41581#(<= Main_x 26), 41582#(<= Main_x 27), 41583#(<= Main_x 28), 41584#(<= Main_x 29), 41585#(<= Main_x 30), 41586#(<= Main_x 31), 41587#(<= Main_x 32), 41588#(<= Main_x 33), 41589#(<= Main_x 34), 41590#(<= Main_x 35), 41591#(<= Main_x 36), 41592#(<= Main_x 37), 41593#(<= Main_x 38), 41594#(<= Main_x 39), 41595#(<= Main_x 40), 41596#(<= Main_x 41), 41597#(<= Main_x 42), 41598#(<= Main_x 43), 41599#(<= Main_x 44)] [2018-07-23 13:56:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:36,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:56:36,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:56:36,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:56:36,985 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 52 states. [2018-07-23 13:56:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:37,153 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-07-23 13:56:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:56:37,154 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-23 13:56:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:37,154 INFO L225 Difference]: With dead ends: 156 [2018-07-23 13:56:37,154 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 13:56:37,155 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:56:37,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 13:56:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 13:56:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 13:56:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-07-23 13:56:37,222 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 102 [2018-07-23 13:56:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:37,222 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-07-23 13:56:37,222 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:56:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-07-23 13:56:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 13:56:37,223 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:37,223 INFO L357 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-07-23 13:56:37,223 INFO L414 AbstractCegarLoop]: === Iteration 147 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1198720877, now seen corresponding path program 144 times [2018-07-23 13:56:37,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:37,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:37,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:56:37,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:37,327 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:56:37,327 INFO L185 omatonBuilderFactory]: Interpolants [42123#true, 42124#false, 42125#(<= 0 Main_x), 42126#(<= 1 Main_x), 42127#(<= 2 Main_x), 42128#(<= 3 Main_x), 42129#(<= 4 Main_x), 42130#(<= 5 Main_x), 42131#(<= 6 Main_x), 42132#(<= 7 Main_x), 42133#(<= 8 Main_x), 42134#(<= 9 Main_x), 42135#(<= 10 Main_x), 42136#(<= 11 Main_x), 42137#(<= 12 Main_x), 42138#(<= 13 Main_x), 42139#(<= 14 Main_x), 42140#(<= 15 Main_x), 42141#(<= 16 Main_x), 42142#(<= 17 Main_x), 42143#(<= 18 Main_x), 42144#(<= 19 Main_x), 42145#(<= 20 Main_x), 42146#(<= 21 Main_x), 42147#(<= 22 Main_x), 42148#(<= 23 Main_x), 42149#(<= 24 Main_x), 42150#(<= 25 Main_x), 42151#(<= 26 Main_x), 42152#(<= 27 Main_x), 42153#(<= 28 Main_x), 42154#(<= 29 Main_x), 42155#(<= 30 Main_x), 42156#(<= 31 Main_x), 42157#(<= 32 Main_x), 42158#(<= 33 Main_x), 42159#(<= 34 Main_x), 42160#(<= 35 Main_x), 42161#(<= 36 Main_x), 42162#(<= 37 Main_x), 42163#(<= 38 Main_x), 42164#(<= 39 Main_x), 42165#(<= 40 Main_x), 42166#(<= 41 Main_x), 42167#(<= 42 Main_x), 42168#(<= 43 Main_x), 42169#(<= 44 Main_x), 42170#(<= 45 Main_x), 42171#(<= 46 Main_x), 42172#(<= 47 Main_x), 42173#(<= 48 Main_x), 42174#(<= 49 Main_x)] [2018-07-23 13:56:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:37,327 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:56:37,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:56:37,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:56:37,328 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-07-23 13:56:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:37,399 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-07-23 13:56:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:56:37,399 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-23 13:56:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:37,400 INFO L225 Difference]: With dead ends: 107 [2018-07-23 13:56:37,400 INFO L226 Difference]: Without dead ends: 104 [2018-07-23 13:56:37,400 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:56:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-23 13:56:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-23 13:56:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-23 13:56:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-07-23 13:56:37,476 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2018-07-23 13:56:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:37,476 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-07-23 13:56:37,477 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:56:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-07-23 13:56:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-23 13:56:37,477 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:37,477 INFO L357 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1] [2018-07-23 13:56:37,477 INFO L414 AbstractCegarLoop]: === Iteration 148 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:37,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1494419999, now seen corresponding path program 145 times [2018-07-23 13:56:37,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:37,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:37,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:37,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:56:37,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:37,664 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:56:37,665 INFO L185 omatonBuilderFactory]: Interpolants [42624#(and (<= 25 Main_y) (<= Main_y 25)), 42625#(and (<= Main_y 26) (<= 26 Main_y)), 42626#(and (<= 27 Main_y) (<= Main_y 27)), 42627#(and (<= 28 Main_y) (<= Main_y 28)), 42628#(and (<= 29 Main_y) (<= Main_y 29)), 42629#(and (<= 30 Main_y) (<= Main_y 30)), 42630#(and (<= Main_y 31) (<= 31 Main_y)), 42631#(and (<= 32 Main_y) (<= Main_y 32)), 42632#(and (<= 33 Main_y) (<= Main_y 33)), 42633#(and (<= Main_y 34) (<= 34 Main_y)), 42634#(and (<= 35 Main_y) (<= Main_y 35)), 42635#(and (<= 36 Main_y) (<= Main_y 36)), 42636#(and (<= Main_y 37) (<= 37 Main_y)), 42637#(and (<= Main_y 38) (<= 38 Main_y)), 42638#(and (<= 39 Main_y) (<= Main_y 39)), 42639#(and (<= 40 Main_y) (<= Main_y 40)), 42640#(and (<= Main_y 41) (<= 41 Main_y)), 42641#(and (<= 42 Main_y) (<= Main_y 42)), 42642#(and (<= 43 Main_y) (<= Main_y 43)), 42643#(and (<= 44 Main_y) (<= Main_y 44)), 42644#(and (<= Main_y 45) (<= 45 Main_y)), 42645#(and (<= 46 Main_y) (<= Main_y 46)), 42646#(and (<= 47 Main_y) (<= Main_y 47)), 42647#(and (<= 48 Main_y) (<= Main_y 48)), 42648#(and (<= 49 Main_y) (<= Main_y 49)), 42597#true, 42598#false, 42599#(and (<= 0 Main_y) (<= Main_y 0)), 42600#(and (<= 1 Main_y) (<= Main_y 1)), 42601#(and (<= Main_y 2) (<= 2 Main_y)), 42602#(and (<= Main_y 3) (<= 3 Main_y)), 42603#(and (<= Main_y 4) (<= 4 Main_y)), 42604#(and (<= Main_y 5) (<= 5 Main_y)), 42605#(and (<= Main_y 6) (<= 6 Main_y)), 42606#(and (<= 7 Main_y) (<= Main_y 7)), 42607#(and (<= 8 Main_y) (<= Main_y 8)), 42608#(and (<= Main_y 9) (<= 9 Main_y)), 42609#(and (<= 10 Main_y) (<= Main_y 10)), 42610#(and (<= 11 Main_y) (<= Main_y 11)), 42611#(and (<= 12 Main_y) (<= Main_y 12)), 42612#(and (<= 13 Main_y) (<= Main_y 13)), 42613#(and (<= 14 Main_y) (<= Main_y 14)), 42614#(and (<= Main_y 15) (<= 15 Main_y)), 42615#(and (<= 16 Main_y) (<= Main_y 16)), 42616#(and (<= Main_y 17) (<= 17 Main_y)), 42617#(and (<= Main_y 18) (<= 18 Main_y)), 42618#(and (<= Main_y 19) (<= 19 Main_y)), 42619#(and (<= 20 Main_y) (<= Main_y 20)), 42620#(and (<= 21 Main_y) (<= Main_y 21)), 42621#(and (<= Main_y 22) (<= 22 Main_y)), 42622#(and (<= 23 Main_y) (<= Main_y 23)), 42623#(and (<= Main_y 24) (<= 24 Main_y))] [2018-07-23 13:56:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:37,665 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:56:37,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:56:37,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:56:37,666 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 52 states. [2018-07-23 13:56:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:38,048 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-07-23 13:56:38,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:56:38,048 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 103 [2018-07-23 13:56:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:38,049 INFO L225 Difference]: With dead ends: 158 [2018-07-23 13:56:38,049 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 13:56:38,049 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:56:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 13:56:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2018-07-23 13:56:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-23 13:56:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-07-23 13:56:38,106 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2018-07-23 13:56:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:38,107 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-07-23 13:56:38,107 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:56:38,107 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-07-23 13:56:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 13:56:38,107 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:38,107 INFO L357 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-07-23 13:56:38,108 INFO L414 AbstractCegarLoop]: === Iteration 149 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash 917558765, now seen corresponding path program 146 times [2018-07-23 13:56:38,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:38,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:38,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:56:38,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:38,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:56:38,210 INFO L185 omatonBuilderFactory]: Interpolants [43177#true, 43178#false, 43179#(<= Main_x 0), 43180#(<= Main_x 1), 43181#(<= Main_x 2), 43182#(<= Main_x 3), 43183#(<= Main_x 4), 43184#(<= Main_x 5), 43185#(<= Main_x 6), 43186#(<= Main_x 7), 43187#(<= Main_x 8), 43188#(<= Main_x 9), 43189#(<= Main_x 10), 43190#(<= Main_x 11), 43191#(<= Main_x 12), 43192#(<= Main_x 13), 43193#(<= Main_x 14), 43194#(<= Main_x 15), 43195#(<= Main_x 16), 43196#(<= Main_x 17), 43197#(<= Main_x 18), 43198#(<= Main_x 19), 43199#(<= Main_x 20), 43200#(<= Main_x 21), 43201#(<= Main_x 22), 43202#(<= Main_x 23), 43203#(<= Main_x 24), 43204#(<= Main_x 25), 43205#(<= Main_x 26), 43206#(<= Main_x 27), 43207#(<= Main_x 28), 43208#(<= Main_x 29), 43209#(<= Main_x 30), 43210#(<= Main_x 31), 43211#(<= Main_x 32), 43212#(<= Main_x 33), 43213#(<= Main_x 34), 43214#(<= Main_x 35), 43215#(<= Main_x 36), 43216#(<= Main_x 37), 43217#(<= Main_x 38), 43218#(<= Main_x 39), 43219#(<= Main_x 40), 43220#(<= Main_x 41), 43221#(<= Main_x 42), 43222#(<= Main_x 43), 43223#(<= Main_x 44), 43224#(<= Main_x 45), 43225#(<= Main_x 46), 43226#(<= Main_x 47), 43227#(<= Main_x 48), 43228#(<= Main_x 49), 43229#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:38,210 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:56:38,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:56:38,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:56:38,211 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 53 states. [2018-07-23 13:56:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:38,367 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2018-07-23 13:56:38,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:56:38,367 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-23 13:56:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:38,368 INFO L225 Difference]: With dead ends: 159 [2018-07-23 13:56:38,368 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 13:56:38,368 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:56:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 13:56:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 13:56:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 13:56:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-07-23 13:56:38,419 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2018-07-23 13:56:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:38,419 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-07-23 13:56:38,419 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:56:38,419 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-07-23 13:56:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 13:56:38,419 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:38,419 INFO L357 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-07-23 13:56:38,420 INFO L414 AbstractCegarLoop]: === Iteration 150 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:38,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1901667065, now seen corresponding path program 147 times [2018-07-23 13:56:38,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:38,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:38,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:56:38,532 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:38,533 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:56:38,533 INFO L185 omatonBuilderFactory]: Interpolants [43776#(<= 16 Main_x), 43777#(<= 17 Main_x), 43778#(<= 18 Main_x), 43779#(<= 19 Main_x), 43780#(<= 20 Main_x), 43781#(<= 21 Main_x), 43782#(<= 22 Main_x), 43783#(<= 23 Main_x), 43784#(<= 24 Main_x), 43785#(<= 25 Main_x), 43786#(<= 26 Main_x), 43787#(<= 27 Main_x), 43788#(<= 28 Main_x), 43789#(<= 29 Main_x), 43790#(<= 30 Main_x), 43791#(<= 31 Main_x), 43792#(<= 32 Main_x), 43793#(<= 33 Main_x), 43794#(<= 34 Main_x), 43795#(<= 35 Main_x), 43796#(<= 36 Main_x), 43797#(<= 37 Main_x), 43798#(<= 38 Main_x), 43799#(<= 39 Main_x), 43800#(<= 40 Main_x), 43801#(<= 41 Main_x), 43802#(<= 42 Main_x), 43803#(<= 43 Main_x), 43804#(<= 44 Main_x), 43805#(<= 45 Main_x), 43806#(<= 46 Main_x), 43807#(<= 47 Main_x), 43808#(<= 48 Main_x), 43809#(<= 49 Main_x), 43810#(<= 50 Main_x), 43758#true, 43759#false, 43760#(<= 0 Main_x), 43761#(<= 1 Main_x), 43762#(<= 2 Main_x), 43763#(<= 3 Main_x), 43764#(<= 4 Main_x), 43765#(<= 5 Main_x), 43766#(<= 6 Main_x), 43767#(<= 7 Main_x), 43768#(<= 8 Main_x), 43769#(<= 9 Main_x), 43770#(<= 10 Main_x), 43771#(<= 11 Main_x), 43772#(<= 12 Main_x), 43773#(<= 13 Main_x), 43774#(<= 14 Main_x), 43775#(<= 15 Main_x)] [2018-07-23 13:56:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:38,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:56:38,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:56:38,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:56:38,534 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-07-23 13:56:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:38,611 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-07-23 13:56:38,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:56:38,612 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-23 13:56:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:38,612 INFO L225 Difference]: With dead ends: 109 [2018-07-23 13:56:38,612 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 13:56:38,613 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:56:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 13:56:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-23 13:56:38,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-23 13:56:38,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-07-23 13:56:38,672 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-07-23 13:56:38,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:38,672 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-07-23 13:56:38,672 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:56:38,672 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-07-23 13:56:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-23 13:56:38,672 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:38,673 INFO L357 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1] [2018-07-23 13:56:38,673 INFO L414 AbstractCegarLoop]: === Iteration 151 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1177801607, now seen corresponding path program 148 times [2018-07-23 13:56:38,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:38,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:38,867 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:56:38,868 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:38,868 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:56:38,868 INFO L185 omatonBuilderFactory]: Interpolants [44288#(and (<= Main_y 45) (<= 45 Main_y)), 44289#(and (<= 46 Main_y) (<= Main_y 46)), 44290#(and (<= 47 Main_y) (<= Main_y 47)), 44291#(and (<= 48 Main_y) (<= Main_y 48)), 44292#(and (<= 49 Main_y) (<= Main_y 49)), 44293#(and (<= 50 Main_y) (<= Main_y 50)), 44241#true, 44242#false, 44243#(and (<= 0 Main_y) (<= Main_y 0)), 44244#(and (<= 1 Main_y) (<= Main_y 1)), 44245#(and (<= Main_y 2) (<= 2 Main_y)), 44246#(and (<= Main_y 3) (<= 3 Main_y)), 44247#(and (<= Main_y 4) (<= 4 Main_y)), 44248#(and (<= Main_y 5) (<= 5 Main_y)), 44249#(and (<= Main_y 6) (<= 6 Main_y)), 44250#(and (<= 7 Main_y) (<= Main_y 7)), 44251#(and (<= 8 Main_y) (<= Main_y 8)), 44252#(and (<= Main_y 9) (<= 9 Main_y)), 44253#(and (<= 10 Main_y) (<= Main_y 10)), 44254#(and (<= 11 Main_y) (<= Main_y 11)), 44255#(and (<= 12 Main_y) (<= Main_y 12)), 44256#(and (<= 13 Main_y) (<= Main_y 13)), 44257#(and (<= 14 Main_y) (<= Main_y 14)), 44258#(and (<= Main_y 15) (<= 15 Main_y)), 44259#(and (<= 16 Main_y) (<= Main_y 16)), 44260#(and (<= Main_y 17) (<= 17 Main_y)), 44261#(and (<= Main_y 18) (<= 18 Main_y)), 44262#(and (<= Main_y 19) (<= 19 Main_y)), 44263#(and (<= 20 Main_y) (<= Main_y 20)), 44264#(and (<= 21 Main_y) (<= Main_y 21)), 44265#(and (<= Main_y 22) (<= 22 Main_y)), 44266#(and (<= 23 Main_y) (<= Main_y 23)), 44267#(and (<= Main_y 24) (<= 24 Main_y)), 44268#(and (<= 25 Main_y) (<= Main_y 25)), 44269#(and (<= Main_y 26) (<= 26 Main_y)), 44270#(and (<= 27 Main_y) (<= Main_y 27)), 44271#(and (<= 28 Main_y) (<= Main_y 28)), 44272#(and (<= 29 Main_y) (<= Main_y 29)), 44273#(and (<= 30 Main_y) (<= Main_y 30)), 44274#(and (<= Main_y 31) (<= 31 Main_y)), 44275#(and (<= 32 Main_y) (<= Main_y 32)), 44276#(and (<= 33 Main_y) (<= Main_y 33)), 44277#(and (<= Main_y 34) (<= 34 Main_y)), 44278#(and (<= 35 Main_y) (<= Main_y 35)), 44279#(and (<= 36 Main_y) (<= Main_y 36)), 44280#(and (<= Main_y 37) (<= 37 Main_y)), 44281#(and (<= Main_y 38) (<= 38 Main_y)), 44282#(and (<= 39 Main_y) (<= Main_y 39)), 44283#(and (<= 40 Main_y) (<= Main_y 40)), 44284#(and (<= Main_y 41) (<= 41 Main_y)), 44285#(and (<= 42 Main_y) (<= Main_y 42)), 44286#(and (<= 43 Main_y) (<= Main_y 43)), 44287#(and (<= 44 Main_y) (<= Main_y 44))] [2018-07-23 13:56:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:38,869 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:56:38,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:56:38,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:56:38,869 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 53 states. [2018-07-23 13:56:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:39,359 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-07-23 13:56:39,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:56:39,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 105 [2018-07-23 13:56:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:39,360 INFO L225 Difference]: With dead ends: 161 [2018-07-23 13:56:39,360 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 13:56:39,360 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:56:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 13:56:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2018-07-23 13:56:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-23 13:56:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-07-23 13:56:39,415 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2018-07-23 13:56:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:39,415 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-07-23 13:56:39,415 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:56:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-07-23 13:56:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 13:56:39,415 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:39,415 INFO L357 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-07-23 13:56:39,415 INFO L414 AbstractCegarLoop]: === Iteration 152 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2142917369, now seen corresponding path program 149 times [2018-07-23 13:56:39,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:39,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:39,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:56:39,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:39,506 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:56:39,506 INFO L185 omatonBuilderFactory]: Interpolants [44832#true, 44833#false, 44834#(<= Main_x 0), 44835#(<= Main_x 1), 44836#(<= Main_x 2), 44837#(<= Main_x 3), 44838#(<= Main_x 4), 44839#(<= Main_x 5), 44840#(<= Main_x 6), 44841#(<= Main_x 7), 44842#(<= Main_x 8), 44843#(<= Main_x 9), 44844#(<= Main_x 10), 44845#(<= Main_x 11), 44846#(<= Main_x 12), 44847#(<= Main_x 13), 44848#(<= Main_x 14), 44849#(<= Main_x 15), 44850#(<= Main_x 16), 44851#(<= Main_x 17), 44852#(<= Main_x 18), 44853#(<= Main_x 19), 44854#(<= Main_x 20), 44855#(<= Main_x 21), 44856#(<= Main_x 22), 44857#(<= Main_x 23), 44858#(<= Main_x 24), 44859#(<= Main_x 25), 44860#(<= Main_x 26), 44861#(<= Main_x 27), 44862#(<= Main_x 28), 44863#(<= Main_x 29), 44864#(<= Main_x 30), 44865#(<= Main_x 31), 44866#(<= Main_x 32), 44867#(<= Main_x 33), 44868#(<= Main_x 34), 44869#(<= Main_x 35), 44870#(<= Main_x 36), 44871#(<= Main_x 37), 44872#(<= Main_x 38), 44873#(<= Main_x 39), 44874#(<= Main_x 40), 44875#(<= Main_x 41), 44876#(<= Main_x 42), 44877#(<= Main_x 43), 44878#(<= Main_x 44), 44879#(<= Main_x 45), 44880#(<= Main_x 46), 44881#(<= Main_x 47), 44882#(<= Main_x 48), 44883#(<= Main_x 49), 44884#(<= Main_x 50), 44885#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:39,507 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:56:39,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:56:39,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:56:39,507 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 54 states. [2018-07-23 13:56:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:39,669 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-07-23 13:56:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:56:39,669 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-23 13:56:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:39,670 INFO L225 Difference]: With dead ends: 162 [2018-07-23 13:56:39,670 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 13:56:39,670 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:56:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 13:56:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-23 13:56:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-23 13:56:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-07-23 13:56:39,719 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 106 [2018-07-23 13:56:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:39,719 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-07-23 13:56:39,720 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:56:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-07-23 13:56:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 13:56:39,720 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:39,720 INFO L357 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-07-23 13:56:39,720 INFO L414 AbstractCegarLoop]: === Iteration 153 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash 655395117, now seen corresponding path program 150 times [2018-07-23 13:56:39,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:39,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:39,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:56:39,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:39,821 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:56:39,821 INFO L185 omatonBuilderFactory]: Interpolants [45440#(<= 14 Main_x), 45441#(<= 15 Main_x), 45442#(<= 16 Main_x), 45443#(<= 17 Main_x), 45444#(<= 18 Main_x), 45445#(<= 19 Main_x), 45446#(<= 20 Main_x), 45447#(<= 21 Main_x), 45448#(<= 22 Main_x), 45449#(<= 23 Main_x), 45450#(<= 24 Main_x), 45451#(<= 25 Main_x), 45452#(<= 26 Main_x), 45453#(<= 27 Main_x), 45454#(<= 28 Main_x), 45455#(<= 29 Main_x), 45456#(<= 30 Main_x), 45457#(<= 31 Main_x), 45458#(<= 32 Main_x), 45459#(<= 33 Main_x), 45460#(<= 34 Main_x), 45461#(<= 35 Main_x), 45462#(<= 36 Main_x), 45463#(<= 37 Main_x), 45464#(<= 38 Main_x), 45465#(<= 39 Main_x), 45466#(<= 40 Main_x), 45467#(<= 41 Main_x), 45468#(<= 42 Main_x), 45469#(<= 43 Main_x), 45470#(<= 44 Main_x), 45471#(<= 45 Main_x), 45472#(<= 46 Main_x), 45473#(<= 47 Main_x), 45474#(<= 48 Main_x), 45475#(<= 49 Main_x), 45476#(<= 50 Main_x), 45477#(<= 51 Main_x), 45424#true, 45425#false, 45426#(<= 0 Main_x), 45427#(<= 1 Main_x), 45428#(<= 2 Main_x), 45429#(<= 3 Main_x), 45430#(<= 4 Main_x), 45431#(<= 5 Main_x), 45432#(<= 6 Main_x), 45433#(<= 7 Main_x), 45434#(<= 8 Main_x), 45435#(<= 9 Main_x), 45436#(<= 10 Main_x), 45437#(<= 11 Main_x), 45438#(<= 12 Main_x), 45439#(<= 13 Main_x)] [2018-07-23 13:56:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:39,821 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:56:39,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:56:39,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:56:39,822 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-07-23 13:56:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:39,888 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-07-23 13:56:39,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:56:39,888 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-23 13:56:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:39,889 INFO L225 Difference]: With dead ends: 111 [2018-07-23 13:56:39,889 INFO L226 Difference]: Without dead ends: 108 [2018-07-23 13:56:39,889 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:56:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-23 13:56:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-23 13:56:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-23 13:56:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-07-23 13:56:39,946 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2018-07-23 13:56:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:39,946 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-07-23 13:56:39,946 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:56:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-07-23 13:56:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-23 13:56:39,947 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:39,947 INFO L357 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1] [2018-07-23 13:56:39,947 INFO L414 AbstractCegarLoop]: === Iteration 154 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:39,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1157649375, now seen corresponding path program 151 times [2018-07-23 13:56:39,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:40,105 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:40,105 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:56:40,105 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:40,105 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:56:40,106 INFO L185 omatonBuilderFactory]: Interpolants [45952#(and (<= Main_y 34) (<= 34 Main_y)), 45953#(and (<= 35 Main_y) (<= Main_y 35)), 45954#(and (<= 36 Main_y) (<= Main_y 36)), 45955#(and (<= Main_y 37) (<= 37 Main_y)), 45956#(and (<= Main_y 38) (<= 38 Main_y)), 45957#(and (<= 39 Main_y) (<= Main_y 39)), 45958#(and (<= 40 Main_y) (<= Main_y 40)), 45959#(and (<= Main_y 41) (<= 41 Main_y)), 45960#(and (<= 42 Main_y) (<= Main_y 42)), 45961#(and (<= 43 Main_y) (<= Main_y 43)), 45962#(and (<= 44 Main_y) (<= Main_y 44)), 45963#(and (<= Main_y 45) (<= 45 Main_y)), 45964#(and (<= 46 Main_y) (<= Main_y 46)), 45965#(and (<= 47 Main_y) (<= Main_y 47)), 45966#(and (<= 48 Main_y) (<= Main_y 48)), 45967#(and (<= 49 Main_y) (<= Main_y 49)), 45968#(and (<= 50 Main_y) (<= Main_y 50)), 45969#(and (<= 51 Main_y) (<= Main_y 51)), 45916#true, 45917#false, 45918#(and (<= 0 Main_y) (<= Main_y 0)), 45919#(and (<= 1 Main_y) (<= Main_y 1)), 45920#(and (<= Main_y 2) (<= 2 Main_y)), 45921#(and (<= Main_y 3) (<= 3 Main_y)), 45922#(and (<= Main_y 4) (<= 4 Main_y)), 45923#(and (<= Main_y 5) (<= 5 Main_y)), 45924#(and (<= Main_y 6) (<= 6 Main_y)), 45925#(and (<= 7 Main_y) (<= Main_y 7)), 45926#(and (<= 8 Main_y) (<= Main_y 8)), 45927#(and (<= Main_y 9) (<= 9 Main_y)), 45928#(and (<= 10 Main_y) (<= Main_y 10)), 45929#(and (<= 11 Main_y) (<= Main_y 11)), 45930#(and (<= 12 Main_y) (<= Main_y 12)), 45931#(and (<= 13 Main_y) (<= Main_y 13)), 45932#(and (<= 14 Main_y) (<= Main_y 14)), 45933#(and (<= Main_y 15) (<= 15 Main_y)), 45934#(and (<= 16 Main_y) (<= Main_y 16)), 45935#(and (<= Main_y 17) (<= 17 Main_y)), 45936#(and (<= Main_y 18) (<= 18 Main_y)), 45937#(and (<= Main_y 19) (<= 19 Main_y)), 45938#(and (<= 20 Main_y) (<= Main_y 20)), 45939#(and (<= 21 Main_y) (<= Main_y 21)), 45940#(and (<= Main_y 22) (<= 22 Main_y)), 45941#(and (<= 23 Main_y) (<= Main_y 23)), 45942#(and (<= Main_y 24) (<= 24 Main_y)), 45943#(and (<= 25 Main_y) (<= Main_y 25)), 45944#(and (<= Main_y 26) (<= 26 Main_y)), 45945#(and (<= 27 Main_y) (<= Main_y 27)), 45946#(and (<= 28 Main_y) (<= Main_y 28)), 45947#(and (<= 29 Main_y) (<= Main_y 29)), 45948#(and (<= 30 Main_y) (<= Main_y 30)), 45949#(and (<= Main_y 31) (<= 31 Main_y)), 45950#(and (<= 32 Main_y) (<= Main_y 32)), 45951#(and (<= 33 Main_y) (<= Main_y 33))] [2018-07-23 13:56:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:40,106 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:56:40,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:56:40,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:56:40,106 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 54 states. [2018-07-23 13:56:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:40,469 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-07-23 13:56:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:56:40,469 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2018-07-23 13:56:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:40,469 INFO L225 Difference]: With dead ends: 164 [2018-07-23 13:56:40,470 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 13:56:40,470 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:56:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 13:56:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2018-07-23 13:56:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-23 13:56:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-07-23 13:56:40,526 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2018-07-23 13:56:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:40,527 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-07-23 13:56:40,527 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:56:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-07-23 13:56:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 13:56:40,527 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:40,527 INFO L357 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-07-23 13:56:40,527 INFO L414 AbstractCegarLoop]: === Iteration 155 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1527453779, now seen corresponding path program 152 times [2018-07-23 13:56:40,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:40,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:40,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:56:40,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:40,624 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:56:40,624 INFO L185 omatonBuilderFactory]: Interpolants [46518#true, 46519#false, 46520#(<= Main_x 0), 46521#(<= Main_x 1), 46522#(<= Main_x 2), 46523#(<= Main_x 3), 46524#(<= Main_x 4), 46525#(<= Main_x 5), 46526#(<= Main_x 6), 46527#(<= Main_x 7), 46528#(<= Main_x 8), 46529#(<= Main_x 9), 46530#(<= Main_x 10), 46531#(<= Main_x 11), 46532#(<= Main_x 12), 46533#(<= Main_x 13), 46534#(<= Main_x 14), 46535#(<= Main_x 15), 46536#(<= Main_x 16), 46537#(<= Main_x 17), 46538#(<= Main_x 18), 46539#(<= Main_x 19), 46540#(<= Main_x 20), 46541#(<= Main_x 21), 46542#(<= Main_x 22), 46543#(<= Main_x 23), 46544#(<= Main_x 24), 46545#(<= Main_x 25), 46546#(<= Main_x 26), 46547#(<= Main_x 27), 46548#(<= Main_x 28), 46549#(<= Main_x 29), 46550#(<= Main_x 30), 46551#(<= Main_x 31), 46552#(<= Main_x 32), 46553#(<= Main_x 33), 46554#(<= Main_x 34), 46555#(<= Main_x 35), 46556#(<= Main_x 36), 46557#(<= Main_x 37), 46558#(<= Main_x 38), 46559#(<= Main_x 39), 46560#(<= Main_x 40), 46561#(<= Main_x 41), 46562#(<= Main_x 42), 46563#(<= Main_x 43), 46564#(<= Main_x 44), 46565#(<= Main_x 45), 46566#(<= Main_x 46), 46567#(<= Main_x 47), 46568#(<= Main_x 48), 46569#(<= Main_x 49), 46570#(<= Main_x 50), 46571#(<= Main_x 51), 46572#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:40,625 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:56:40,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:56:40,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:56:40,625 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 55 states. [2018-07-23 13:56:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:40,811 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2018-07-23 13:56:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:56:40,811 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-23 13:56:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:40,812 INFO L225 Difference]: With dead ends: 165 [2018-07-23 13:56:40,812 INFO L226 Difference]: Without dead ends: 109 [2018-07-23 13:56:40,813 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:56:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-23 13:56:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-23 13:56:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 13:56:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-07-23 13:56:40,871 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 108 [2018-07-23 13:56:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-07-23 13:56:40,872 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:56:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-07-23 13:56:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 13:56:40,872 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:40,872 INFO L357 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-07-23 13:56:40,872 INFO L414 AbstractCegarLoop]: === Iteration 156 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash -679112633, now seen corresponding path program 153 times [2018-07-23 13:56:40,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:40,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:40,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:56:40,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:40,985 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:56:40,986 INFO L185 omatonBuilderFactory]: Interpolants [47121#true, 47122#false, 47123#(<= 0 Main_x), 47124#(<= 1 Main_x), 47125#(<= 2 Main_x), 47126#(<= 3 Main_x), 47127#(<= 4 Main_x), 47128#(<= 5 Main_x), 47129#(<= 6 Main_x), 47130#(<= 7 Main_x), 47131#(<= 8 Main_x), 47132#(<= 9 Main_x), 47133#(<= 10 Main_x), 47134#(<= 11 Main_x), 47135#(<= 12 Main_x), 47136#(<= 13 Main_x), 47137#(<= 14 Main_x), 47138#(<= 15 Main_x), 47139#(<= 16 Main_x), 47140#(<= 17 Main_x), 47141#(<= 18 Main_x), 47142#(<= 19 Main_x), 47143#(<= 20 Main_x), 47144#(<= 21 Main_x), 47145#(<= 22 Main_x), 47146#(<= 23 Main_x), 47147#(<= 24 Main_x), 47148#(<= 25 Main_x), 47149#(<= 26 Main_x), 47150#(<= 27 Main_x), 47151#(<= 28 Main_x), 47152#(<= 29 Main_x), 47153#(<= 30 Main_x), 47154#(<= 31 Main_x), 47155#(<= 32 Main_x), 47156#(<= 33 Main_x), 47157#(<= 34 Main_x), 47158#(<= 35 Main_x), 47159#(<= 36 Main_x), 47160#(<= 37 Main_x), 47161#(<= 38 Main_x), 47162#(<= 39 Main_x), 47163#(<= 40 Main_x), 47164#(<= 41 Main_x), 47165#(<= 42 Main_x), 47166#(<= 43 Main_x), 47167#(<= 44 Main_x), 47168#(<= 45 Main_x), 47169#(<= 46 Main_x), 47170#(<= 47 Main_x), 47171#(<= 48 Main_x), 47172#(<= 49 Main_x), 47173#(<= 50 Main_x), 47174#(<= 51 Main_x), 47175#(<= 52 Main_x)] [2018-07-23 13:56:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:40,986 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:56:40,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:56:40,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:56:40,986 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-07-23 13:56:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:41,055 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-07-23 13:56:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:56:41,055 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-23 13:56:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:41,055 INFO L225 Difference]: With dead ends: 113 [2018-07-23 13:56:41,055 INFO L226 Difference]: Without dead ends: 110 [2018-07-23 13:56:41,056 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:56:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-23 13:56:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-23 13:56:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-23 13:56:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-07-23 13:56:41,136 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 108 [2018-07-23 13:56:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:41,136 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-07-23 13:56:41,136 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:56:41,136 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-07-23 13:56:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-23 13:56:41,137 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:41,137 INFO L357 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1] [2018-07-23 13:56:41,137 INFO L414 AbstractCegarLoop]: === Iteration 157 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 422283335, now seen corresponding path program 154 times [2018-07-23 13:56:41,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:41,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:41,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:56:41,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:41,327 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:56:41,327 INFO L185 omatonBuilderFactory]: Interpolants [47622#true, 47623#false, 47624#(and (<= 0 Main_y) (<= Main_y 0)), 47625#(and (<= 1 Main_y) (<= Main_y 1)), 47626#(and (<= Main_y 2) (<= 2 Main_y)), 47627#(and (<= Main_y 3) (<= 3 Main_y)), 47628#(and (<= Main_y 4) (<= 4 Main_y)), 47629#(and (<= Main_y 5) (<= 5 Main_y)), 47630#(and (<= Main_y 6) (<= 6 Main_y)), 47631#(and (<= 7 Main_y) (<= Main_y 7)), 47632#(and (<= 8 Main_y) (<= Main_y 8)), 47633#(and (<= Main_y 9) (<= 9 Main_y)), 47634#(and (<= 10 Main_y) (<= Main_y 10)), 47635#(and (<= 11 Main_y) (<= Main_y 11)), 47636#(and (<= 12 Main_y) (<= Main_y 12)), 47637#(and (<= 13 Main_y) (<= Main_y 13)), 47638#(and (<= 14 Main_y) (<= Main_y 14)), 47639#(and (<= Main_y 15) (<= 15 Main_y)), 47640#(and (<= 16 Main_y) (<= Main_y 16)), 47641#(and (<= Main_y 17) (<= 17 Main_y)), 47642#(and (<= Main_y 18) (<= 18 Main_y)), 47643#(and (<= Main_y 19) (<= 19 Main_y)), 47644#(and (<= 20 Main_y) (<= Main_y 20)), 47645#(and (<= 21 Main_y) (<= Main_y 21)), 47646#(and (<= Main_y 22) (<= 22 Main_y)), 47647#(and (<= 23 Main_y) (<= Main_y 23)), 47648#(and (<= Main_y 24) (<= 24 Main_y)), 47649#(and (<= 25 Main_y) (<= Main_y 25)), 47650#(and (<= Main_y 26) (<= 26 Main_y)), 47651#(and (<= 27 Main_y) (<= Main_y 27)), 47652#(and (<= 28 Main_y) (<= Main_y 28)), 47653#(and (<= 29 Main_y) (<= Main_y 29)), 47654#(and (<= 30 Main_y) (<= Main_y 30)), 47655#(and (<= Main_y 31) (<= 31 Main_y)), 47656#(and (<= 32 Main_y) (<= Main_y 32)), 47657#(and (<= 33 Main_y) (<= Main_y 33)), 47658#(and (<= Main_y 34) (<= 34 Main_y)), 47659#(and (<= 35 Main_y) (<= Main_y 35)), 47660#(and (<= 36 Main_y) (<= Main_y 36)), 47661#(and (<= Main_y 37) (<= 37 Main_y)), 47662#(and (<= Main_y 38) (<= 38 Main_y)), 47663#(and (<= 39 Main_y) (<= Main_y 39)), 47664#(and (<= 40 Main_y) (<= Main_y 40)), 47665#(and (<= Main_y 41) (<= 41 Main_y)), 47666#(and (<= 42 Main_y) (<= Main_y 42)), 47667#(and (<= 43 Main_y) (<= Main_y 43)), 47668#(and (<= 44 Main_y) (<= Main_y 44)), 47669#(and (<= Main_y 45) (<= 45 Main_y)), 47670#(and (<= 46 Main_y) (<= Main_y 46)), 47671#(and (<= 47 Main_y) (<= Main_y 47)), 47672#(and (<= 48 Main_y) (<= Main_y 48)), 47673#(and (<= 49 Main_y) (<= Main_y 49)), 47674#(and (<= 50 Main_y) (<= Main_y 50)), 47675#(and (<= 51 Main_y) (<= Main_y 51)), 47676#(and (<= 52 Main_y) (<= Main_y 52))] [2018-07-23 13:56:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:41,327 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:56:41,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:56:41,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:56:41,328 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 55 states. [2018-07-23 13:56:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:41,749 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-07-23 13:56:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:56:41,750 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 109 [2018-07-23 13:56:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:41,750 INFO L225 Difference]: With dead ends: 167 [2018-07-23 13:56:41,750 INFO L226 Difference]: Without dead ends: 164 [2018-07-23 13:56:41,750 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:56:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-23 13:56:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2018-07-23 13:56:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-23 13:56:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-07-23 13:56:41,815 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2018-07-23 13:56:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:41,815 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-07-23 13:56:41,815 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:56:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-07-23 13:56:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-23 13:56:41,815 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:41,816 INFO L357 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-07-23 13:56:41,816 INFO L414 AbstractCegarLoop]: === Iteration 158 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash 205819975, now seen corresponding path program 155 times [2018-07-23 13:56:41,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:41,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:41,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:56:41,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:41,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:56:41,962 INFO L185 omatonBuilderFactory]: Interpolants [48256#(<= Main_x 19), 48257#(<= Main_x 20), 48258#(<= Main_x 21), 48259#(<= Main_x 22), 48260#(<= Main_x 23), 48261#(<= Main_x 24), 48262#(<= Main_x 25), 48263#(<= Main_x 26), 48264#(<= Main_x 27), 48265#(<= Main_x 28), 48266#(<= Main_x 29), 48267#(<= Main_x 30), 48268#(<= Main_x 31), 48269#(<= Main_x 32), 48270#(<= Main_x 33), 48271#(<= Main_x 34), 48272#(<= Main_x 35), 48273#(<= Main_x 36), 48274#(<= Main_x 37), 48275#(<= Main_x 38), 48276#(<= Main_x 39), 48277#(<= Main_x 40), 48278#(<= Main_x 41), 48279#(<= Main_x 42), 48280#(<= Main_x 43), 48281#(<= Main_x 44), 48282#(<= Main_x 45), 48283#(<= Main_x 46), 48284#(<= Main_x 47), 48285#(<= Main_x 48), 48286#(<= Main_x 49), 48287#(<= Main_x 50), 48288#(<= Main_x 51), 48289#(<= Main_x 52), 48290#(<= (+ Main_x 1) 0), 48235#true, 48236#false, 48237#(<= Main_x 0), 48238#(<= Main_x 1), 48239#(<= Main_x 2), 48240#(<= Main_x 3), 48241#(<= Main_x 4), 48242#(<= Main_x 5), 48243#(<= Main_x 6), 48244#(<= Main_x 7), 48245#(<= Main_x 8), 48246#(<= Main_x 9), 48247#(<= Main_x 10), 48248#(<= Main_x 11), 48249#(<= Main_x 12), 48250#(<= Main_x 13), 48251#(<= Main_x 14), 48252#(<= Main_x 15), 48253#(<= Main_x 16), 48254#(<= Main_x 17), 48255#(<= Main_x 18)] [2018-07-23 13:56:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:41,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:56:41,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:56:41,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:56:41,963 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 56 states. [2018-07-23 13:56:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:42,134 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-07-23 13:56:42,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:56:42,135 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-23 13:56:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:42,135 INFO L225 Difference]: With dead ends: 168 [2018-07-23 13:56:42,135 INFO L226 Difference]: Without dead ends: 111 [2018-07-23 13:56:42,136 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:56:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-23 13:56:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-23 13:56:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-23 13:56:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-07-23 13:56:42,223 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 110 [2018-07-23 13:56:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:42,223 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-07-23 13:56:42,223 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:56:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-07-23 13:56:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-23 13:56:42,224 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:42,224 INFO L357 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-07-23 13:56:42,224 INFO L414 AbstractCegarLoop]: === Iteration 159 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash 734591725, now seen corresponding path program 156 times [2018-07-23 13:56:42,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:42,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:42,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:56:42,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:42,403 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:56:42,403 INFO L185 omatonBuilderFactory]: Interpolants [48896#(<= 45 Main_x), 48897#(<= 46 Main_x), 48898#(<= 47 Main_x), 48899#(<= 48 Main_x), 48900#(<= 49 Main_x), 48901#(<= 50 Main_x), 48902#(<= 51 Main_x), 48903#(<= 52 Main_x), 48904#(<= 53 Main_x), 48849#true, 48850#false, 48851#(<= 0 Main_x), 48852#(<= 1 Main_x), 48853#(<= 2 Main_x), 48854#(<= 3 Main_x), 48855#(<= 4 Main_x), 48856#(<= 5 Main_x), 48857#(<= 6 Main_x), 48858#(<= 7 Main_x), 48859#(<= 8 Main_x), 48860#(<= 9 Main_x), 48861#(<= 10 Main_x), 48862#(<= 11 Main_x), 48863#(<= 12 Main_x), 48864#(<= 13 Main_x), 48865#(<= 14 Main_x), 48866#(<= 15 Main_x), 48867#(<= 16 Main_x), 48868#(<= 17 Main_x), 48869#(<= 18 Main_x), 48870#(<= 19 Main_x), 48871#(<= 20 Main_x), 48872#(<= 21 Main_x), 48873#(<= 22 Main_x), 48874#(<= 23 Main_x), 48875#(<= 24 Main_x), 48876#(<= 25 Main_x), 48877#(<= 26 Main_x), 48878#(<= 27 Main_x), 48879#(<= 28 Main_x), 48880#(<= 29 Main_x), 48881#(<= 30 Main_x), 48882#(<= 31 Main_x), 48883#(<= 32 Main_x), 48884#(<= 33 Main_x), 48885#(<= 34 Main_x), 48886#(<= 35 Main_x), 48887#(<= 36 Main_x), 48888#(<= 37 Main_x), 48889#(<= 38 Main_x), 48890#(<= 39 Main_x), 48891#(<= 40 Main_x), 48892#(<= 41 Main_x), 48893#(<= 42 Main_x), 48894#(<= 43 Main_x), 48895#(<= 44 Main_x)] [2018-07-23 13:56:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:42,404 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:56:42,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:56:42,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:56:42,405 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-07-23 13:56:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:42,533 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-07-23 13:56:42,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:56:42,533 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-23 13:56:42,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:42,533 INFO L225 Difference]: With dead ends: 115 [2018-07-23 13:56:42,533 INFO L226 Difference]: Without dead ends: 112 [2018-07-23 13:56:42,534 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:56:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-23 13:56:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-23 13:56:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-23 13:56:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-07-23 13:56:42,621 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-07-23 13:56:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:42,621 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-07-23 13:56:42,621 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:56:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-07-23 13:56:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-23 13:56:42,622 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:42,622 INFO L357 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1] [2018-07-23 13:56:42,622 INFO L414 AbstractCegarLoop]: === Iteration 160 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1297445473, now seen corresponding path program 157 times [2018-07-23 13:56:42,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:42,821 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:42,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:56:42,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:42,821 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:56:42,821 INFO L185 omatonBuilderFactory]: Interpolants [49408#(and (<= 47 Main_y) (<= Main_y 47)), 49409#(and (<= 48 Main_y) (<= Main_y 48)), 49410#(and (<= 49 Main_y) (<= Main_y 49)), 49411#(and (<= 50 Main_y) (<= Main_y 50)), 49412#(and (<= 51 Main_y) (<= Main_y 51)), 49413#(and (<= 52 Main_y) (<= Main_y 52)), 49414#(and (<= 53 Main_y) (<= Main_y 53)), 49359#true, 49360#false, 49361#(and (<= 0 Main_y) (<= Main_y 0)), 49362#(and (<= 1 Main_y) (<= Main_y 1)), 49363#(and (<= Main_y 2) (<= 2 Main_y)), 49364#(and (<= Main_y 3) (<= 3 Main_y)), 49365#(and (<= Main_y 4) (<= 4 Main_y)), 49366#(and (<= Main_y 5) (<= 5 Main_y)), 49367#(and (<= Main_y 6) (<= 6 Main_y)), 49368#(and (<= 7 Main_y) (<= Main_y 7)), 49369#(and (<= 8 Main_y) (<= Main_y 8)), 49370#(and (<= Main_y 9) (<= 9 Main_y)), 49371#(and (<= 10 Main_y) (<= Main_y 10)), 49372#(and (<= 11 Main_y) (<= Main_y 11)), 49373#(and (<= 12 Main_y) (<= Main_y 12)), 49374#(and (<= 13 Main_y) (<= Main_y 13)), 49375#(and (<= 14 Main_y) (<= Main_y 14)), 49376#(and (<= Main_y 15) (<= 15 Main_y)), 49377#(and (<= 16 Main_y) (<= Main_y 16)), 49378#(and (<= Main_y 17) (<= 17 Main_y)), 49379#(and (<= Main_y 18) (<= 18 Main_y)), 49380#(and (<= Main_y 19) (<= 19 Main_y)), 49381#(and (<= 20 Main_y) (<= Main_y 20)), 49382#(and (<= 21 Main_y) (<= Main_y 21)), 49383#(and (<= Main_y 22) (<= 22 Main_y)), 49384#(and (<= 23 Main_y) (<= Main_y 23)), 49385#(and (<= Main_y 24) (<= 24 Main_y)), 49386#(and (<= 25 Main_y) (<= Main_y 25)), 49387#(and (<= Main_y 26) (<= 26 Main_y)), 49388#(and (<= 27 Main_y) (<= Main_y 27)), 49389#(and (<= 28 Main_y) (<= Main_y 28)), 49390#(and (<= 29 Main_y) (<= Main_y 29)), 49391#(and (<= 30 Main_y) (<= Main_y 30)), 49392#(and (<= Main_y 31) (<= 31 Main_y)), 49393#(and (<= 32 Main_y) (<= Main_y 32)), 49394#(and (<= 33 Main_y) (<= Main_y 33)), 49395#(and (<= Main_y 34) (<= 34 Main_y)), 49396#(and (<= 35 Main_y) (<= Main_y 35)), 49397#(and (<= 36 Main_y) (<= Main_y 36)), 49398#(and (<= Main_y 37) (<= 37 Main_y)), 49399#(and (<= Main_y 38) (<= 38 Main_y)), 49400#(and (<= 39 Main_y) (<= Main_y 39)), 49401#(and (<= 40 Main_y) (<= Main_y 40)), 49402#(and (<= Main_y 41) (<= 41 Main_y)), 49403#(and (<= 42 Main_y) (<= Main_y 42)), 49404#(and (<= 43 Main_y) (<= Main_y 43)), 49405#(and (<= 44 Main_y) (<= Main_y 44)), 49406#(and (<= Main_y 45) (<= 45 Main_y)), 49407#(and (<= 46 Main_y) (<= Main_y 46))] [2018-07-23 13:56:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:42,822 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:56:42,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:56:42,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:56:42,823 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 56 states. [2018-07-23 13:56:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:43,257 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2018-07-23 13:56:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:56:43,257 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2018-07-23 13:56:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:43,257 INFO L225 Difference]: With dead ends: 170 [2018-07-23 13:56:43,258 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 13:56:43,258 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:56:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 13:56:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2018-07-23 13:56:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-23 13:56:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-07-23 13:56:43,325 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2018-07-23 13:56:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:43,325 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-07-23 13:56:43,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:56:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-07-23 13:56:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 13:56:43,325 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:43,326 INFO L357 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-07-23 13:56:43,326 INFO L414 AbstractCegarLoop]: === Iteration 161 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1566042477, now seen corresponding path program 158 times [2018-07-23 13:56:43,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:43,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:43,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:56:43,450 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:43,450 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:56:43,451 INFO L185 omatonBuilderFactory]: Interpolants [49983#true, 49984#false, 49985#(<= Main_x 0), 49986#(<= Main_x 1), 49987#(<= Main_x 2), 49988#(<= Main_x 3), 49989#(<= Main_x 4), 49990#(<= Main_x 5), 49991#(<= Main_x 6), 49992#(<= Main_x 7), 49993#(<= Main_x 8), 49994#(<= Main_x 9), 49995#(<= Main_x 10), 49996#(<= Main_x 11), 49997#(<= Main_x 12), 49998#(<= Main_x 13), 49999#(<= Main_x 14), 50000#(<= Main_x 15), 50001#(<= Main_x 16), 50002#(<= Main_x 17), 50003#(<= Main_x 18), 50004#(<= Main_x 19), 50005#(<= Main_x 20), 50006#(<= Main_x 21), 50007#(<= Main_x 22), 50008#(<= Main_x 23), 50009#(<= Main_x 24), 50010#(<= Main_x 25), 50011#(<= Main_x 26), 50012#(<= Main_x 27), 50013#(<= Main_x 28), 50014#(<= Main_x 29), 50015#(<= Main_x 30), 50016#(<= Main_x 31), 50017#(<= Main_x 32), 50018#(<= Main_x 33), 50019#(<= Main_x 34), 50020#(<= Main_x 35), 50021#(<= Main_x 36), 50022#(<= Main_x 37), 50023#(<= Main_x 38), 50024#(<= Main_x 39), 50025#(<= Main_x 40), 50026#(<= Main_x 41), 50027#(<= Main_x 42), 50028#(<= Main_x 43), 50029#(<= Main_x 44), 50030#(<= Main_x 45), 50031#(<= Main_x 46), 50032#(<= Main_x 47), 50033#(<= Main_x 48), 50034#(<= Main_x 49), 50035#(<= Main_x 50), 50036#(<= Main_x 51), 50037#(<= Main_x 52), 50038#(<= Main_x 53), 50039#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:43,451 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:56:43,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:56:43,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:56:43,452 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 57 states. [2018-07-23 13:56:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:43,666 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-07-23 13:56:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:56:43,666 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-23 13:56:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:43,667 INFO L225 Difference]: With dead ends: 171 [2018-07-23 13:56:43,667 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 13:56:43,667 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:56:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 13:56:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-23 13:56:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 13:56:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-07-23 13:56:43,727 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 112 [2018-07-23 13:56:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:43,727 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-07-23 13:56:43,727 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:56:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-07-23 13:56:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 13:56:43,727 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:43,728 INFO L357 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-07-23 13:56:43,728 INFO L414 AbstractCegarLoop]: === Iteration 162 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash 778097543, now seen corresponding path program 159 times [2018-07-23 13:56:43,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:43,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:43,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:56:43,899 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:43,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:56:43,899 INFO L185 omatonBuilderFactory]: Interpolants [50608#true, 50609#false, 50610#(<= 0 Main_x), 50611#(<= 1 Main_x), 50612#(<= 2 Main_x), 50613#(<= 3 Main_x), 50614#(<= 4 Main_x), 50615#(<= 5 Main_x), 50616#(<= 6 Main_x), 50617#(<= 7 Main_x), 50618#(<= 8 Main_x), 50619#(<= 9 Main_x), 50620#(<= 10 Main_x), 50621#(<= 11 Main_x), 50622#(<= 12 Main_x), 50623#(<= 13 Main_x), 50624#(<= 14 Main_x), 50625#(<= 15 Main_x), 50626#(<= 16 Main_x), 50627#(<= 17 Main_x), 50628#(<= 18 Main_x), 50629#(<= 19 Main_x), 50630#(<= 20 Main_x), 50631#(<= 21 Main_x), 50632#(<= 22 Main_x), 50633#(<= 23 Main_x), 50634#(<= 24 Main_x), 50635#(<= 25 Main_x), 50636#(<= 26 Main_x), 50637#(<= 27 Main_x), 50638#(<= 28 Main_x), 50639#(<= 29 Main_x), 50640#(<= 30 Main_x), 50641#(<= 31 Main_x), 50642#(<= 32 Main_x), 50643#(<= 33 Main_x), 50644#(<= 34 Main_x), 50645#(<= 35 Main_x), 50646#(<= 36 Main_x), 50647#(<= 37 Main_x), 50648#(<= 38 Main_x), 50649#(<= 39 Main_x), 50650#(<= 40 Main_x), 50651#(<= 41 Main_x), 50652#(<= 42 Main_x), 50653#(<= 43 Main_x), 50654#(<= 44 Main_x), 50655#(<= 45 Main_x), 50656#(<= 46 Main_x), 50657#(<= 47 Main_x), 50658#(<= 48 Main_x), 50659#(<= 49 Main_x), 50660#(<= 50 Main_x), 50661#(<= 51 Main_x), 50662#(<= 52 Main_x), 50663#(<= 53 Main_x), 50664#(<= 54 Main_x)] [2018-07-23 13:56:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:43,900 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:56:43,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:56:43,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:56:43,900 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-07-23 13:56:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:44,002 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-07-23 13:56:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:56:44,002 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-23 13:56:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:44,003 INFO L225 Difference]: With dead ends: 117 [2018-07-23 13:56:44,003 INFO L226 Difference]: Without dead ends: 114 [2018-07-23 13:56:44,003 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:56:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-23 13:56:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-23 13:56:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-23 13:56:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-07-23 13:56:44,059 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 112 [2018-07-23 13:56:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:44,060 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-07-23 13:56:44,060 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:56:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-07-23 13:56:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-23 13:56:44,060 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:44,060 INFO L357 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1] [2018-07-23 13:56:44,060 INFO L414 AbstractCegarLoop]: === Iteration 163 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1648841465, now seen corresponding path program 160 times [2018-07-23 13:56:44,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:44,255 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:44,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:56:44,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:44,255 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:56:44,255 INFO L185 omatonBuilderFactory]: Interpolants [51127#true, 51128#false, 51129#(and (<= 0 Main_y) (<= Main_y 0)), 51130#(and (<= 1 Main_y) (<= Main_y 1)), 51131#(and (<= Main_y 2) (<= 2 Main_y)), 51132#(and (<= Main_y 3) (<= 3 Main_y)), 51133#(and (<= Main_y 4) (<= 4 Main_y)), 51134#(and (<= Main_y 5) (<= 5 Main_y)), 51135#(and (<= Main_y 6) (<= 6 Main_y)), 51136#(and (<= 7 Main_y) (<= Main_y 7)), 51137#(and (<= 8 Main_y) (<= Main_y 8)), 51138#(and (<= Main_y 9) (<= 9 Main_y)), 51139#(and (<= 10 Main_y) (<= Main_y 10)), 51140#(and (<= 11 Main_y) (<= Main_y 11)), 51141#(and (<= 12 Main_y) (<= Main_y 12)), 51142#(and (<= 13 Main_y) (<= Main_y 13)), 51143#(and (<= 14 Main_y) (<= Main_y 14)), 51144#(and (<= Main_y 15) (<= 15 Main_y)), 51145#(and (<= 16 Main_y) (<= Main_y 16)), 51146#(and (<= Main_y 17) (<= 17 Main_y)), 51147#(and (<= Main_y 18) (<= 18 Main_y)), 51148#(and (<= Main_y 19) (<= 19 Main_y)), 51149#(and (<= 20 Main_y) (<= Main_y 20)), 51150#(and (<= 21 Main_y) (<= Main_y 21)), 51151#(and (<= Main_y 22) (<= 22 Main_y)), 51152#(and (<= 23 Main_y) (<= Main_y 23)), 51153#(and (<= Main_y 24) (<= 24 Main_y)), 51154#(and (<= 25 Main_y) (<= Main_y 25)), 51155#(and (<= Main_y 26) (<= 26 Main_y)), 51156#(and (<= 27 Main_y) (<= Main_y 27)), 51157#(and (<= 28 Main_y) (<= Main_y 28)), 51158#(and (<= 29 Main_y) (<= Main_y 29)), 51159#(and (<= 30 Main_y) (<= Main_y 30)), 51160#(and (<= Main_y 31) (<= 31 Main_y)), 51161#(and (<= 32 Main_y) (<= Main_y 32)), 51162#(and (<= 33 Main_y) (<= Main_y 33)), 51163#(and (<= Main_y 34) (<= 34 Main_y)), 51164#(and (<= 35 Main_y) (<= Main_y 35)), 51165#(and (<= 36 Main_y) (<= Main_y 36)), 51166#(and (<= Main_y 37) (<= 37 Main_y)), 51167#(and (<= Main_y 38) (<= 38 Main_y)), 51168#(and (<= 39 Main_y) (<= Main_y 39)), 51169#(and (<= 40 Main_y) (<= Main_y 40)), 51170#(and (<= Main_y 41) (<= 41 Main_y)), 51171#(and (<= 42 Main_y) (<= Main_y 42)), 51172#(and (<= 43 Main_y) (<= Main_y 43)), 51173#(and (<= 44 Main_y) (<= Main_y 44)), 51174#(and (<= Main_y 45) (<= 45 Main_y)), 51175#(and (<= 46 Main_y) (<= Main_y 46)), 51176#(and (<= 47 Main_y) (<= Main_y 47)), 51177#(and (<= 48 Main_y) (<= Main_y 48)), 51178#(and (<= 49 Main_y) (<= Main_y 49)), 51179#(and (<= 50 Main_y) (<= Main_y 50)), 51180#(and (<= 51 Main_y) (<= Main_y 51)), 51181#(and (<= 52 Main_y) (<= Main_y 52)), 51182#(and (<= 53 Main_y) (<= Main_y 53)), 51183#(and (<= 54 Main_y) (<= Main_y 54))] [2018-07-23 13:56:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:44,256 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:56:44,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:56:44,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:56:44,256 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 57 states. [2018-07-23 13:56:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:44,745 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-07-23 13:56:44,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:56:44,745 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 113 [2018-07-23 13:56:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:44,746 INFO L225 Difference]: With dead ends: 173 [2018-07-23 13:56:44,746 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 13:56:44,746 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:56:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 13:56:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2018-07-23 13:56:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-23 13:56:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-07-23 13:56:44,819 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 113 [2018-07-23 13:56:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:44,820 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-07-23 13:56:44,820 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:56:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-07-23 13:56:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-23 13:56:44,820 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:44,820 INFO L357 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-07-23 13:56:44,820 INFO L414 AbstractCegarLoop]: === Iteration 164 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 425460615, now seen corresponding path program 161 times [2018-07-23 13:56:44,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:44,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:44,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:56:44,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:44,981 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:56:44,981 INFO L185 omatonBuilderFactory]: Interpolants [51762#true, 51763#false, 51764#(<= Main_x 0), 51765#(<= Main_x 1), 51766#(<= Main_x 2), 51767#(<= Main_x 3), 51768#(<= Main_x 4), 51769#(<= Main_x 5), 51770#(<= Main_x 6), 51771#(<= Main_x 7), 51772#(<= Main_x 8), 51773#(<= Main_x 9), 51774#(<= Main_x 10), 51775#(<= Main_x 11), 51776#(<= Main_x 12), 51777#(<= Main_x 13), 51778#(<= Main_x 14), 51779#(<= Main_x 15), 51780#(<= Main_x 16), 51781#(<= Main_x 17), 51782#(<= Main_x 18), 51783#(<= Main_x 19), 51784#(<= Main_x 20), 51785#(<= Main_x 21), 51786#(<= Main_x 22), 51787#(<= Main_x 23), 51788#(<= Main_x 24), 51789#(<= Main_x 25), 51790#(<= Main_x 26), 51791#(<= Main_x 27), 51792#(<= Main_x 28), 51793#(<= Main_x 29), 51794#(<= Main_x 30), 51795#(<= Main_x 31), 51796#(<= Main_x 32), 51797#(<= Main_x 33), 51798#(<= Main_x 34), 51799#(<= Main_x 35), 51800#(<= Main_x 36), 51801#(<= Main_x 37), 51802#(<= Main_x 38), 51803#(<= Main_x 39), 51804#(<= Main_x 40), 51805#(<= Main_x 41), 51806#(<= Main_x 42), 51807#(<= Main_x 43), 51808#(<= Main_x 44), 51809#(<= Main_x 45), 51810#(<= Main_x 46), 51811#(<= Main_x 47), 51812#(<= Main_x 48), 51813#(<= Main_x 49), 51814#(<= Main_x 50), 51815#(<= Main_x 51), 51816#(<= Main_x 52), 51817#(<= Main_x 53), 51818#(<= Main_x 54), 51819#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:44,982 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:56:44,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:56:44,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:56:44,982 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 58 states. [2018-07-23 13:56:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:45,246 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2018-07-23 13:56:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:56:45,246 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-23 13:56:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:45,247 INFO L225 Difference]: With dead ends: 174 [2018-07-23 13:56:45,247 INFO L226 Difference]: Without dead ends: 115 [2018-07-23 13:56:45,247 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:56:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-23 13:56:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-23 13:56:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-23 13:56:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-07-23 13:56:45,313 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 114 [2018-07-23 13:56:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:45,313 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-07-23 13:56:45,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:56:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-07-23 13:56:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-23 13:56:45,313 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:45,313 INFO L357 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-07-23 13:56:45,314 INFO L414 AbstractCegarLoop]: === Iteration 165 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:45,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1768971437, now seen corresponding path program 162 times [2018-07-23 13:56:45,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:45,426 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:45,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:56:45,426 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:45,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:56:45,426 INFO L185 omatonBuilderFactory]: Interpolants [52398#true, 52399#false, 52400#(<= 0 Main_x), 52401#(<= 1 Main_x), 52402#(<= 2 Main_x), 52403#(<= 3 Main_x), 52404#(<= 4 Main_x), 52405#(<= 5 Main_x), 52406#(<= 6 Main_x), 52407#(<= 7 Main_x), 52408#(<= 8 Main_x), 52409#(<= 9 Main_x), 52410#(<= 10 Main_x), 52411#(<= 11 Main_x), 52412#(<= 12 Main_x), 52413#(<= 13 Main_x), 52414#(<= 14 Main_x), 52415#(<= 15 Main_x), 52416#(<= 16 Main_x), 52417#(<= 17 Main_x), 52418#(<= 18 Main_x), 52419#(<= 19 Main_x), 52420#(<= 20 Main_x), 52421#(<= 21 Main_x), 52422#(<= 22 Main_x), 52423#(<= 23 Main_x), 52424#(<= 24 Main_x), 52425#(<= 25 Main_x), 52426#(<= 26 Main_x), 52427#(<= 27 Main_x), 52428#(<= 28 Main_x), 52429#(<= 29 Main_x), 52430#(<= 30 Main_x), 52431#(<= 31 Main_x), 52432#(<= 32 Main_x), 52433#(<= 33 Main_x), 52434#(<= 34 Main_x), 52435#(<= 35 Main_x), 52436#(<= 36 Main_x), 52437#(<= 37 Main_x), 52438#(<= 38 Main_x), 52439#(<= 39 Main_x), 52440#(<= 40 Main_x), 52441#(<= 41 Main_x), 52442#(<= 42 Main_x), 52443#(<= 43 Main_x), 52444#(<= 44 Main_x), 52445#(<= 45 Main_x), 52446#(<= 46 Main_x), 52447#(<= 47 Main_x), 52448#(<= 48 Main_x), 52449#(<= 49 Main_x), 52450#(<= 50 Main_x), 52451#(<= 51 Main_x), 52452#(<= 52 Main_x), 52453#(<= 53 Main_x), 52454#(<= 54 Main_x), 52455#(<= 55 Main_x)] [2018-07-23 13:56:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:45,426 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:56:45,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:56:45,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:56:45,427 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-07-23 13:56:45,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:45,501 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-07-23 13:56:45,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:56:45,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-23 13:56:45,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:45,502 INFO L225 Difference]: With dead ends: 119 [2018-07-23 13:56:45,502 INFO L226 Difference]: Without dead ends: 116 [2018-07-23 13:56:45,503 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:56:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-23 13:56:45,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-23 13:56:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-23 13:56:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-07-23 13:56:45,562 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 114 [2018-07-23 13:56:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:45,562 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-07-23 13:56:45,562 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:56:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-07-23 13:56:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-23 13:56:45,562 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:45,563 INFO L357 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1] [2018-07-23 13:56:45,563 INFO L414 AbstractCegarLoop]: === Iteration 166 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -996521823, now seen corresponding path program 163 times [2018-07-23 13:56:45,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:45,737 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:45,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:56:45,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:45,738 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:56:45,738 INFO L185 omatonBuilderFactory]: Interpolants [52926#true, 52927#false, 52928#(and (<= 0 Main_y) (<= Main_y 0)), 52929#(and (<= 1 Main_y) (<= Main_y 1)), 52930#(and (<= Main_y 2) (<= 2 Main_y)), 52931#(and (<= Main_y 3) (<= 3 Main_y)), 52932#(and (<= Main_y 4) (<= 4 Main_y)), 52933#(and (<= Main_y 5) (<= 5 Main_y)), 52934#(and (<= Main_y 6) (<= 6 Main_y)), 52935#(and (<= 7 Main_y) (<= Main_y 7)), 52936#(and (<= 8 Main_y) (<= Main_y 8)), 52937#(and (<= Main_y 9) (<= 9 Main_y)), 52938#(and (<= 10 Main_y) (<= Main_y 10)), 52939#(and (<= 11 Main_y) (<= Main_y 11)), 52940#(and (<= 12 Main_y) (<= Main_y 12)), 52941#(and (<= 13 Main_y) (<= Main_y 13)), 52942#(and (<= 14 Main_y) (<= Main_y 14)), 52943#(and (<= Main_y 15) (<= 15 Main_y)), 52944#(and (<= 16 Main_y) (<= Main_y 16)), 52945#(and (<= Main_y 17) (<= 17 Main_y)), 52946#(and (<= Main_y 18) (<= 18 Main_y)), 52947#(and (<= Main_y 19) (<= 19 Main_y)), 52948#(and (<= 20 Main_y) (<= Main_y 20)), 52949#(and (<= 21 Main_y) (<= Main_y 21)), 52950#(and (<= Main_y 22) (<= 22 Main_y)), 52951#(and (<= 23 Main_y) (<= Main_y 23)), 52952#(and (<= Main_y 24) (<= 24 Main_y)), 52953#(and (<= 25 Main_y) (<= Main_y 25)), 52954#(and (<= Main_y 26) (<= 26 Main_y)), 52955#(and (<= 27 Main_y) (<= Main_y 27)), 52956#(and (<= 28 Main_y) (<= Main_y 28)), 52957#(and (<= 29 Main_y) (<= Main_y 29)), 52958#(and (<= 30 Main_y) (<= Main_y 30)), 52959#(and (<= Main_y 31) (<= 31 Main_y)), 52960#(and (<= 32 Main_y) (<= Main_y 32)), 52961#(and (<= 33 Main_y) (<= Main_y 33)), 52962#(and (<= Main_y 34) (<= 34 Main_y)), 52963#(and (<= 35 Main_y) (<= Main_y 35)), 52964#(and (<= 36 Main_y) (<= Main_y 36)), 52965#(and (<= Main_y 37) (<= 37 Main_y)), 52966#(and (<= Main_y 38) (<= 38 Main_y)), 52967#(and (<= 39 Main_y) (<= Main_y 39)), 52968#(and (<= 40 Main_y) (<= Main_y 40)), 52969#(and (<= Main_y 41) (<= 41 Main_y)), 52970#(and (<= 42 Main_y) (<= Main_y 42)), 52971#(and (<= 43 Main_y) (<= Main_y 43)), 52972#(and (<= 44 Main_y) (<= Main_y 44)), 52973#(and (<= Main_y 45) (<= 45 Main_y)), 52974#(and (<= 46 Main_y) (<= Main_y 46)), 52975#(and (<= 47 Main_y) (<= Main_y 47)), 52976#(and (<= 48 Main_y) (<= Main_y 48)), 52977#(and (<= 49 Main_y) (<= Main_y 49)), 52978#(and (<= 50 Main_y) (<= Main_y 50)), 52979#(and (<= 51 Main_y) (<= Main_y 51)), 52980#(and (<= 52 Main_y) (<= Main_y 52)), 52981#(and (<= 53 Main_y) (<= Main_y 53)), 52982#(and (<= 54 Main_y) (<= Main_y 54)), 52983#(and (<= 55 Main_y) (<= Main_y 55))] [2018-07-23 13:56:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:45,738 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:56:45,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:56:45,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:56:45,739 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 58 states. [2018-07-23 13:56:46,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:46,158 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-07-23 13:56:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:56:46,158 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 115 [2018-07-23 13:56:46,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:46,159 INFO L225 Difference]: With dead ends: 176 [2018-07-23 13:56:46,159 INFO L226 Difference]: Without dead ends: 173 [2018-07-23 13:56:46,159 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:56:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-23 13:56:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2018-07-23 13:56:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-23 13:56:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-07-23 13:56:46,224 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 115 [2018-07-23 13:56:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:46,224 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-07-23 13:56:46,224 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:56:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-07-23 13:56:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 13:56:46,224 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:46,225 INFO L357 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-07-23 13:56:46,225 INFO L414 AbstractCegarLoop]: === Iteration 167 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash -827466963, now seen corresponding path program 164 times [2018-07-23 13:56:46,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:46,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:46,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:56:46,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:46,335 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:56:46,335 INFO L185 omatonBuilderFactory]: Interpolants [53572#true, 53573#false, 53574#(<= Main_x 0), 53575#(<= Main_x 1), 53576#(<= Main_x 2), 53577#(<= Main_x 3), 53578#(<= Main_x 4), 53579#(<= Main_x 5), 53580#(<= Main_x 6), 53581#(<= Main_x 7), 53582#(<= Main_x 8), 53583#(<= Main_x 9), 53584#(<= Main_x 10), 53585#(<= Main_x 11), 53586#(<= Main_x 12), 53587#(<= Main_x 13), 53588#(<= Main_x 14), 53589#(<= Main_x 15), 53590#(<= Main_x 16), 53591#(<= Main_x 17), 53592#(<= Main_x 18), 53593#(<= Main_x 19), 53594#(<= Main_x 20), 53595#(<= Main_x 21), 53596#(<= Main_x 22), 53597#(<= Main_x 23), 53598#(<= Main_x 24), 53599#(<= Main_x 25), 53600#(<= Main_x 26), 53601#(<= Main_x 27), 53602#(<= Main_x 28), 53603#(<= Main_x 29), 53604#(<= Main_x 30), 53605#(<= Main_x 31), 53606#(<= Main_x 32), 53607#(<= Main_x 33), 53608#(<= Main_x 34), 53609#(<= Main_x 35), 53610#(<= Main_x 36), 53611#(<= Main_x 37), 53612#(<= Main_x 38), 53613#(<= Main_x 39), 53614#(<= Main_x 40), 53615#(<= Main_x 41), 53616#(<= Main_x 42), 53617#(<= Main_x 43), 53618#(<= Main_x 44), 53619#(<= Main_x 45), 53620#(<= Main_x 46), 53621#(<= Main_x 47), 53622#(<= Main_x 48), 53623#(<= Main_x 49), 53624#(<= Main_x 50), 53625#(<= Main_x 51), 53626#(<= Main_x 52), 53627#(<= Main_x 53), 53628#(<= Main_x 54), 53629#(<= Main_x 55), 53630#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:46,335 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:56:46,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:56:46,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:56:46,336 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 59 states. [2018-07-23 13:56:46,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:46,539 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-07-23 13:56:46,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:56:46,540 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-23 13:56:46,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:46,540 INFO L225 Difference]: With dead ends: 177 [2018-07-23 13:56:46,540 INFO L226 Difference]: Without dead ends: 117 [2018-07-23 13:56:46,540 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:56:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-23 13:56:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-23 13:56:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 13:56:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-07-23 13:56:46,599 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 116 [2018-07-23 13:56:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:46,600 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-07-23 13:56:46,600 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:56:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-07-23 13:56:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 13:56:46,600 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:46,600 INFO L357 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-07-23 13:56:46,600 INFO L414 AbstractCegarLoop]: === Iteration 168 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:46,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2128304441, now seen corresponding path program 165 times [2018-07-23 13:56:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:46,717 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:46,717 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:56:46,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:46,718 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:56:46,718 INFO L185 omatonBuilderFactory]: Interpolants [54272#(<= 51 Main_x), 54273#(<= 52 Main_x), 54274#(<= 53 Main_x), 54275#(<= 54 Main_x), 54276#(<= 55 Main_x), 54277#(<= 56 Main_x), 54219#true, 54220#false, 54221#(<= 0 Main_x), 54222#(<= 1 Main_x), 54223#(<= 2 Main_x), 54224#(<= 3 Main_x), 54225#(<= 4 Main_x), 54226#(<= 5 Main_x), 54227#(<= 6 Main_x), 54228#(<= 7 Main_x), 54229#(<= 8 Main_x), 54230#(<= 9 Main_x), 54231#(<= 10 Main_x), 54232#(<= 11 Main_x), 54233#(<= 12 Main_x), 54234#(<= 13 Main_x), 54235#(<= 14 Main_x), 54236#(<= 15 Main_x), 54237#(<= 16 Main_x), 54238#(<= 17 Main_x), 54239#(<= 18 Main_x), 54240#(<= 19 Main_x), 54241#(<= 20 Main_x), 54242#(<= 21 Main_x), 54243#(<= 22 Main_x), 54244#(<= 23 Main_x), 54245#(<= 24 Main_x), 54246#(<= 25 Main_x), 54247#(<= 26 Main_x), 54248#(<= 27 Main_x), 54249#(<= 28 Main_x), 54250#(<= 29 Main_x), 54251#(<= 30 Main_x), 54252#(<= 31 Main_x), 54253#(<= 32 Main_x), 54254#(<= 33 Main_x), 54255#(<= 34 Main_x), 54256#(<= 35 Main_x), 54257#(<= 36 Main_x), 54258#(<= 37 Main_x), 54259#(<= 38 Main_x), 54260#(<= 39 Main_x), 54261#(<= 40 Main_x), 54262#(<= 41 Main_x), 54263#(<= 42 Main_x), 54264#(<= 43 Main_x), 54265#(<= 44 Main_x), 54266#(<= 45 Main_x), 54267#(<= 46 Main_x), 54268#(<= 47 Main_x), 54269#(<= 48 Main_x), 54270#(<= 49 Main_x), 54271#(<= 50 Main_x)] [2018-07-23 13:56:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:46,718 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:56:46,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:56:46,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:56:46,719 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-07-23 13:56:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:46,798 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-07-23 13:56:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:56:46,798 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-23 13:56:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:46,799 INFO L225 Difference]: With dead ends: 121 [2018-07-23 13:56:46,799 INFO L226 Difference]: Without dead ends: 118 [2018-07-23 13:56:46,799 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:56:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-23 13:56:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-23 13:56:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-23 13:56:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-07-23 13:56:46,859 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-07-23 13:56:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:46,859 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-07-23 13:56:46,859 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:56:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-07-23 13:56:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-23 13:56:46,859 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:46,860 INFO L357 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1] [2018-07-23 13:56:46,860 INFO L414 AbstractCegarLoop]: === Iteration 169 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1552989753, now seen corresponding path program 166 times [2018-07-23 13:56:46,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:47,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:47,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:56:47,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:47,063 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:56:47,063 INFO L185 omatonBuilderFactory]: Interpolants [54784#(and (<= Main_y 26) (<= 26 Main_y)), 54785#(and (<= 27 Main_y) (<= Main_y 27)), 54786#(and (<= 28 Main_y) (<= Main_y 28)), 54787#(and (<= 29 Main_y) (<= Main_y 29)), 54788#(and (<= 30 Main_y) (<= Main_y 30)), 54789#(and (<= Main_y 31) (<= 31 Main_y)), 54790#(and (<= 32 Main_y) (<= Main_y 32)), 54791#(and (<= 33 Main_y) (<= Main_y 33)), 54792#(and (<= Main_y 34) (<= 34 Main_y)), 54793#(and (<= 35 Main_y) (<= Main_y 35)), 54794#(and (<= 36 Main_y) (<= Main_y 36)), 54795#(and (<= Main_y 37) (<= 37 Main_y)), 54796#(and (<= Main_y 38) (<= 38 Main_y)), 54797#(and (<= 39 Main_y) (<= Main_y 39)), 54798#(and (<= 40 Main_y) (<= Main_y 40)), 54799#(and (<= Main_y 41) (<= 41 Main_y)), 54800#(and (<= 42 Main_y) (<= Main_y 42)), 54801#(and (<= 43 Main_y) (<= Main_y 43)), 54802#(and (<= 44 Main_y) (<= Main_y 44)), 54803#(and (<= Main_y 45) (<= 45 Main_y)), 54804#(and (<= 46 Main_y) (<= Main_y 46)), 54805#(and (<= 47 Main_y) (<= Main_y 47)), 54806#(and (<= 48 Main_y) (<= Main_y 48)), 54807#(and (<= 49 Main_y) (<= Main_y 49)), 54808#(and (<= 50 Main_y) (<= Main_y 50)), 54809#(and (<= 51 Main_y) (<= Main_y 51)), 54810#(and (<= 52 Main_y) (<= Main_y 52)), 54811#(and (<= 53 Main_y) (<= Main_y 53)), 54812#(and (<= 54 Main_y) (<= Main_y 54)), 54813#(and (<= 55 Main_y) (<= Main_y 55)), 54814#(and (<= Main_y 56) (<= 56 Main_y)), 54756#true, 54757#false, 54758#(and (<= 0 Main_y) (<= Main_y 0)), 54759#(and (<= 1 Main_y) (<= Main_y 1)), 54760#(and (<= Main_y 2) (<= 2 Main_y)), 54761#(and (<= Main_y 3) (<= 3 Main_y)), 54762#(and (<= Main_y 4) (<= 4 Main_y)), 54763#(and (<= Main_y 5) (<= 5 Main_y)), 54764#(and (<= Main_y 6) (<= 6 Main_y)), 54765#(and (<= 7 Main_y) (<= Main_y 7)), 54766#(and (<= 8 Main_y) (<= Main_y 8)), 54767#(and (<= Main_y 9) (<= 9 Main_y)), 54768#(and (<= 10 Main_y) (<= Main_y 10)), 54769#(and (<= 11 Main_y) (<= Main_y 11)), 54770#(and (<= 12 Main_y) (<= Main_y 12)), 54771#(and (<= 13 Main_y) (<= Main_y 13)), 54772#(and (<= 14 Main_y) (<= Main_y 14)), 54773#(and (<= Main_y 15) (<= 15 Main_y)), 54774#(and (<= 16 Main_y) (<= Main_y 16)), 54775#(and (<= Main_y 17) (<= 17 Main_y)), 54776#(and (<= Main_y 18) (<= 18 Main_y)), 54777#(and (<= Main_y 19) (<= 19 Main_y)), 54778#(and (<= 20 Main_y) (<= Main_y 20)), 54779#(and (<= 21 Main_y) (<= Main_y 21)), 54780#(and (<= Main_y 22) (<= 22 Main_y)), 54781#(and (<= 23 Main_y) (<= Main_y 23)), 54782#(and (<= Main_y 24) (<= 24 Main_y)), 54783#(and (<= 25 Main_y) (<= Main_y 25))] [2018-07-23 13:56:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:47,064 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:56:47,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:56:47,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:56:47,064 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 59 states. [2018-07-23 13:56:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:47,499 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-07-23 13:56:47,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:56:47,499 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 117 [2018-07-23 13:56:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:47,499 INFO L225 Difference]: With dead ends: 179 [2018-07-23 13:56:47,499 INFO L226 Difference]: Without dead ends: 176 [2018-07-23 13:56:47,500 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:56:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-23 13:56:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 120. [2018-07-23 13:56:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-23 13:56:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-07-23 13:56:47,565 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 117 [2018-07-23 13:56:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:47,565 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-07-23 13:56:47,565 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:56:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-07-23 13:56:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 13:56:47,565 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:47,565 INFO L357 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-07-23 13:56:47,565 INFO L414 AbstractCegarLoop]: === Iteration 170 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -898103609, now seen corresponding path program 167 times [2018-07-23 13:56:47,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:47,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:47,680 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:56:47,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:47,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:56:47,680 INFO L185 omatonBuilderFactory]: Interpolants [55424#(<= Main_x 9), 55425#(<= Main_x 10), 55426#(<= Main_x 11), 55427#(<= Main_x 12), 55428#(<= Main_x 13), 55429#(<= Main_x 14), 55430#(<= Main_x 15), 55431#(<= Main_x 16), 55432#(<= Main_x 17), 55433#(<= Main_x 18), 55434#(<= Main_x 19), 55435#(<= Main_x 20), 55436#(<= Main_x 21), 55437#(<= Main_x 22), 55438#(<= Main_x 23), 55439#(<= Main_x 24), 55440#(<= Main_x 25), 55441#(<= Main_x 26), 55442#(<= Main_x 27), 55443#(<= Main_x 28), 55444#(<= Main_x 29), 55445#(<= Main_x 30), 55446#(<= Main_x 31), 55447#(<= Main_x 32), 55448#(<= Main_x 33), 55449#(<= Main_x 34), 55450#(<= Main_x 35), 55451#(<= Main_x 36), 55452#(<= Main_x 37), 55453#(<= Main_x 38), 55454#(<= Main_x 39), 55455#(<= Main_x 40), 55456#(<= Main_x 41), 55457#(<= Main_x 42), 55458#(<= Main_x 43), 55459#(<= Main_x 44), 55460#(<= Main_x 45), 55461#(<= Main_x 46), 55462#(<= Main_x 47), 55463#(<= Main_x 48), 55464#(<= Main_x 49), 55465#(<= Main_x 50), 55466#(<= Main_x 51), 55467#(<= Main_x 52), 55468#(<= Main_x 53), 55469#(<= Main_x 54), 55470#(<= Main_x 55), 55471#(<= Main_x 56), 55472#(<= (+ Main_x 1) 0), 55413#true, 55414#false, 55415#(<= Main_x 0), 55416#(<= Main_x 1), 55417#(<= Main_x 2), 55418#(<= Main_x 3), 55419#(<= Main_x 4), 55420#(<= Main_x 5), 55421#(<= Main_x 6), 55422#(<= Main_x 7), 55423#(<= Main_x 8)] [2018-07-23 13:56:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:47,681 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:56:47,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:56:47,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:56:47,681 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 60 states. [2018-07-23 13:56:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:47,899 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2018-07-23 13:56:47,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:56:47,899 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-23 13:56:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:47,900 INFO L225 Difference]: With dead ends: 180 [2018-07-23 13:56:47,900 INFO L226 Difference]: Without dead ends: 119 [2018-07-23 13:56:47,900 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:56:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-23 13:56:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-23 13:56:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 13:56:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-07-23 13:56:47,964 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 118 [2018-07-23 13:56:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:47,964 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-07-23 13:56:47,964 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:56:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-07-23 13:56:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 13:56:47,965 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:47,965 INFO L357 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-07-23 13:56:47,965 INFO L414 AbstractCegarLoop]: === Iteration 171 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1725607533, now seen corresponding path program 168 times [2018-07-23 13:56:47,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:48,088 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:48,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:56:48,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:48,089 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:56:48,089 INFO L185 omatonBuilderFactory]: Interpolants [56071#true, 56072#false, 56073#(<= 0 Main_x), 56074#(<= 1 Main_x), 56075#(<= 2 Main_x), 56076#(<= 3 Main_x), 56077#(<= 4 Main_x), 56078#(<= 5 Main_x), 56079#(<= 6 Main_x), 56080#(<= 7 Main_x), 56081#(<= 8 Main_x), 56082#(<= 9 Main_x), 56083#(<= 10 Main_x), 56084#(<= 11 Main_x), 56085#(<= 12 Main_x), 56086#(<= 13 Main_x), 56087#(<= 14 Main_x), 56088#(<= 15 Main_x), 56089#(<= 16 Main_x), 56090#(<= 17 Main_x), 56091#(<= 18 Main_x), 56092#(<= 19 Main_x), 56093#(<= 20 Main_x), 56094#(<= 21 Main_x), 56095#(<= 22 Main_x), 56096#(<= 23 Main_x), 56097#(<= 24 Main_x), 56098#(<= 25 Main_x), 56099#(<= 26 Main_x), 56100#(<= 27 Main_x), 56101#(<= 28 Main_x), 56102#(<= 29 Main_x), 56103#(<= 30 Main_x), 56104#(<= 31 Main_x), 56105#(<= 32 Main_x), 56106#(<= 33 Main_x), 56107#(<= 34 Main_x), 56108#(<= 35 Main_x), 56109#(<= 36 Main_x), 56110#(<= 37 Main_x), 56111#(<= 38 Main_x), 56112#(<= 39 Main_x), 56113#(<= 40 Main_x), 56114#(<= 41 Main_x), 56115#(<= 42 Main_x), 56116#(<= 43 Main_x), 56117#(<= 44 Main_x), 56118#(<= 45 Main_x), 56119#(<= 46 Main_x), 56120#(<= 47 Main_x), 56121#(<= 48 Main_x), 56122#(<= 49 Main_x), 56123#(<= 50 Main_x), 56124#(<= 51 Main_x), 56125#(<= 52 Main_x), 56126#(<= 53 Main_x), 56127#(<= 54 Main_x), 56128#(<= 55 Main_x), 56129#(<= 56 Main_x), 56130#(<= 57 Main_x)] [2018-07-23 13:56:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:48,090 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:56:48,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:56:48,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:56:48,091 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-07-23 13:56:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:48,170 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-07-23 13:56:48,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:56:48,170 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-23 13:56:48,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:48,171 INFO L225 Difference]: With dead ends: 123 [2018-07-23 13:56:48,171 INFO L226 Difference]: Without dead ends: 120 [2018-07-23 13:56:48,171 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:56:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-23 13:56:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-23 13:56:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-23 13:56:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-07-23 13:56:48,233 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 118 [2018-07-23 13:56:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:48,233 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-07-23 13:56:48,233 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:56:48,233 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-07-23 13:56:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-23 13:56:48,233 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:48,234 INFO L357 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1] [2018-07-23 13:56:48,234 INFO L414 AbstractCegarLoop]: === Iteration 172 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:48,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1954164449, now seen corresponding path program 169 times [2018-07-23 13:56:48,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:48,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:48,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:56:48,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:48,428 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:56:48,429 INFO L185 omatonBuilderFactory]: Interpolants [56617#true, 56618#false, 56619#(and (<= 0 Main_y) (<= Main_y 0)), 56620#(and (<= 1 Main_y) (<= Main_y 1)), 56621#(and (<= Main_y 2) (<= 2 Main_y)), 56622#(and (<= Main_y 3) (<= 3 Main_y)), 56623#(and (<= Main_y 4) (<= 4 Main_y)), 56624#(and (<= Main_y 5) (<= 5 Main_y)), 56625#(and (<= Main_y 6) (<= 6 Main_y)), 56626#(and (<= 7 Main_y) (<= Main_y 7)), 56627#(and (<= 8 Main_y) (<= Main_y 8)), 56628#(and (<= Main_y 9) (<= 9 Main_y)), 56629#(and (<= 10 Main_y) (<= Main_y 10)), 56630#(and (<= 11 Main_y) (<= Main_y 11)), 56631#(and (<= 12 Main_y) (<= Main_y 12)), 56632#(and (<= 13 Main_y) (<= Main_y 13)), 56633#(and (<= 14 Main_y) (<= Main_y 14)), 56634#(and (<= Main_y 15) (<= 15 Main_y)), 56635#(and (<= 16 Main_y) (<= Main_y 16)), 56636#(and (<= Main_y 17) (<= 17 Main_y)), 56637#(and (<= Main_y 18) (<= 18 Main_y)), 56638#(and (<= Main_y 19) (<= 19 Main_y)), 56639#(and (<= 20 Main_y) (<= Main_y 20)), 56640#(and (<= 21 Main_y) (<= Main_y 21)), 56641#(and (<= Main_y 22) (<= 22 Main_y)), 56642#(and (<= 23 Main_y) (<= Main_y 23)), 56643#(and (<= Main_y 24) (<= 24 Main_y)), 56644#(and (<= 25 Main_y) (<= Main_y 25)), 56645#(and (<= Main_y 26) (<= 26 Main_y)), 56646#(and (<= 27 Main_y) (<= Main_y 27)), 56647#(and (<= 28 Main_y) (<= Main_y 28)), 56648#(and (<= 29 Main_y) (<= Main_y 29)), 56649#(and (<= 30 Main_y) (<= Main_y 30)), 56650#(and (<= Main_y 31) (<= 31 Main_y)), 56651#(and (<= 32 Main_y) (<= Main_y 32)), 56652#(and (<= 33 Main_y) (<= Main_y 33)), 56653#(and (<= Main_y 34) (<= 34 Main_y)), 56654#(and (<= 35 Main_y) (<= Main_y 35)), 56655#(and (<= 36 Main_y) (<= Main_y 36)), 56656#(and (<= Main_y 37) (<= 37 Main_y)), 56657#(and (<= Main_y 38) (<= 38 Main_y)), 56658#(and (<= 39 Main_y) (<= Main_y 39)), 56659#(and (<= 40 Main_y) (<= Main_y 40)), 56660#(and (<= Main_y 41) (<= 41 Main_y)), 56661#(and (<= 42 Main_y) (<= Main_y 42)), 56662#(and (<= 43 Main_y) (<= Main_y 43)), 56663#(and (<= 44 Main_y) (<= Main_y 44)), 56664#(and (<= Main_y 45) (<= 45 Main_y)), 56665#(and (<= 46 Main_y) (<= Main_y 46)), 56666#(and (<= 47 Main_y) (<= Main_y 47)), 56667#(and (<= 48 Main_y) (<= Main_y 48)), 56668#(and (<= 49 Main_y) (<= Main_y 49)), 56669#(and (<= 50 Main_y) (<= Main_y 50)), 56670#(and (<= 51 Main_y) (<= Main_y 51)), 56671#(and (<= 52 Main_y) (<= Main_y 52)), 56672#(and (<= 53 Main_y) (<= Main_y 53)), 56673#(and (<= 54 Main_y) (<= Main_y 54)), 56674#(and (<= 55 Main_y) (<= Main_y 55)), 56675#(and (<= Main_y 56) (<= 56 Main_y)), 56676#(and (<= Main_y 57) (<= 57 Main_y))] [2018-07-23 13:56:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:48,429 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:56:48,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:56:48,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:56:48,429 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 60 states. [2018-07-23 13:56:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:48,903 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-07-23 13:56:48,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:56:48,903 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 119 [2018-07-23 13:56:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:48,903 INFO L225 Difference]: With dead ends: 182 [2018-07-23 13:56:48,904 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 13:56:48,904 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:56:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 13:56:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-07-23 13:56:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-23 13:56:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-07-23 13:56:48,981 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 119 [2018-07-23 13:56:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:48,982 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-07-23 13:56:48,982 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:56:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-07-23 13:56:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 13:56:48,982 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:48,982 INFO L357 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-07-23 13:56:48,983 INFO L414 AbstractCegarLoop]: === Iteration 173 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash 449494253, now seen corresponding path program 170 times [2018-07-23 13:56:48,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:49,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:49,129 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:49,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:56:49,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:49,129 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:56:49,129 INFO L185 omatonBuilderFactory]: Interpolants [57344#(<= Main_x 57), 57345#(<= (+ Main_x 1) 0), 57285#true, 57286#false, 57287#(<= Main_x 0), 57288#(<= Main_x 1), 57289#(<= Main_x 2), 57290#(<= Main_x 3), 57291#(<= Main_x 4), 57292#(<= Main_x 5), 57293#(<= Main_x 6), 57294#(<= Main_x 7), 57295#(<= Main_x 8), 57296#(<= Main_x 9), 57297#(<= Main_x 10), 57298#(<= Main_x 11), 57299#(<= Main_x 12), 57300#(<= Main_x 13), 57301#(<= Main_x 14), 57302#(<= Main_x 15), 57303#(<= Main_x 16), 57304#(<= Main_x 17), 57305#(<= Main_x 18), 57306#(<= Main_x 19), 57307#(<= Main_x 20), 57308#(<= Main_x 21), 57309#(<= Main_x 22), 57310#(<= Main_x 23), 57311#(<= Main_x 24), 57312#(<= Main_x 25), 57313#(<= Main_x 26), 57314#(<= Main_x 27), 57315#(<= Main_x 28), 57316#(<= Main_x 29), 57317#(<= Main_x 30), 57318#(<= Main_x 31), 57319#(<= Main_x 32), 57320#(<= Main_x 33), 57321#(<= Main_x 34), 57322#(<= Main_x 35), 57323#(<= Main_x 36), 57324#(<= Main_x 37), 57325#(<= Main_x 38), 57326#(<= Main_x 39), 57327#(<= Main_x 40), 57328#(<= Main_x 41), 57329#(<= Main_x 42), 57330#(<= Main_x 43), 57331#(<= Main_x 44), 57332#(<= Main_x 45), 57333#(<= Main_x 46), 57334#(<= Main_x 47), 57335#(<= Main_x 48), 57336#(<= Main_x 49), 57337#(<= Main_x 50), 57338#(<= Main_x 51), 57339#(<= Main_x 52), 57340#(<= Main_x 53), 57341#(<= Main_x 54), 57342#(<= Main_x 55), 57343#(<= Main_x 56)] [2018-07-23 13:56:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:49,130 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:56:49,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:56:49,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:56:49,130 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 61 states. [2018-07-23 13:56:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:49,398 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2018-07-23 13:56:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:56:49,398 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-23 13:56:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:49,398 INFO L225 Difference]: With dead ends: 183 [2018-07-23 13:56:49,399 INFO L226 Difference]: Without dead ends: 121 [2018-07-23 13:56:49,399 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:56:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-23 13:56:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-23 13:56:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 13:56:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-07-23 13:56:49,469 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 120 [2018-07-23 13:56:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:49,469 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-07-23 13:56:49,469 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:56:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-07-23 13:56:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 13:56:49,470 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:49,470 INFO L357 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-07-23 13:56:49,470 INFO L414 AbstractCegarLoop]: === Iteration 174 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 180161031, now seen corresponding path program 171 times [2018-07-23 13:56:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:49,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:49,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:56:49,616 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:49,616 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:56:49,617 INFO L185 omatonBuilderFactory]: Interpolants [57984#(<= 28 Main_x), 57985#(<= 29 Main_x), 57986#(<= 30 Main_x), 57987#(<= 31 Main_x), 57988#(<= 32 Main_x), 57989#(<= 33 Main_x), 57990#(<= 34 Main_x), 57991#(<= 35 Main_x), 57992#(<= 36 Main_x), 57993#(<= 37 Main_x), 57994#(<= 38 Main_x), 57995#(<= 39 Main_x), 57996#(<= 40 Main_x), 57997#(<= 41 Main_x), 57998#(<= 42 Main_x), 57999#(<= 43 Main_x), 58000#(<= 44 Main_x), 58001#(<= 45 Main_x), 58002#(<= 46 Main_x), 58003#(<= 47 Main_x), 58004#(<= 48 Main_x), 58005#(<= 49 Main_x), 58006#(<= 50 Main_x), 58007#(<= 51 Main_x), 58008#(<= 52 Main_x), 58009#(<= 53 Main_x), 58010#(<= 54 Main_x), 58011#(<= 55 Main_x), 58012#(<= 56 Main_x), 58013#(<= 57 Main_x), 58014#(<= 58 Main_x), 57954#true, 57955#false, 57956#(<= 0 Main_x), 57957#(<= 1 Main_x), 57958#(<= 2 Main_x), 57959#(<= 3 Main_x), 57960#(<= 4 Main_x), 57961#(<= 5 Main_x), 57962#(<= 6 Main_x), 57963#(<= 7 Main_x), 57964#(<= 8 Main_x), 57965#(<= 9 Main_x), 57966#(<= 10 Main_x), 57967#(<= 11 Main_x), 57968#(<= 12 Main_x), 57969#(<= 13 Main_x), 57970#(<= 14 Main_x), 57971#(<= 15 Main_x), 57972#(<= 16 Main_x), 57973#(<= 17 Main_x), 57974#(<= 18 Main_x), 57975#(<= 19 Main_x), 57976#(<= 20 Main_x), 57977#(<= 21 Main_x), 57978#(<= 22 Main_x), 57979#(<= 23 Main_x), 57980#(<= 24 Main_x), 57981#(<= 25 Main_x), 57982#(<= 26 Main_x), 57983#(<= 27 Main_x)] [2018-07-23 13:56:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:49,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:56:49,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:56:49,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:56:49,617 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-07-23 13:56:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:49,721 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-07-23 13:56:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:56:49,722 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-23 13:56:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:49,722 INFO L225 Difference]: With dead ends: 125 [2018-07-23 13:56:49,722 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 13:56:49,722 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:56:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 13:56:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-23 13:56:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-23 13:56:49,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-07-23 13:56:49,787 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 120 [2018-07-23 13:56:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:49,788 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-07-23 13:56:49,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:56:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-07-23 13:56:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-23 13:56:49,788 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:49,789 INFO L357 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1] [2018-07-23 13:56:49,789 INFO L414 AbstractCegarLoop]: === Iteration 175 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1289963143, now seen corresponding path program 172 times [2018-07-23 13:56:49,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:50,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:50,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:56:50,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:50,032 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:56:50,032 INFO L185 omatonBuilderFactory]: Interpolants [58509#true, 58510#false, 58511#(and (<= 0 Main_y) (<= Main_y 0)), 58512#(and (<= 1 Main_y) (<= Main_y 1)), 58513#(and (<= Main_y 2) (<= 2 Main_y)), 58514#(and (<= Main_y 3) (<= 3 Main_y)), 58515#(and (<= Main_y 4) (<= 4 Main_y)), 58516#(and (<= Main_y 5) (<= 5 Main_y)), 58517#(and (<= Main_y 6) (<= 6 Main_y)), 58518#(and (<= 7 Main_y) (<= Main_y 7)), 58519#(and (<= 8 Main_y) (<= Main_y 8)), 58520#(and (<= Main_y 9) (<= 9 Main_y)), 58521#(and (<= 10 Main_y) (<= Main_y 10)), 58522#(and (<= 11 Main_y) (<= Main_y 11)), 58523#(and (<= 12 Main_y) (<= Main_y 12)), 58524#(and (<= 13 Main_y) (<= Main_y 13)), 58525#(and (<= 14 Main_y) (<= Main_y 14)), 58526#(and (<= Main_y 15) (<= 15 Main_y)), 58527#(and (<= 16 Main_y) (<= Main_y 16)), 58528#(and (<= Main_y 17) (<= 17 Main_y)), 58529#(and (<= Main_y 18) (<= 18 Main_y)), 58530#(and (<= Main_y 19) (<= 19 Main_y)), 58531#(and (<= 20 Main_y) (<= Main_y 20)), 58532#(and (<= 21 Main_y) (<= Main_y 21)), 58533#(and (<= Main_y 22) (<= 22 Main_y)), 58534#(and (<= 23 Main_y) (<= Main_y 23)), 58535#(and (<= Main_y 24) (<= 24 Main_y)), 58536#(and (<= 25 Main_y) (<= Main_y 25)), 58537#(and (<= Main_y 26) (<= 26 Main_y)), 58538#(and (<= 27 Main_y) (<= Main_y 27)), 58539#(and (<= 28 Main_y) (<= Main_y 28)), 58540#(and (<= 29 Main_y) (<= Main_y 29)), 58541#(and (<= 30 Main_y) (<= Main_y 30)), 58542#(and (<= Main_y 31) (<= 31 Main_y)), 58543#(and (<= 32 Main_y) (<= Main_y 32)), 58544#(and (<= 33 Main_y) (<= Main_y 33)), 58545#(and (<= Main_y 34) (<= 34 Main_y)), 58546#(and (<= 35 Main_y) (<= Main_y 35)), 58547#(and (<= 36 Main_y) (<= Main_y 36)), 58548#(and (<= Main_y 37) (<= 37 Main_y)), 58549#(and (<= Main_y 38) (<= 38 Main_y)), 58550#(and (<= 39 Main_y) (<= Main_y 39)), 58551#(and (<= 40 Main_y) (<= Main_y 40)), 58552#(and (<= Main_y 41) (<= 41 Main_y)), 58553#(and (<= 42 Main_y) (<= Main_y 42)), 58554#(and (<= 43 Main_y) (<= Main_y 43)), 58555#(and (<= 44 Main_y) (<= Main_y 44)), 58556#(and (<= Main_y 45) (<= 45 Main_y)), 58557#(and (<= 46 Main_y) (<= Main_y 46)), 58558#(and (<= 47 Main_y) (<= Main_y 47)), 58559#(and (<= 48 Main_y) (<= Main_y 48)), 58560#(and (<= 49 Main_y) (<= Main_y 49)), 58561#(and (<= 50 Main_y) (<= Main_y 50)), 58562#(and (<= 51 Main_y) (<= Main_y 51)), 58563#(and (<= 52 Main_y) (<= Main_y 52)), 58564#(and (<= 53 Main_y) (<= Main_y 53)), 58565#(and (<= 54 Main_y) (<= Main_y 54)), 58566#(and (<= 55 Main_y) (<= Main_y 55)), 58567#(and (<= Main_y 56) (<= 56 Main_y)), 58568#(and (<= Main_y 57) (<= 57 Main_y)), 58569#(and (<= Main_y 58) (<= 58 Main_y))] [2018-07-23 13:56:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:50,033 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:56:50,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:56:50,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:56:50,033 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 61 states. [2018-07-23 13:56:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:50,536 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-07-23 13:56:50,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:56:50,536 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 121 [2018-07-23 13:56:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:50,537 INFO L225 Difference]: With dead ends: 185 [2018-07-23 13:56:50,537 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 13:56:50,538 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:56:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 13:56:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 124. [2018-07-23 13:56:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-23 13:56:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-07-23 13:56:50,632 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 121 [2018-07-23 13:56:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:50,632 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-07-23 13:56:50,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:56:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-07-23 13:56:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-23 13:56:50,633 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:50,633 INFO L357 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-07-23 13:56:50,633 INFO L414 AbstractCegarLoop]: === Iteration 176 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1334090247, now seen corresponding path program 173 times [2018-07-23 13:56:50,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:50,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:50,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:56:50,800 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:50,800 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:56:50,800 INFO L185 omatonBuilderFactory]: Interpolants [59188#true, 59189#false, 59190#(<= Main_x 0), 59191#(<= Main_x 1), 59192#(<= Main_x 2), 59193#(<= Main_x 3), 59194#(<= Main_x 4), 59195#(<= Main_x 5), 59196#(<= Main_x 6), 59197#(<= Main_x 7), 59198#(<= Main_x 8), 59199#(<= Main_x 9), 59200#(<= Main_x 10), 59201#(<= Main_x 11), 59202#(<= Main_x 12), 59203#(<= Main_x 13), 59204#(<= Main_x 14), 59205#(<= Main_x 15), 59206#(<= Main_x 16), 59207#(<= Main_x 17), 59208#(<= Main_x 18), 59209#(<= Main_x 19), 59210#(<= Main_x 20), 59211#(<= Main_x 21), 59212#(<= Main_x 22), 59213#(<= Main_x 23), 59214#(<= Main_x 24), 59215#(<= Main_x 25), 59216#(<= Main_x 26), 59217#(<= Main_x 27), 59218#(<= Main_x 28), 59219#(<= Main_x 29), 59220#(<= Main_x 30), 59221#(<= Main_x 31), 59222#(<= Main_x 32), 59223#(<= Main_x 33), 59224#(<= Main_x 34), 59225#(<= Main_x 35), 59226#(<= Main_x 36), 59227#(<= Main_x 37), 59228#(<= Main_x 38), 59229#(<= Main_x 39), 59230#(<= Main_x 40), 59231#(<= Main_x 41), 59232#(<= Main_x 42), 59233#(<= Main_x 43), 59234#(<= Main_x 44), 59235#(<= Main_x 45), 59236#(<= Main_x 46), 59237#(<= Main_x 47), 59238#(<= Main_x 48), 59239#(<= Main_x 49), 59240#(<= Main_x 50), 59241#(<= Main_x 51), 59242#(<= Main_x 52), 59243#(<= Main_x 53), 59244#(<= Main_x 54), 59245#(<= Main_x 55), 59246#(<= Main_x 56), 59247#(<= Main_x 57), 59248#(<= Main_x 58), 59249#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:50,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:56:50,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:56:50,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:56:50,802 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 62 states. [2018-07-23 13:56:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:51,115 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2018-07-23 13:56:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:56:51,115 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-23 13:56:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:51,115 INFO L225 Difference]: With dead ends: 186 [2018-07-23 13:56:51,115 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 13:56:51,116 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:56:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 13:56:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-23 13:56:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-23 13:56:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-07-23 13:56:51,200 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 122 [2018-07-23 13:56:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:51,200 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-07-23 13:56:51,200 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:56:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-07-23 13:56:51,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-23 13:56:51,201 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:51,201 INFO L357 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-07-23 13:56:51,201 INFO L414 AbstractCegarLoop]: === Iteration 177 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1574694957, now seen corresponding path program 174 times [2018-07-23 13:56:51,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:51,390 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:51,390 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:56:51,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:51,390 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:56:51,390 INFO L185 omatonBuilderFactory]: Interpolants [59904#(<= 34 Main_x), 59905#(<= 35 Main_x), 59906#(<= 36 Main_x), 59907#(<= 37 Main_x), 59908#(<= 38 Main_x), 59909#(<= 39 Main_x), 59910#(<= 40 Main_x), 59911#(<= 41 Main_x), 59912#(<= 42 Main_x), 59913#(<= 43 Main_x), 59914#(<= 44 Main_x), 59915#(<= 45 Main_x), 59916#(<= 46 Main_x), 59917#(<= 47 Main_x), 59918#(<= 48 Main_x), 59919#(<= 49 Main_x), 59920#(<= 50 Main_x), 59921#(<= 51 Main_x), 59922#(<= 52 Main_x), 59923#(<= 53 Main_x), 59924#(<= 54 Main_x), 59925#(<= 55 Main_x), 59926#(<= 56 Main_x), 59927#(<= 57 Main_x), 59928#(<= 58 Main_x), 59929#(<= 59 Main_x), 59868#true, 59869#false, 59870#(<= 0 Main_x), 59871#(<= 1 Main_x), 59872#(<= 2 Main_x), 59873#(<= 3 Main_x), 59874#(<= 4 Main_x), 59875#(<= 5 Main_x), 59876#(<= 6 Main_x), 59877#(<= 7 Main_x), 59878#(<= 8 Main_x), 59879#(<= 9 Main_x), 59880#(<= 10 Main_x), 59881#(<= 11 Main_x), 59882#(<= 12 Main_x), 59883#(<= 13 Main_x), 59884#(<= 14 Main_x), 59885#(<= 15 Main_x), 59886#(<= 16 Main_x), 59887#(<= 17 Main_x), 59888#(<= 18 Main_x), 59889#(<= 19 Main_x), 59890#(<= 20 Main_x), 59891#(<= 21 Main_x), 59892#(<= 22 Main_x), 59893#(<= 23 Main_x), 59894#(<= 24 Main_x), 59895#(<= 25 Main_x), 59896#(<= 26 Main_x), 59897#(<= 27 Main_x), 59898#(<= 28 Main_x), 59899#(<= 29 Main_x), 59900#(<= 30 Main_x), 59901#(<= 31 Main_x), 59902#(<= 32 Main_x), 59903#(<= 33 Main_x)] [2018-07-23 13:56:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:51,391 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:56:51,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:56:51,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:56:51,391 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-07-23 13:56:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:51,479 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-07-23 13:56:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:56:51,479 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-23 13:56:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:51,480 INFO L225 Difference]: With dead ends: 127 [2018-07-23 13:56:51,480 INFO L226 Difference]: Without dead ends: 124 [2018-07-23 13:56:51,480 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:56:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-23 13:56:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-23 13:56:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-23 13:56:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-07-23 13:56:51,549 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-07-23 13:56:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:51,549 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-07-23 13:56:51,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:56:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-07-23 13:56:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-23 13:56:51,550 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:51,550 INFO L357 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1] [2018-07-23 13:56:51,550 INFO L414 AbstractCegarLoop]: === Iteration 178 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1570841889, now seen corresponding path program 175 times [2018-07-23 13:56:51,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:51,755 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:51,755 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:56:51,755 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:51,755 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:56:51,756 INFO L185 omatonBuilderFactory]: Interpolants [60432#true, 60433#false, 60434#(and (<= 0 Main_y) (<= Main_y 0)), 60435#(and (<= 1 Main_y) (<= Main_y 1)), 60436#(and (<= Main_y 2) (<= 2 Main_y)), 60437#(and (<= Main_y 3) (<= 3 Main_y)), 60438#(and (<= Main_y 4) (<= 4 Main_y)), 60439#(and (<= Main_y 5) (<= 5 Main_y)), 60440#(and (<= Main_y 6) (<= 6 Main_y)), 60441#(and (<= 7 Main_y) (<= Main_y 7)), 60442#(and (<= 8 Main_y) (<= Main_y 8)), 60443#(and (<= Main_y 9) (<= 9 Main_y)), 60444#(and (<= 10 Main_y) (<= Main_y 10)), 60445#(and (<= 11 Main_y) (<= Main_y 11)), 60446#(and (<= 12 Main_y) (<= Main_y 12)), 60447#(and (<= 13 Main_y) (<= Main_y 13)), 60448#(and (<= 14 Main_y) (<= Main_y 14)), 60449#(and (<= Main_y 15) (<= 15 Main_y)), 60450#(and (<= 16 Main_y) (<= Main_y 16)), 60451#(and (<= Main_y 17) (<= 17 Main_y)), 60452#(and (<= Main_y 18) (<= 18 Main_y)), 60453#(and (<= Main_y 19) (<= 19 Main_y)), 60454#(and (<= 20 Main_y) (<= Main_y 20)), 60455#(and (<= 21 Main_y) (<= Main_y 21)), 60456#(and (<= Main_y 22) (<= 22 Main_y)), 60457#(and (<= 23 Main_y) (<= Main_y 23)), 60458#(and (<= Main_y 24) (<= 24 Main_y)), 60459#(and (<= 25 Main_y) (<= Main_y 25)), 60460#(and (<= Main_y 26) (<= 26 Main_y)), 60461#(and (<= 27 Main_y) (<= Main_y 27)), 60462#(and (<= 28 Main_y) (<= Main_y 28)), 60463#(and (<= 29 Main_y) (<= Main_y 29)), 60464#(and (<= 30 Main_y) (<= Main_y 30)), 60465#(and (<= Main_y 31) (<= 31 Main_y)), 60466#(and (<= 32 Main_y) (<= Main_y 32)), 60467#(and (<= 33 Main_y) (<= Main_y 33)), 60468#(and (<= Main_y 34) (<= 34 Main_y)), 60469#(and (<= 35 Main_y) (<= Main_y 35)), 60470#(and (<= 36 Main_y) (<= Main_y 36)), 60471#(and (<= Main_y 37) (<= 37 Main_y)), 60472#(and (<= Main_y 38) (<= 38 Main_y)), 60473#(and (<= 39 Main_y) (<= Main_y 39)), 60474#(and (<= 40 Main_y) (<= Main_y 40)), 60475#(and (<= Main_y 41) (<= 41 Main_y)), 60476#(and (<= 42 Main_y) (<= Main_y 42)), 60477#(and (<= 43 Main_y) (<= Main_y 43)), 60478#(and (<= 44 Main_y) (<= Main_y 44)), 60479#(and (<= Main_y 45) (<= 45 Main_y)), 60480#(and (<= 46 Main_y) (<= Main_y 46)), 60481#(and (<= 47 Main_y) (<= Main_y 47)), 60482#(and (<= 48 Main_y) (<= Main_y 48)), 60483#(and (<= 49 Main_y) (<= Main_y 49)), 60484#(and (<= 50 Main_y) (<= Main_y 50)), 60485#(and (<= 51 Main_y) (<= Main_y 51)), 60486#(and (<= 52 Main_y) (<= Main_y 52)), 60487#(and (<= 53 Main_y) (<= Main_y 53)), 60488#(and (<= 54 Main_y) (<= Main_y 54)), 60489#(and (<= 55 Main_y) (<= Main_y 55)), 60490#(and (<= Main_y 56) (<= 56 Main_y)), 60491#(and (<= Main_y 57) (<= 57 Main_y)), 60492#(and (<= Main_y 58) (<= 58 Main_y)), 60493#(and (<= Main_y 59) (<= 59 Main_y))] [2018-07-23 13:56:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:51,756 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:56:51,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:56:51,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:56:51,757 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 62 states. [2018-07-23 13:56:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:52,240 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-07-23 13:56:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:56:52,240 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 123 [2018-07-23 13:56:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:52,241 INFO L225 Difference]: With dead ends: 188 [2018-07-23 13:56:52,241 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 13:56:52,241 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:56:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 13:56:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 126. [2018-07-23 13:56:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-23 13:56:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-07-23 13:56:52,326 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 123 [2018-07-23 13:56:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:52,326 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-07-23 13:56:52,326 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:56:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-07-23 13:56:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 13:56:52,326 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:52,326 INFO L357 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-07-23 13:56:52,326 INFO L414 AbstractCegarLoop]: === Iteration 179 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1451396781, now seen corresponding path program 176 times [2018-07-23 13:56:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:52,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:52,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:56:52,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:52,476 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:56:52,476 INFO L185 omatonBuilderFactory]: Interpolants [61184#(<= (+ Main_x 1) 0), 61122#true, 61123#false, 61124#(<= Main_x 0), 61125#(<= Main_x 1), 61126#(<= Main_x 2), 61127#(<= Main_x 3), 61128#(<= Main_x 4), 61129#(<= Main_x 5), 61130#(<= Main_x 6), 61131#(<= Main_x 7), 61132#(<= Main_x 8), 61133#(<= Main_x 9), 61134#(<= Main_x 10), 61135#(<= Main_x 11), 61136#(<= Main_x 12), 61137#(<= Main_x 13), 61138#(<= Main_x 14), 61139#(<= Main_x 15), 61140#(<= Main_x 16), 61141#(<= Main_x 17), 61142#(<= Main_x 18), 61143#(<= Main_x 19), 61144#(<= Main_x 20), 61145#(<= Main_x 21), 61146#(<= Main_x 22), 61147#(<= Main_x 23), 61148#(<= Main_x 24), 61149#(<= Main_x 25), 61150#(<= Main_x 26), 61151#(<= Main_x 27), 61152#(<= Main_x 28), 61153#(<= Main_x 29), 61154#(<= Main_x 30), 61155#(<= Main_x 31), 61156#(<= Main_x 32), 61157#(<= Main_x 33), 61158#(<= Main_x 34), 61159#(<= Main_x 35), 61160#(<= Main_x 36), 61161#(<= Main_x 37), 61162#(<= Main_x 38), 61163#(<= Main_x 39), 61164#(<= Main_x 40), 61165#(<= Main_x 41), 61166#(<= Main_x 42), 61167#(<= Main_x 43), 61168#(<= Main_x 44), 61169#(<= Main_x 45), 61170#(<= Main_x 46), 61171#(<= Main_x 47), 61172#(<= Main_x 48), 61173#(<= Main_x 49), 61174#(<= Main_x 50), 61175#(<= Main_x 51), 61176#(<= Main_x 52), 61177#(<= Main_x 53), 61178#(<= Main_x 54), 61179#(<= Main_x 55), 61180#(<= Main_x 56), 61181#(<= Main_x 57), 61182#(<= Main_x 58), 61183#(<= Main_x 59)] [2018-07-23 13:56:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:52,476 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:56:52,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:56:52,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:56:52,477 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 63 states. [2018-07-23 13:56:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:52,715 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2018-07-23 13:56:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:56:52,715 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-23 13:56:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:52,716 INFO L225 Difference]: With dead ends: 189 [2018-07-23 13:56:52,716 INFO L226 Difference]: Without dead ends: 125 [2018-07-23 13:56:52,716 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:56:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-23 13:56:52,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-23 13:56:52,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 13:56:52,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-07-23 13:56:52,788 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 124 [2018-07-23 13:56:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:52,788 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-07-23 13:56:52,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:56:52,788 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-07-23 13:56:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 13:56:52,788 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:52,788 INFO L357 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-07-23 13:56:52,789 INFO L414 AbstractCegarLoop]: === Iteration 180 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:52,789 INFO L82 PathProgramCache]: Analyzing trace with hash 320208199, now seen corresponding path program 177 times [2018-07-23 13:56:52,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:52,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:52,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:56:52,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:52,946 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:56:52,946 INFO L185 omatonBuilderFactory]: Interpolants [61824#(<= 9 Main_x), 61825#(<= 10 Main_x), 61826#(<= 11 Main_x), 61827#(<= 12 Main_x), 61828#(<= 13 Main_x), 61829#(<= 14 Main_x), 61830#(<= 15 Main_x), 61831#(<= 16 Main_x), 61832#(<= 17 Main_x), 61833#(<= 18 Main_x), 61834#(<= 19 Main_x), 61835#(<= 20 Main_x), 61836#(<= 21 Main_x), 61837#(<= 22 Main_x), 61838#(<= 23 Main_x), 61839#(<= 24 Main_x), 61840#(<= 25 Main_x), 61841#(<= 26 Main_x), 61842#(<= 27 Main_x), 61843#(<= 28 Main_x), 61844#(<= 29 Main_x), 61845#(<= 30 Main_x), 61846#(<= 31 Main_x), 61847#(<= 32 Main_x), 61848#(<= 33 Main_x), 61849#(<= 34 Main_x), 61850#(<= 35 Main_x), 61851#(<= 36 Main_x), 61852#(<= 37 Main_x), 61853#(<= 38 Main_x), 61854#(<= 39 Main_x), 61855#(<= 40 Main_x), 61856#(<= 41 Main_x), 61857#(<= 42 Main_x), 61858#(<= 43 Main_x), 61859#(<= 44 Main_x), 61860#(<= 45 Main_x), 61861#(<= 46 Main_x), 61862#(<= 47 Main_x), 61863#(<= 48 Main_x), 61864#(<= 49 Main_x), 61865#(<= 50 Main_x), 61866#(<= 51 Main_x), 61867#(<= 52 Main_x), 61868#(<= 53 Main_x), 61869#(<= 54 Main_x), 61870#(<= 55 Main_x), 61871#(<= 56 Main_x), 61872#(<= 57 Main_x), 61873#(<= 58 Main_x), 61874#(<= 59 Main_x), 61875#(<= 60 Main_x), 61813#true, 61814#false, 61815#(<= 0 Main_x), 61816#(<= 1 Main_x), 61817#(<= 2 Main_x), 61818#(<= 3 Main_x), 61819#(<= 4 Main_x), 61820#(<= 5 Main_x), 61821#(<= 6 Main_x), 61822#(<= 7 Main_x), 61823#(<= 8 Main_x)] [2018-07-23 13:56:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:52,946 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:56:52,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:56:52,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:56:52,947 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-07-23 13:56:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:53,034 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-07-23 13:56:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:56:53,034 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-23 13:56:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:53,034 INFO L225 Difference]: With dead ends: 129 [2018-07-23 13:56:53,034 INFO L226 Difference]: Without dead ends: 126 [2018-07-23 13:56:53,035 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:56:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-23 13:56:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-23 13:56:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-23 13:56:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-07-23 13:56:53,104 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 124 [2018-07-23 13:56:53,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:53,104 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-07-23 13:56:53,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:56:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-07-23 13:56:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-23 13:56:53,104 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:53,105 INFO L357 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1] [2018-07-23 13:56:53,105 INFO L414 AbstractCegarLoop]: === Iteration 181 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:53,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1336458055, now seen corresponding path program 178 times [2018-07-23 13:56:53,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:53,320 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:53,320 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:56:53,320 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:53,320 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:56:53,321 INFO L185 omatonBuilderFactory]: Interpolants [62386#true, 62387#false, 62388#(and (<= 0 Main_y) (<= Main_y 0)), 62389#(and (<= 1 Main_y) (<= Main_y 1)), 62390#(and (<= Main_y 2) (<= 2 Main_y)), 62391#(and (<= Main_y 3) (<= 3 Main_y)), 62392#(and (<= Main_y 4) (<= 4 Main_y)), 62393#(and (<= Main_y 5) (<= 5 Main_y)), 62394#(and (<= Main_y 6) (<= 6 Main_y)), 62395#(and (<= 7 Main_y) (<= Main_y 7)), 62396#(and (<= 8 Main_y) (<= Main_y 8)), 62397#(and (<= Main_y 9) (<= 9 Main_y)), 62398#(and (<= 10 Main_y) (<= Main_y 10)), 62399#(and (<= 11 Main_y) (<= Main_y 11)), 62400#(and (<= 12 Main_y) (<= Main_y 12)), 62401#(and (<= 13 Main_y) (<= Main_y 13)), 62402#(and (<= 14 Main_y) (<= Main_y 14)), 62403#(and (<= Main_y 15) (<= 15 Main_y)), 62404#(and (<= 16 Main_y) (<= Main_y 16)), 62405#(and (<= Main_y 17) (<= 17 Main_y)), 62406#(and (<= Main_y 18) (<= 18 Main_y)), 62407#(and (<= Main_y 19) (<= 19 Main_y)), 62408#(and (<= 20 Main_y) (<= Main_y 20)), 62409#(and (<= 21 Main_y) (<= Main_y 21)), 62410#(and (<= Main_y 22) (<= 22 Main_y)), 62411#(and (<= 23 Main_y) (<= Main_y 23)), 62412#(and (<= Main_y 24) (<= 24 Main_y)), 62413#(and (<= 25 Main_y) (<= Main_y 25)), 62414#(and (<= Main_y 26) (<= 26 Main_y)), 62415#(and (<= 27 Main_y) (<= Main_y 27)), 62416#(and (<= 28 Main_y) (<= Main_y 28)), 62417#(and (<= 29 Main_y) (<= Main_y 29)), 62418#(and (<= 30 Main_y) (<= Main_y 30)), 62419#(and (<= Main_y 31) (<= 31 Main_y)), 62420#(and (<= 32 Main_y) (<= Main_y 32)), 62421#(and (<= 33 Main_y) (<= Main_y 33)), 62422#(and (<= Main_y 34) (<= 34 Main_y)), 62423#(and (<= 35 Main_y) (<= Main_y 35)), 62424#(and (<= 36 Main_y) (<= Main_y 36)), 62425#(and (<= Main_y 37) (<= 37 Main_y)), 62426#(and (<= Main_y 38) (<= 38 Main_y)), 62427#(and (<= 39 Main_y) (<= Main_y 39)), 62428#(and (<= 40 Main_y) (<= Main_y 40)), 62429#(and (<= Main_y 41) (<= 41 Main_y)), 62430#(and (<= 42 Main_y) (<= Main_y 42)), 62431#(and (<= 43 Main_y) (<= Main_y 43)), 62432#(and (<= 44 Main_y) (<= Main_y 44)), 62433#(and (<= Main_y 45) (<= 45 Main_y)), 62434#(and (<= 46 Main_y) (<= Main_y 46)), 62435#(and (<= 47 Main_y) (<= Main_y 47)), 62436#(and (<= 48 Main_y) (<= Main_y 48)), 62437#(and (<= 49 Main_y) (<= Main_y 49)), 62438#(and (<= 50 Main_y) (<= Main_y 50)), 62439#(and (<= 51 Main_y) (<= Main_y 51)), 62440#(and (<= 52 Main_y) (<= Main_y 52)), 62441#(and (<= 53 Main_y) (<= Main_y 53)), 62442#(and (<= 54 Main_y) (<= Main_y 54)), 62443#(and (<= 55 Main_y) (<= Main_y 55)), 62444#(and (<= Main_y 56) (<= 56 Main_y)), 62445#(and (<= Main_y 57) (<= 57 Main_y)), 62446#(and (<= Main_y 58) (<= 58 Main_y)), 62447#(and (<= Main_y 59) (<= 59 Main_y)), 62448#(and (<= Main_y 60) (<= 60 Main_y))] [2018-07-23 13:56:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:53,321 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:56:53,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:56:53,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:56:53,322 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 63 states. [2018-07-23 13:56:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:53,826 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2018-07-23 13:56:53,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:56:53,826 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 125 [2018-07-23 13:56:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:53,826 INFO L225 Difference]: With dead ends: 191 [2018-07-23 13:56:53,827 INFO L226 Difference]: Without dead ends: 188 [2018-07-23 13:56:53,827 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:56:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-23 13:56:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-07-23 13:56:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 13:56:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-07-23 13:56:53,900 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 125 [2018-07-23 13:56:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:53,900 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-07-23 13:56:53,900 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:56:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-07-23 13:56:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 13:56:53,901 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:53,901 INFO L357 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-07-23 13:56:53,901 INFO L414 AbstractCegarLoop]: === Iteration 182 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:53,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1519534777, now seen corresponding path program 179 times [2018-07-23 13:56:53,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:54,048 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:54,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:56:54,049 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:54,049 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:56:54,049 INFO L185 omatonBuilderFactory]: Interpolants [63104#(<= Main_x 15), 63105#(<= Main_x 16), 63106#(<= Main_x 17), 63107#(<= Main_x 18), 63108#(<= Main_x 19), 63109#(<= Main_x 20), 63110#(<= Main_x 21), 63111#(<= Main_x 22), 63112#(<= Main_x 23), 63113#(<= Main_x 24), 63114#(<= Main_x 25), 63115#(<= Main_x 26), 63116#(<= Main_x 27), 63117#(<= Main_x 28), 63118#(<= Main_x 29), 63119#(<= Main_x 30), 63120#(<= Main_x 31), 63121#(<= Main_x 32), 63122#(<= Main_x 33), 63123#(<= Main_x 34), 63124#(<= Main_x 35), 63125#(<= Main_x 36), 63126#(<= Main_x 37), 63127#(<= Main_x 38), 63128#(<= Main_x 39), 63129#(<= Main_x 40), 63130#(<= Main_x 41), 63131#(<= Main_x 42), 63132#(<= Main_x 43), 63133#(<= Main_x 44), 63134#(<= Main_x 45), 63135#(<= Main_x 46), 63136#(<= Main_x 47), 63137#(<= Main_x 48), 63138#(<= Main_x 49), 63139#(<= Main_x 50), 63140#(<= Main_x 51), 63141#(<= Main_x 52), 63142#(<= Main_x 53), 63143#(<= Main_x 54), 63144#(<= Main_x 55), 63145#(<= Main_x 56), 63146#(<= Main_x 57), 63147#(<= Main_x 58), 63148#(<= Main_x 59), 63149#(<= Main_x 60), 63150#(<= (+ Main_x 1) 0), 63087#true, 63088#false, 63089#(<= Main_x 0), 63090#(<= Main_x 1), 63091#(<= Main_x 2), 63092#(<= Main_x 3), 63093#(<= Main_x 4), 63094#(<= Main_x 5), 63095#(<= Main_x 6), 63096#(<= Main_x 7), 63097#(<= Main_x 8), 63098#(<= Main_x 9), 63099#(<= Main_x 10), 63100#(<= Main_x 11), 63101#(<= Main_x 12), 63102#(<= Main_x 13), 63103#(<= Main_x 14)] [2018-07-23 13:56:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:54,050 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:56:54,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:56:54,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:56:54,051 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 64 states. [2018-07-23 13:56:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:54,271 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-07-23 13:56:54,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:56:54,272 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-23 13:56:54,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:54,272 INFO L225 Difference]: With dead ends: 192 [2018-07-23 13:56:54,272 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 13:56:54,272 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:56:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 13:56:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-23 13:56:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 13:56:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-07-23 13:56:54,371 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 126 [2018-07-23 13:56:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:54,371 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-07-23 13:56:54,371 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:56:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-07-23 13:56:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 13:56:54,371 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:54,371 INFO L357 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-07-23 13:56:54,371 INFO L414 AbstractCegarLoop]: === Iteration 183 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2068324845, now seen corresponding path program 180 times [2018-07-23 13:56:54,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:54,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:54,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:56:54,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:54,540 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:56:54,541 INFO L185 omatonBuilderFactory]: Interpolants [63789#true, 63790#false, 63791#(<= 0 Main_x), 63792#(<= 1 Main_x), 63793#(<= 2 Main_x), 63794#(<= 3 Main_x), 63795#(<= 4 Main_x), 63796#(<= 5 Main_x), 63797#(<= 6 Main_x), 63798#(<= 7 Main_x), 63799#(<= 8 Main_x), 63800#(<= 9 Main_x), 63801#(<= 10 Main_x), 63802#(<= 11 Main_x), 63803#(<= 12 Main_x), 63804#(<= 13 Main_x), 63805#(<= 14 Main_x), 63806#(<= 15 Main_x), 63807#(<= 16 Main_x), 63808#(<= 17 Main_x), 63809#(<= 18 Main_x), 63810#(<= 19 Main_x), 63811#(<= 20 Main_x), 63812#(<= 21 Main_x), 63813#(<= 22 Main_x), 63814#(<= 23 Main_x), 63815#(<= 24 Main_x), 63816#(<= 25 Main_x), 63817#(<= 26 Main_x), 63818#(<= 27 Main_x), 63819#(<= 28 Main_x), 63820#(<= 29 Main_x), 63821#(<= 30 Main_x), 63822#(<= 31 Main_x), 63823#(<= 32 Main_x), 63824#(<= 33 Main_x), 63825#(<= 34 Main_x), 63826#(<= 35 Main_x), 63827#(<= 36 Main_x), 63828#(<= 37 Main_x), 63829#(<= 38 Main_x), 63830#(<= 39 Main_x), 63831#(<= 40 Main_x), 63832#(<= 41 Main_x), 63833#(<= 42 Main_x), 63834#(<= 43 Main_x), 63835#(<= 44 Main_x), 63836#(<= 45 Main_x), 63837#(<= 46 Main_x), 63838#(<= 47 Main_x), 63839#(<= 48 Main_x), 63840#(<= 49 Main_x), 63841#(<= 50 Main_x), 63842#(<= 51 Main_x), 63843#(<= 52 Main_x), 63844#(<= 53 Main_x), 63845#(<= 54 Main_x), 63846#(<= 55 Main_x), 63847#(<= 56 Main_x), 63848#(<= 57 Main_x), 63849#(<= 58 Main_x), 63850#(<= 59 Main_x), 63851#(<= 60 Main_x), 63852#(<= 61 Main_x)] [2018-07-23 13:56:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:54,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:56:54,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:56:54,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:56:54,542 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-07-23 13:56:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:54,657 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-07-23 13:56:54,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:56:54,657 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-23 13:56:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:54,657 INFO L225 Difference]: With dead ends: 131 [2018-07-23 13:56:54,657 INFO L226 Difference]: Without dead ends: 128 [2018-07-23 13:56:54,658 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:56:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-23 13:56:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-23 13:56:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-23 13:56:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-07-23 13:56:54,764 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 126 [2018-07-23 13:56:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:54,764 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-07-23 13:56:54,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:56:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-07-23 13:56:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-23 13:56:54,765 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:54,765 INFO L357 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1] [2018-07-23 13:56:54,765 INFO L414 AbstractCegarLoop]: === Iteration 184 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash -306500767, now seen corresponding path program 181 times [2018-07-23 13:56:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:55,003 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:55,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:56:55,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:55,004 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:56:55,004 INFO L185 omatonBuilderFactory]: Interpolants [64384#(and (<= 11 Main_y) (<= Main_y 11)), 64385#(and (<= 12 Main_y) (<= Main_y 12)), 64386#(and (<= 13 Main_y) (<= Main_y 13)), 64387#(and (<= 14 Main_y) (<= Main_y 14)), 64388#(and (<= Main_y 15) (<= 15 Main_y)), 64389#(and (<= 16 Main_y) (<= Main_y 16)), 64390#(and (<= Main_y 17) (<= 17 Main_y)), 64391#(and (<= Main_y 18) (<= 18 Main_y)), 64392#(and (<= Main_y 19) (<= 19 Main_y)), 64393#(and (<= 20 Main_y) (<= Main_y 20)), 64394#(and (<= 21 Main_y) (<= Main_y 21)), 64395#(and (<= Main_y 22) (<= 22 Main_y)), 64396#(and (<= 23 Main_y) (<= Main_y 23)), 64397#(and (<= Main_y 24) (<= 24 Main_y)), 64398#(and (<= 25 Main_y) (<= Main_y 25)), 64399#(and (<= Main_y 26) (<= 26 Main_y)), 64400#(and (<= 27 Main_y) (<= Main_y 27)), 64401#(and (<= 28 Main_y) (<= Main_y 28)), 64402#(and (<= 29 Main_y) (<= Main_y 29)), 64403#(and (<= 30 Main_y) (<= Main_y 30)), 64404#(and (<= Main_y 31) (<= 31 Main_y)), 64405#(and (<= 32 Main_y) (<= Main_y 32)), 64406#(and (<= 33 Main_y) (<= Main_y 33)), 64407#(and (<= Main_y 34) (<= 34 Main_y)), 64408#(and (<= 35 Main_y) (<= Main_y 35)), 64409#(and (<= 36 Main_y) (<= Main_y 36)), 64410#(and (<= Main_y 37) (<= 37 Main_y)), 64411#(and (<= Main_y 38) (<= 38 Main_y)), 64412#(and (<= 39 Main_y) (<= Main_y 39)), 64413#(and (<= 40 Main_y) (<= Main_y 40)), 64414#(and (<= Main_y 41) (<= 41 Main_y)), 64415#(and (<= 42 Main_y) (<= Main_y 42)), 64416#(and (<= 43 Main_y) (<= Main_y 43)), 64417#(and (<= 44 Main_y) (<= Main_y 44)), 64418#(and (<= Main_y 45) (<= 45 Main_y)), 64419#(and (<= 46 Main_y) (<= Main_y 46)), 64420#(and (<= 47 Main_y) (<= Main_y 47)), 64421#(and (<= 48 Main_y) (<= Main_y 48)), 64422#(and (<= 49 Main_y) (<= Main_y 49)), 64423#(and (<= 50 Main_y) (<= Main_y 50)), 64424#(and (<= 51 Main_y) (<= Main_y 51)), 64425#(and (<= 52 Main_y) (<= Main_y 52)), 64426#(and (<= 53 Main_y) (<= Main_y 53)), 64427#(and (<= 54 Main_y) (<= Main_y 54)), 64428#(and (<= 55 Main_y) (<= Main_y 55)), 64429#(and (<= Main_y 56) (<= 56 Main_y)), 64430#(and (<= Main_y 57) (<= 57 Main_y)), 64431#(and (<= Main_y 58) (<= 58 Main_y)), 64432#(and (<= Main_y 59) (<= 59 Main_y)), 64433#(and (<= Main_y 60) (<= 60 Main_y)), 64434#(and (<= Main_y 61) (<= 61 Main_y)), 64371#true, 64372#false, 64373#(and (<= 0 Main_y) (<= Main_y 0)), 64374#(and (<= 1 Main_y) (<= Main_y 1)), 64375#(and (<= Main_y 2) (<= 2 Main_y)), 64376#(and (<= Main_y 3) (<= 3 Main_y)), 64377#(and (<= Main_y 4) (<= 4 Main_y)), 64378#(and (<= Main_y 5) (<= 5 Main_y)), 64379#(and (<= Main_y 6) (<= 6 Main_y)), 64380#(and (<= 7 Main_y) (<= Main_y 7)), 64381#(and (<= 8 Main_y) (<= Main_y 8)), 64382#(and (<= Main_y 9) (<= 9 Main_y)), 64383#(and (<= 10 Main_y) (<= Main_y 10))] [2018-07-23 13:56:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:55,004 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:56:55,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:56:55,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:56:55,005 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 64 states. [2018-07-23 13:56:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:55,528 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-07-23 13:56:55,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:56:55,529 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 127 [2018-07-23 13:56:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:55,529 INFO L225 Difference]: With dead ends: 194 [2018-07-23 13:56:55,529 INFO L226 Difference]: Without dead ends: 191 [2018-07-23 13:56:55,529 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:56:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-23 13:56:55,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 130. [2018-07-23 13:56:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-23 13:56:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-07-23 13:56:55,613 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2018-07-23 13:56:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:55,614 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-07-23 13:56:55,614 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:56:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-07-23 13:56:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 13:56:55,614 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:55,614 INFO L357 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-07-23 13:56:55,615 INFO L414 AbstractCegarLoop]: === Iteration 185 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash -911650707, now seen corresponding path program 182 times [2018-07-23 13:56:55,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:55,767 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:55,767 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:56:55,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:55,767 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:56:55,768 INFO L185 omatonBuilderFactory]: Interpolants [65083#true, 65084#false, 65085#(<= Main_x 0), 65086#(<= Main_x 1), 65087#(<= Main_x 2), 65088#(<= Main_x 3), 65089#(<= Main_x 4), 65090#(<= Main_x 5), 65091#(<= Main_x 6), 65092#(<= Main_x 7), 65093#(<= Main_x 8), 65094#(<= Main_x 9), 65095#(<= Main_x 10), 65096#(<= Main_x 11), 65097#(<= Main_x 12), 65098#(<= Main_x 13), 65099#(<= Main_x 14), 65100#(<= Main_x 15), 65101#(<= Main_x 16), 65102#(<= Main_x 17), 65103#(<= Main_x 18), 65104#(<= Main_x 19), 65105#(<= Main_x 20), 65106#(<= Main_x 21), 65107#(<= Main_x 22), 65108#(<= Main_x 23), 65109#(<= Main_x 24), 65110#(<= Main_x 25), 65111#(<= Main_x 26), 65112#(<= Main_x 27), 65113#(<= Main_x 28), 65114#(<= Main_x 29), 65115#(<= Main_x 30), 65116#(<= Main_x 31), 65117#(<= Main_x 32), 65118#(<= Main_x 33), 65119#(<= Main_x 34), 65120#(<= Main_x 35), 65121#(<= Main_x 36), 65122#(<= Main_x 37), 65123#(<= Main_x 38), 65124#(<= Main_x 39), 65125#(<= Main_x 40), 65126#(<= Main_x 41), 65127#(<= Main_x 42), 65128#(<= Main_x 43), 65129#(<= Main_x 44), 65130#(<= Main_x 45), 65131#(<= Main_x 46), 65132#(<= Main_x 47), 65133#(<= Main_x 48), 65134#(<= Main_x 49), 65135#(<= Main_x 50), 65136#(<= Main_x 51), 65137#(<= Main_x 52), 65138#(<= Main_x 53), 65139#(<= Main_x 54), 65140#(<= Main_x 55), 65141#(<= Main_x 56), 65142#(<= Main_x 57), 65143#(<= Main_x 58), 65144#(<= Main_x 59), 65145#(<= Main_x 60), 65146#(<= Main_x 61), 65147#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:55,768 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:56:55,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:56:55,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:56:55,769 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 65 states. [2018-07-23 13:56:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:56,063 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-07-23 13:56:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:56:56,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-23 13:56:56,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:56,064 INFO L225 Difference]: With dead ends: 195 [2018-07-23 13:56:56,064 INFO L226 Difference]: Without dead ends: 129 [2018-07-23 13:56:56,064 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:56:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-23 13:56:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-23 13:56:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 13:56:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-07-23 13:56:56,143 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 128 [2018-07-23 13:56:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:56,143 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-07-23 13:56:56,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:56:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-07-23 13:56:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 13:56:56,144 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:56,144 INFO L357 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-07-23 13:56:56,144 INFO L414 AbstractCegarLoop]: === Iteration 186 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1357152121, now seen corresponding path program 183 times [2018-07-23 13:56:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:56,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:56,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:56:56,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:56,289 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:56:56,289 INFO L185 omatonBuilderFactory]: Interpolants [65797#false, 65796#true, 65799#(<= 1 Main_x), 65798#(<= 0 Main_x), 65801#(<= 3 Main_x), 65800#(<= 2 Main_x), 65803#(<= 5 Main_x), 65802#(<= 4 Main_x), 65805#(<= 7 Main_x), 65804#(<= 6 Main_x), 65807#(<= 9 Main_x), 65806#(<= 8 Main_x), 65809#(<= 11 Main_x), 65808#(<= 10 Main_x), 65811#(<= 13 Main_x), 65810#(<= 12 Main_x), 65813#(<= 15 Main_x), 65812#(<= 14 Main_x), 65815#(<= 17 Main_x), 65814#(<= 16 Main_x), 65817#(<= 19 Main_x), 65816#(<= 18 Main_x), 65819#(<= 21 Main_x), 65818#(<= 20 Main_x), 65821#(<= 23 Main_x), 65820#(<= 22 Main_x), 65823#(<= 25 Main_x), 65822#(<= 24 Main_x), 65825#(<= 27 Main_x), 65824#(<= 26 Main_x), 65827#(<= 29 Main_x), 65826#(<= 28 Main_x), 65829#(<= 31 Main_x), 65828#(<= 30 Main_x), 65831#(<= 33 Main_x), 65830#(<= 32 Main_x), 65833#(<= 35 Main_x), 65832#(<= 34 Main_x), 65835#(<= 37 Main_x), 65834#(<= 36 Main_x), 65837#(<= 39 Main_x), 65836#(<= 38 Main_x), 65839#(<= 41 Main_x), 65838#(<= 40 Main_x), 65841#(<= 43 Main_x), 65840#(<= 42 Main_x), 65843#(<= 45 Main_x), 65842#(<= 44 Main_x), 65845#(<= 47 Main_x), 65844#(<= 46 Main_x), 65847#(<= 49 Main_x), 65846#(<= 48 Main_x), 65849#(<= 51 Main_x), 65848#(<= 50 Main_x), 65851#(<= 53 Main_x), 65850#(<= 52 Main_x), 65853#(<= 55 Main_x), 65852#(<= 54 Main_x), 65855#(<= 57 Main_x), 65854#(<= 56 Main_x), 65857#(<= 59 Main_x), 65856#(<= 58 Main_x), 65859#(<= 61 Main_x), 65858#(<= 60 Main_x), 65860#(<= 62 Main_x)] [2018-07-23 13:56:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:56,290 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:56:56,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:56:56,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:56:56,290 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-07-23 13:56:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:56,385 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-07-23 13:56:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:56:56,385 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-23 13:56:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:56,386 INFO L225 Difference]: With dead ends: 133 [2018-07-23 13:56:56,386 INFO L226 Difference]: Without dead ends: 130 [2018-07-23 13:56:56,386 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:56:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-23 13:56:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-23 13:56:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-23 13:56:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-07-23 13:56:56,458 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-07-23 13:56:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-07-23 13:56:56,458 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:56:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-07-23 13:56:56,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-23 13:56:56,459 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:56,459 INFO L357 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1] [2018-07-23 13:56:56,459 INFO L414 AbstractCegarLoop]: === Iteration 187 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash 877895687, now seen corresponding path program 184 times [2018-07-23 13:56:56,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:56,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:56,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:56:56,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:56,688 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:56:56,688 INFO L185 omatonBuilderFactory]: Interpolants [66433#(and (<= 44 Main_y) (<= Main_y 44)), 66432#(and (<= 43 Main_y) (<= Main_y 43)), 66435#(and (<= 46 Main_y) (<= Main_y 46)), 66434#(and (<= Main_y 45) (<= 45 Main_y)), 66437#(and (<= 48 Main_y) (<= Main_y 48)), 66436#(and (<= 47 Main_y) (<= Main_y 47)), 66439#(and (<= 50 Main_y) (<= Main_y 50)), 66438#(and (<= 49 Main_y) (<= Main_y 49)), 66441#(and (<= 52 Main_y) (<= Main_y 52)), 66440#(and (<= 51 Main_y) (<= Main_y 51)), 66443#(and (<= 54 Main_y) (<= Main_y 54)), 66442#(and (<= 53 Main_y) (<= Main_y 53)), 66445#(and (<= Main_y 56) (<= 56 Main_y)), 66444#(and (<= 55 Main_y) (<= Main_y 55)), 66447#(and (<= Main_y 58) (<= 58 Main_y)), 66446#(and (<= Main_y 57) (<= 57 Main_y)), 66449#(and (<= Main_y 60) (<= 60 Main_y)), 66448#(and (<= Main_y 59) (<= 59 Main_y)), 66451#(and (<= 62 Main_y) (<= Main_y 62)), 66450#(and (<= Main_y 61) (<= 61 Main_y)), 66387#true, 66389#(and (<= 0 Main_y) (<= Main_y 0)), 66388#false, 66391#(and (<= Main_y 2) (<= 2 Main_y)), 66390#(and (<= 1 Main_y) (<= Main_y 1)), 66393#(and (<= Main_y 4) (<= 4 Main_y)), 66392#(and (<= Main_y 3) (<= 3 Main_y)), 66395#(and (<= Main_y 6) (<= 6 Main_y)), 66394#(and (<= Main_y 5) (<= 5 Main_y)), 66397#(and (<= 8 Main_y) (<= Main_y 8)), 66396#(and (<= 7 Main_y) (<= Main_y 7)), 66399#(and (<= 10 Main_y) (<= Main_y 10)), 66398#(and (<= Main_y 9) (<= 9 Main_y)), 66401#(and (<= 12 Main_y) (<= Main_y 12)), 66400#(and (<= 11 Main_y) (<= Main_y 11)), 66403#(and (<= 14 Main_y) (<= Main_y 14)), 66402#(and (<= 13 Main_y) (<= Main_y 13)), 66405#(and (<= 16 Main_y) (<= Main_y 16)), 66404#(and (<= Main_y 15) (<= 15 Main_y)), 66407#(and (<= Main_y 18) (<= 18 Main_y)), 66406#(and (<= Main_y 17) (<= 17 Main_y)), 66409#(and (<= 20 Main_y) (<= Main_y 20)), 66408#(and (<= Main_y 19) (<= 19 Main_y)), 66411#(and (<= Main_y 22) (<= 22 Main_y)), 66410#(and (<= 21 Main_y) (<= Main_y 21)), 66413#(and (<= Main_y 24) (<= 24 Main_y)), 66412#(and (<= 23 Main_y) (<= Main_y 23)), 66415#(and (<= Main_y 26) (<= 26 Main_y)), 66414#(and (<= 25 Main_y) (<= Main_y 25)), 66417#(and (<= 28 Main_y) (<= Main_y 28)), 66416#(and (<= 27 Main_y) (<= Main_y 27)), 66419#(and (<= 30 Main_y) (<= Main_y 30)), 66418#(and (<= 29 Main_y) (<= Main_y 29)), 66421#(and (<= 32 Main_y) (<= Main_y 32)), 66420#(and (<= Main_y 31) (<= 31 Main_y)), 66423#(and (<= Main_y 34) (<= 34 Main_y)), 66422#(and (<= 33 Main_y) (<= Main_y 33)), 66425#(and (<= 36 Main_y) (<= Main_y 36)), 66424#(and (<= 35 Main_y) (<= Main_y 35)), 66427#(and (<= Main_y 38) (<= 38 Main_y)), 66426#(and (<= Main_y 37) (<= 37 Main_y)), 66429#(and (<= 40 Main_y) (<= Main_y 40)), 66428#(and (<= 39 Main_y) (<= Main_y 39)), 66431#(and (<= 42 Main_y) (<= Main_y 42)), 66430#(and (<= Main_y 41) (<= 41 Main_y))] [2018-07-23 13:56:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:56,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:56:56,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:56:56,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:56:56,689 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 65 states. [2018-07-23 13:56:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:57,242 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-07-23 13:56:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:56:57,242 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 129 [2018-07-23 13:56:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:57,243 INFO L225 Difference]: With dead ends: 197 [2018-07-23 13:56:57,243 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 13:56:57,243 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:56:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 13:56:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 132. [2018-07-23 13:56:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-23 13:56:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-07-23 13:56:57,323 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 129 [2018-07-23 13:56:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:57,323 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-07-23 13:56:57,323 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:56:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-07-23 13:56:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 13:56:57,324 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:57,324 INFO L357 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-07-23 13:56:57,324 INFO L414 AbstractCegarLoop]: === Iteration 188 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:57,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1444900999, now seen corresponding path program 185 times [2018-07-23 13:56:57,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:57,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:57,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:56:57,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:57,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:56:57,503 INFO L185 omatonBuilderFactory]: Interpolants [67111#false, 67110#true, 67113#(<= Main_x 1), 67112#(<= Main_x 0), 67115#(<= Main_x 3), 67114#(<= Main_x 2), 67117#(<= Main_x 5), 67116#(<= Main_x 4), 67119#(<= Main_x 7), 67118#(<= Main_x 6), 67121#(<= Main_x 9), 67120#(<= Main_x 8), 67123#(<= Main_x 11), 67122#(<= Main_x 10), 67125#(<= Main_x 13), 67124#(<= Main_x 12), 67127#(<= Main_x 15), 67126#(<= Main_x 14), 67129#(<= Main_x 17), 67128#(<= Main_x 16), 67131#(<= Main_x 19), 67130#(<= Main_x 18), 67133#(<= Main_x 21), 67132#(<= Main_x 20), 67135#(<= Main_x 23), 67134#(<= Main_x 22), 67137#(<= Main_x 25), 67136#(<= Main_x 24), 67139#(<= Main_x 27), 67138#(<= Main_x 26), 67141#(<= Main_x 29), 67140#(<= Main_x 28), 67143#(<= Main_x 31), 67142#(<= Main_x 30), 67145#(<= Main_x 33), 67144#(<= Main_x 32), 67147#(<= Main_x 35), 67146#(<= Main_x 34), 67149#(<= Main_x 37), 67148#(<= Main_x 36), 67151#(<= Main_x 39), 67150#(<= Main_x 38), 67153#(<= Main_x 41), 67152#(<= Main_x 40), 67155#(<= Main_x 43), 67154#(<= Main_x 42), 67157#(<= Main_x 45), 67156#(<= Main_x 44), 67159#(<= Main_x 47), 67158#(<= Main_x 46), 67161#(<= Main_x 49), 67160#(<= Main_x 48), 67163#(<= Main_x 51), 67162#(<= Main_x 50), 67165#(<= Main_x 53), 67164#(<= Main_x 52), 67167#(<= Main_x 55), 67166#(<= Main_x 54), 67169#(<= Main_x 57), 67168#(<= Main_x 56), 67171#(<= Main_x 59), 67170#(<= Main_x 58), 67173#(<= Main_x 61), 67172#(<= Main_x 60), 67175#(<= (+ Main_x 1) 0), 67174#(<= Main_x 62)] [2018-07-23 13:56:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:57,504 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:56:57,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:56:57,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:56:57,504 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 66 states. [2018-07-23 13:56:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:57,761 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2018-07-23 13:56:57,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:56:57,761 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-23 13:56:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:57,762 INFO L225 Difference]: With dead ends: 198 [2018-07-23 13:56:57,762 INFO L226 Difference]: Without dead ends: 131 [2018-07-23 13:56:57,762 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:56:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-23 13:56:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-23 13:56:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-23 13:56:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-07-23 13:56:57,871 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 130 [2018-07-23 13:56:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:57,871 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-07-23 13:56:57,871 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:56:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-07-23 13:56:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 13:56:57,871 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:57,871 INFO L357 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-07-23 13:56:57,872 INFO L414 AbstractCegarLoop]: === Iteration 189 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash 519259053, now seen corresponding path program 186 times [2018-07-23 13:56:57,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:58,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:58,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:56:58,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:58,018 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:56:58,018 INFO L185 omatonBuilderFactory]: Interpolants [67841#(<= 5 Main_x), 67840#(<= 4 Main_x), 67843#(<= 7 Main_x), 67842#(<= 6 Main_x), 67845#(<= 9 Main_x), 67844#(<= 8 Main_x), 67847#(<= 11 Main_x), 67846#(<= 10 Main_x), 67849#(<= 13 Main_x), 67848#(<= 12 Main_x), 67851#(<= 15 Main_x), 67850#(<= 14 Main_x), 67853#(<= 17 Main_x), 67852#(<= 16 Main_x), 67855#(<= 19 Main_x), 67854#(<= 18 Main_x), 67857#(<= 21 Main_x), 67856#(<= 20 Main_x), 67859#(<= 23 Main_x), 67858#(<= 22 Main_x), 67861#(<= 25 Main_x), 67860#(<= 24 Main_x), 67863#(<= 27 Main_x), 67862#(<= 26 Main_x), 67865#(<= 29 Main_x), 67864#(<= 28 Main_x), 67867#(<= 31 Main_x), 67866#(<= 30 Main_x), 67869#(<= 33 Main_x), 67868#(<= 32 Main_x), 67871#(<= 35 Main_x), 67870#(<= 34 Main_x), 67873#(<= 37 Main_x), 67872#(<= 36 Main_x), 67875#(<= 39 Main_x), 67874#(<= 38 Main_x), 67877#(<= 41 Main_x), 67876#(<= 40 Main_x), 67879#(<= 43 Main_x), 67878#(<= 42 Main_x), 67881#(<= 45 Main_x), 67880#(<= 44 Main_x), 67883#(<= 47 Main_x), 67882#(<= 46 Main_x), 67885#(<= 49 Main_x), 67884#(<= 48 Main_x), 67887#(<= 51 Main_x), 67886#(<= 50 Main_x), 67889#(<= 53 Main_x), 67888#(<= 52 Main_x), 67891#(<= 55 Main_x), 67890#(<= 54 Main_x), 67893#(<= 57 Main_x), 67892#(<= 56 Main_x), 67895#(<= 59 Main_x), 67894#(<= 58 Main_x), 67897#(<= 61 Main_x), 67896#(<= 60 Main_x), 67899#(<= 63 Main_x), 67898#(<= 62 Main_x), 67835#false, 67834#true, 67837#(<= 1 Main_x), 67836#(<= 0 Main_x), 67839#(<= 3 Main_x), 67838#(<= 2 Main_x)] [2018-07-23 13:56:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:58,018 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:56:58,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:56:58,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:56:58,019 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-07-23 13:56:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:58,124 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-07-23 13:56:58,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:56:58,124 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-23 13:56:58,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:58,124 INFO L225 Difference]: With dead ends: 135 [2018-07-23 13:56:58,124 INFO L226 Difference]: Without dead ends: 132 [2018-07-23 13:56:58,125 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:56:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-23 13:56:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-23 13:56:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-23 13:56:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-07-23 13:56:58,198 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 130 [2018-07-23 13:56:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:58,199 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-07-23 13:56:58,199 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:56:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-07-23 13:56:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-23 13:56:58,199 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:58,199 INFO L357 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1] [2018-07-23 13:56:58,199 INFO L414 AbstractCegarLoop]: === Iteration 190 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:58,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1082900063, now seen corresponding path program 187 times [2018-07-23 13:56:58,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:58,468 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:58,468 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:56:58,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:58,468 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:56:58,468 INFO L185 omatonBuilderFactory]: Interpolants [68481#(and (<= Main_y 45) (<= 45 Main_y)), 68480#(and (<= 44 Main_y) (<= Main_y 44)), 68483#(and (<= 47 Main_y) (<= Main_y 47)), 68482#(and (<= 46 Main_y) (<= Main_y 46)), 68485#(and (<= 49 Main_y) (<= Main_y 49)), 68484#(and (<= 48 Main_y) (<= Main_y 48)), 68487#(and (<= 51 Main_y) (<= Main_y 51)), 68486#(and (<= 50 Main_y) (<= Main_y 50)), 68489#(and (<= 53 Main_y) (<= Main_y 53)), 68488#(and (<= 52 Main_y) (<= Main_y 52)), 68491#(and (<= 55 Main_y) (<= Main_y 55)), 68490#(and (<= 54 Main_y) (<= Main_y 54)), 68493#(and (<= Main_y 57) (<= 57 Main_y)), 68492#(and (<= Main_y 56) (<= 56 Main_y)), 68495#(and (<= Main_y 59) (<= 59 Main_y)), 68494#(and (<= Main_y 58) (<= 58 Main_y)), 68497#(and (<= Main_y 61) (<= 61 Main_y)), 68496#(and (<= Main_y 60) (<= 60 Main_y)), 68499#(and (<= 63 Main_y) (<= Main_y 63)), 68498#(and (<= 62 Main_y) (<= Main_y 62)), 68435#false, 68434#true, 68437#(and (<= 1 Main_y) (<= Main_y 1)), 68436#(and (<= 0 Main_y) (<= Main_y 0)), 68439#(and (<= Main_y 3) (<= 3 Main_y)), 68438#(and (<= Main_y 2) (<= 2 Main_y)), 68441#(and (<= Main_y 5) (<= 5 Main_y)), 68440#(and (<= Main_y 4) (<= 4 Main_y)), 68443#(and (<= 7 Main_y) (<= Main_y 7)), 68442#(and (<= Main_y 6) (<= 6 Main_y)), 68445#(and (<= Main_y 9) (<= 9 Main_y)), 68444#(and (<= 8 Main_y) (<= Main_y 8)), 68447#(and (<= 11 Main_y) (<= Main_y 11)), 68446#(and (<= 10 Main_y) (<= Main_y 10)), 68449#(and (<= 13 Main_y) (<= Main_y 13)), 68448#(and (<= 12 Main_y) (<= Main_y 12)), 68451#(and (<= Main_y 15) (<= 15 Main_y)), 68450#(and (<= 14 Main_y) (<= Main_y 14)), 68453#(and (<= Main_y 17) (<= 17 Main_y)), 68452#(and (<= 16 Main_y) (<= Main_y 16)), 68455#(and (<= Main_y 19) (<= 19 Main_y)), 68454#(and (<= Main_y 18) (<= 18 Main_y)), 68457#(and (<= 21 Main_y) (<= Main_y 21)), 68456#(and (<= 20 Main_y) (<= Main_y 20)), 68459#(and (<= 23 Main_y) (<= Main_y 23)), 68458#(and (<= Main_y 22) (<= 22 Main_y)), 68461#(and (<= 25 Main_y) (<= Main_y 25)), 68460#(and (<= Main_y 24) (<= 24 Main_y)), 68463#(and (<= 27 Main_y) (<= Main_y 27)), 68462#(and (<= Main_y 26) (<= 26 Main_y)), 68465#(and (<= 29 Main_y) (<= Main_y 29)), 68464#(and (<= 28 Main_y) (<= Main_y 28)), 68467#(and (<= Main_y 31) (<= 31 Main_y)), 68466#(and (<= 30 Main_y) (<= Main_y 30)), 68469#(and (<= 33 Main_y) (<= Main_y 33)), 68468#(and (<= 32 Main_y) (<= Main_y 32)), 68471#(and (<= 35 Main_y) (<= Main_y 35)), 68470#(and (<= Main_y 34) (<= 34 Main_y)), 68473#(and (<= Main_y 37) (<= 37 Main_y)), 68472#(and (<= 36 Main_y) (<= Main_y 36)), 68475#(and (<= 39 Main_y) (<= Main_y 39)), 68474#(and (<= Main_y 38) (<= 38 Main_y)), 68477#(and (<= Main_y 41) (<= 41 Main_y)), 68476#(and (<= 40 Main_y) (<= Main_y 40)), 68479#(and (<= 43 Main_y) (<= Main_y 43)), 68478#(and (<= 42 Main_y) (<= Main_y 42))] [2018-07-23 13:56:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:58,469 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:56:58,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:56:58,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:56:58,469 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 66 states. [2018-07-23 13:56:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:59,026 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2018-07-23 13:56:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:56:59,026 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 131 [2018-07-23 13:56:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:59,026 INFO L225 Difference]: With dead ends: 200 [2018-07-23 13:56:59,026 INFO L226 Difference]: Without dead ends: 197 [2018-07-23 13:56:59,027 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:56:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-23 13:56:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 134. [2018-07-23 13:56:59,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-23 13:56:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-07-23 13:56:59,109 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 131 [2018-07-23 13:56:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:59,109 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-07-23 13:56:59,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:56:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-07-23 13:56:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 13:56:59,110 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:59,110 INFO L357 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-07-23 13:56:59,110 INFO L414 AbstractCegarLoop]: === Iteration 191 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 789774893, now seen corresponding path program 188 times [2018-07-23 13:56:59,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:59,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:59,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:56:59,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:59,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:56:59,319 INFO L185 omatonBuilderFactory]: Interpolants [69169#false, 69168#true, 69171#(<= Main_x 1), 69170#(<= Main_x 0), 69173#(<= Main_x 3), 69172#(<= Main_x 2), 69175#(<= Main_x 5), 69174#(<= Main_x 4), 69177#(<= Main_x 7), 69176#(<= Main_x 6), 69179#(<= Main_x 9), 69178#(<= Main_x 8), 69181#(<= Main_x 11), 69180#(<= Main_x 10), 69183#(<= Main_x 13), 69182#(<= Main_x 12), 69185#(<= Main_x 15), 69184#(<= Main_x 14), 69187#(<= Main_x 17), 69186#(<= Main_x 16), 69189#(<= Main_x 19), 69188#(<= Main_x 18), 69191#(<= Main_x 21), 69190#(<= Main_x 20), 69193#(<= Main_x 23), 69192#(<= Main_x 22), 69195#(<= Main_x 25), 69194#(<= Main_x 24), 69197#(<= Main_x 27), 69196#(<= Main_x 26), 69199#(<= Main_x 29), 69198#(<= Main_x 28), 69201#(<= Main_x 31), 69200#(<= Main_x 30), 69203#(<= Main_x 33), 69202#(<= Main_x 32), 69205#(<= Main_x 35), 69204#(<= Main_x 34), 69207#(<= Main_x 37), 69206#(<= Main_x 36), 69209#(<= Main_x 39), 69208#(<= Main_x 38), 69211#(<= Main_x 41), 69210#(<= Main_x 40), 69213#(<= Main_x 43), 69212#(<= Main_x 42), 69215#(<= Main_x 45), 69214#(<= Main_x 44), 69217#(<= Main_x 47), 69216#(<= Main_x 46), 69219#(<= Main_x 49), 69218#(<= Main_x 48), 69221#(<= Main_x 51), 69220#(<= Main_x 50), 69223#(<= Main_x 53), 69222#(<= Main_x 52), 69225#(<= Main_x 55), 69224#(<= Main_x 54), 69227#(<= Main_x 57), 69226#(<= Main_x 56), 69229#(<= Main_x 59), 69228#(<= Main_x 58), 69231#(<= Main_x 61), 69230#(<= Main_x 60), 69233#(<= Main_x 63), 69232#(<= Main_x 62), 69234#(<= (+ Main_x 1) 0)] [2018-07-23 13:56:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:59,319 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:56:59,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:56:59,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:56:59,320 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 67 states. [2018-07-23 13:56:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:59,545 INFO L93 Difference]: Finished difference Result 201 states and 203 transitions. [2018-07-23 13:56:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:56:59,545 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-23 13:56:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:59,546 INFO L225 Difference]: With dead ends: 201 [2018-07-23 13:56:59,546 INFO L226 Difference]: Without dead ends: 133 [2018-07-23 13:56:59,546 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:56:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-23 13:56:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-23 13:56:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 13:56:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-07-23 13:56:59,657 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 132 [2018-07-23 13:56:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:56:59,657 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-07-23 13:56:59,657 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:56:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-07-23 13:56:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 13:56:59,658 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:56:59,658 INFO L357 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-07-23 13:56:59,658 INFO L414 AbstractCegarLoop]: === Iteration 192 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:56:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2135321657, now seen corresponding path program 189 times [2018-07-23 13:56:59,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:56:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:56:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:59,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:56:59,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:56:59,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:56:59,820 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:56:59,820 INFO L185 omatonBuilderFactory]: Interpolants [69903#true, 69905#(<= 0 Main_x), 69904#false, 69907#(<= 2 Main_x), 69906#(<= 1 Main_x), 69909#(<= 4 Main_x), 69908#(<= 3 Main_x), 69911#(<= 6 Main_x), 69910#(<= 5 Main_x), 69913#(<= 8 Main_x), 69912#(<= 7 Main_x), 69915#(<= 10 Main_x), 69914#(<= 9 Main_x), 69917#(<= 12 Main_x), 69916#(<= 11 Main_x), 69919#(<= 14 Main_x), 69918#(<= 13 Main_x), 69921#(<= 16 Main_x), 69920#(<= 15 Main_x), 69923#(<= 18 Main_x), 69922#(<= 17 Main_x), 69925#(<= 20 Main_x), 69924#(<= 19 Main_x), 69927#(<= 22 Main_x), 69926#(<= 21 Main_x), 69929#(<= 24 Main_x), 69928#(<= 23 Main_x), 69931#(<= 26 Main_x), 69930#(<= 25 Main_x), 69933#(<= 28 Main_x), 69932#(<= 27 Main_x), 69935#(<= 30 Main_x), 69934#(<= 29 Main_x), 69937#(<= 32 Main_x), 69936#(<= 31 Main_x), 69939#(<= 34 Main_x), 69938#(<= 33 Main_x), 69941#(<= 36 Main_x), 69940#(<= 35 Main_x), 69943#(<= 38 Main_x), 69942#(<= 37 Main_x), 69945#(<= 40 Main_x), 69944#(<= 39 Main_x), 69947#(<= 42 Main_x), 69946#(<= 41 Main_x), 69949#(<= 44 Main_x), 69948#(<= 43 Main_x), 69951#(<= 46 Main_x), 69950#(<= 45 Main_x), 69953#(<= 48 Main_x), 69952#(<= 47 Main_x), 69955#(<= 50 Main_x), 69954#(<= 49 Main_x), 69957#(<= 52 Main_x), 69956#(<= 51 Main_x), 69959#(<= 54 Main_x), 69958#(<= 53 Main_x), 69961#(<= 56 Main_x), 69960#(<= 55 Main_x), 69963#(<= 58 Main_x), 69962#(<= 57 Main_x), 69965#(<= 60 Main_x), 69964#(<= 59 Main_x), 69967#(<= 62 Main_x), 69966#(<= 61 Main_x), 69969#(<= 64 Main_x), 69968#(<= 63 Main_x)] [2018-07-23 13:56:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:56:59,821 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:56:59,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:56:59,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:56:59,822 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-07-23 13:56:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:56:59,930 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-07-23 13:56:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:56:59,930 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-23 13:56:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:56:59,931 INFO L225 Difference]: With dead ends: 137 [2018-07-23 13:56:59,931 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 13:56:59,931 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:56:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 13:57:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-23 13:57:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-23 13:57:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-07-23 13:57:00,015 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 132 [2018-07-23 13:57:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:00,016 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-07-23 13:57:00,016 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:57:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-07-23 13:57:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-23 13:57:00,016 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:00,017 INFO L357 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1] [2018-07-23 13:57:00,017 INFO L414 AbstractCegarLoop]: === Iteration 193 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:00,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1770523449, now seen corresponding path program 190 times [2018-07-23 13:57:00,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:00,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:00,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:57:00,261 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:00,262 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:57:00,262 INFO L185 omatonBuilderFactory]: Interpolants [70529#(and (<= Main_y 15) (<= 15 Main_y)), 70528#(and (<= 14 Main_y) (<= Main_y 14)), 70531#(and (<= Main_y 17) (<= 17 Main_y)), 70530#(and (<= 16 Main_y) (<= Main_y 16)), 70533#(and (<= Main_y 19) (<= 19 Main_y)), 70532#(and (<= Main_y 18) (<= 18 Main_y)), 70535#(and (<= 21 Main_y) (<= Main_y 21)), 70534#(and (<= 20 Main_y) (<= Main_y 20)), 70537#(and (<= 23 Main_y) (<= Main_y 23)), 70536#(and (<= Main_y 22) (<= 22 Main_y)), 70539#(and (<= 25 Main_y) (<= Main_y 25)), 70538#(and (<= Main_y 24) (<= 24 Main_y)), 70541#(and (<= 27 Main_y) (<= Main_y 27)), 70540#(and (<= Main_y 26) (<= 26 Main_y)), 70543#(and (<= 29 Main_y) (<= Main_y 29)), 70542#(and (<= 28 Main_y) (<= Main_y 28)), 70545#(and (<= Main_y 31) (<= 31 Main_y)), 70544#(and (<= 30 Main_y) (<= Main_y 30)), 70547#(and (<= 33 Main_y) (<= Main_y 33)), 70546#(and (<= 32 Main_y) (<= Main_y 32)), 70549#(and (<= 35 Main_y) (<= Main_y 35)), 70548#(and (<= Main_y 34) (<= 34 Main_y)), 70551#(and (<= Main_y 37) (<= 37 Main_y)), 70550#(and (<= 36 Main_y) (<= Main_y 36)), 70553#(and (<= 39 Main_y) (<= Main_y 39)), 70552#(and (<= Main_y 38) (<= 38 Main_y)), 70555#(and (<= Main_y 41) (<= 41 Main_y)), 70554#(and (<= 40 Main_y) (<= Main_y 40)), 70557#(and (<= 43 Main_y) (<= Main_y 43)), 70556#(and (<= 42 Main_y) (<= Main_y 42)), 70559#(and (<= Main_y 45) (<= 45 Main_y)), 70558#(and (<= 44 Main_y) (<= Main_y 44)), 70561#(and (<= 47 Main_y) (<= Main_y 47)), 70560#(and (<= 46 Main_y) (<= Main_y 46)), 70563#(and (<= 49 Main_y) (<= Main_y 49)), 70562#(and (<= 48 Main_y) (<= Main_y 48)), 70565#(and (<= 51 Main_y) (<= Main_y 51)), 70564#(and (<= 50 Main_y) (<= Main_y 50)), 70567#(and (<= 53 Main_y) (<= Main_y 53)), 70566#(and (<= 52 Main_y) (<= Main_y 52)), 70569#(and (<= 55 Main_y) (<= Main_y 55)), 70568#(and (<= 54 Main_y) (<= Main_y 54)), 70571#(and (<= Main_y 57) (<= 57 Main_y)), 70570#(and (<= Main_y 56) (<= 56 Main_y)), 70573#(and (<= Main_y 59) (<= 59 Main_y)), 70572#(and (<= Main_y 58) (<= 58 Main_y)), 70575#(and (<= Main_y 61) (<= 61 Main_y)), 70574#(and (<= Main_y 60) (<= 60 Main_y)), 70577#(and (<= 63 Main_y) (<= Main_y 63)), 70576#(and (<= 62 Main_y) (<= Main_y 62)), 70578#(and (<= 64 Main_y) (<= Main_y 64)), 70513#false, 70512#true, 70515#(and (<= 1 Main_y) (<= Main_y 1)), 70514#(and (<= 0 Main_y) (<= Main_y 0)), 70517#(and (<= Main_y 3) (<= 3 Main_y)), 70516#(and (<= Main_y 2) (<= 2 Main_y)), 70519#(and (<= Main_y 5) (<= 5 Main_y)), 70518#(and (<= Main_y 4) (<= 4 Main_y)), 70521#(and (<= 7 Main_y) (<= Main_y 7)), 70520#(and (<= Main_y 6) (<= 6 Main_y)), 70523#(and (<= Main_y 9) (<= 9 Main_y)), 70522#(and (<= 8 Main_y) (<= Main_y 8)), 70525#(and (<= 11 Main_y) (<= Main_y 11)), 70524#(and (<= 10 Main_y) (<= Main_y 10)), 70527#(and (<= 13 Main_y) (<= Main_y 13)), 70526#(and (<= 12 Main_y) (<= Main_y 12))] [2018-07-23 13:57:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:00,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:57:00,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:57:00,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:57:00,263 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 67 states. [2018-07-23 13:57:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:00,848 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2018-07-23 13:57:00,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:57:00,848 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 133 [2018-07-23 13:57:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:00,849 INFO L225 Difference]: With dead ends: 203 [2018-07-23 13:57:00,849 INFO L226 Difference]: Without dead ends: 200 [2018-07-23 13:57:00,849 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:57:00,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-23 13:57:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2018-07-23 13:57:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-23 13:57:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-07-23 13:57:00,930 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2018-07-23 13:57:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:00,930 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-07-23 13:57:00,930 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:57:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-07-23 13:57:00,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-23 13:57:00,931 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:00,931 INFO L357 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-07-23 13:57:00,931 INFO L414 AbstractCegarLoop]: === Iteration 194 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:00,931 INFO L82 PathProgramCache]: Analyzing trace with hash 948286407, now seen corresponding path program 191 times [2018-07-23 13:57:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:01,126 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:01,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:57:01,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:01,127 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:57:01,127 INFO L185 omatonBuilderFactory]: Interpolants [71297#(<= Main_x 38), 71296#(<= Main_x 37), 71299#(<= Main_x 40), 71298#(<= Main_x 39), 71301#(<= Main_x 42), 71300#(<= Main_x 41), 71303#(<= Main_x 44), 71302#(<= Main_x 43), 71305#(<= Main_x 46), 71304#(<= Main_x 45), 71307#(<= Main_x 48), 71306#(<= Main_x 47), 71309#(<= Main_x 50), 71308#(<= Main_x 49), 71311#(<= Main_x 52), 71310#(<= Main_x 51), 71313#(<= Main_x 54), 71312#(<= Main_x 53), 71315#(<= Main_x 56), 71314#(<= Main_x 55), 71317#(<= Main_x 58), 71316#(<= Main_x 57), 71319#(<= Main_x 60), 71318#(<= Main_x 59), 71321#(<= Main_x 62), 71320#(<= Main_x 61), 71323#(<= Main_x 64), 71322#(<= Main_x 63), 71324#(<= (+ Main_x 1) 0), 71257#true, 71259#(<= Main_x 0), 71258#false, 71261#(<= Main_x 2), 71260#(<= Main_x 1), 71263#(<= Main_x 4), 71262#(<= Main_x 3), 71265#(<= Main_x 6), 71264#(<= Main_x 5), 71267#(<= Main_x 8), 71266#(<= Main_x 7), 71269#(<= Main_x 10), 71268#(<= Main_x 9), 71271#(<= Main_x 12), 71270#(<= Main_x 11), 71273#(<= Main_x 14), 71272#(<= Main_x 13), 71275#(<= Main_x 16), 71274#(<= Main_x 15), 71277#(<= Main_x 18), 71276#(<= Main_x 17), 71279#(<= Main_x 20), 71278#(<= Main_x 19), 71281#(<= Main_x 22), 71280#(<= Main_x 21), 71283#(<= Main_x 24), 71282#(<= Main_x 23), 71285#(<= Main_x 26), 71284#(<= Main_x 25), 71287#(<= Main_x 28), 71286#(<= Main_x 27), 71289#(<= Main_x 30), 71288#(<= Main_x 29), 71291#(<= Main_x 32), 71290#(<= Main_x 31), 71293#(<= Main_x 34), 71292#(<= Main_x 33), 71295#(<= Main_x 36), 71294#(<= Main_x 35)] [2018-07-23 13:57:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:01,127 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:57:01,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:57:01,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:57:01,128 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 68 states. [2018-07-23 13:57:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:01,323 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2018-07-23 13:57:01,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:57:01,323 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-23 13:57:01,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:01,324 INFO L225 Difference]: With dead ends: 204 [2018-07-23 13:57:01,324 INFO L226 Difference]: Without dead ends: 135 [2018-07-23 13:57:01,324 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:57:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-23 13:57:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-23 13:57:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-23 13:57:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-07-23 13:57:01,400 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 134 [2018-07-23 13:57:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:01,400 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-07-23 13:57:01,400 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:57:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-07-23 13:57:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-23 13:57:01,401 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:01,401 INFO L357 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-07-23 13:57:01,401 INFO L414 AbstractCegarLoop]: === Iteration 195 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:01,401 INFO L82 PathProgramCache]: Analyzing trace with hash 464606573, now seen corresponding path program 192 times [2018-07-23 13:57:01,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:01,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:01,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:57:01,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:01,561 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:57:01,561 INFO L185 omatonBuilderFactory]: Interpolants [72065#(<= 60 Main_x), 72064#(<= 59 Main_x), 72067#(<= 62 Main_x), 72066#(<= 61 Main_x), 72069#(<= 64 Main_x), 72068#(<= 63 Main_x), 72070#(<= 65 Main_x), 72003#true, 72005#(<= 0 Main_x), 72004#false, 72007#(<= 2 Main_x), 72006#(<= 1 Main_x), 72009#(<= 4 Main_x), 72008#(<= 3 Main_x), 72011#(<= 6 Main_x), 72010#(<= 5 Main_x), 72013#(<= 8 Main_x), 72012#(<= 7 Main_x), 72015#(<= 10 Main_x), 72014#(<= 9 Main_x), 72017#(<= 12 Main_x), 72016#(<= 11 Main_x), 72019#(<= 14 Main_x), 72018#(<= 13 Main_x), 72021#(<= 16 Main_x), 72020#(<= 15 Main_x), 72023#(<= 18 Main_x), 72022#(<= 17 Main_x), 72025#(<= 20 Main_x), 72024#(<= 19 Main_x), 72027#(<= 22 Main_x), 72026#(<= 21 Main_x), 72029#(<= 24 Main_x), 72028#(<= 23 Main_x), 72031#(<= 26 Main_x), 72030#(<= 25 Main_x), 72033#(<= 28 Main_x), 72032#(<= 27 Main_x), 72035#(<= 30 Main_x), 72034#(<= 29 Main_x), 72037#(<= 32 Main_x), 72036#(<= 31 Main_x), 72039#(<= 34 Main_x), 72038#(<= 33 Main_x), 72041#(<= 36 Main_x), 72040#(<= 35 Main_x), 72043#(<= 38 Main_x), 72042#(<= 37 Main_x), 72045#(<= 40 Main_x), 72044#(<= 39 Main_x), 72047#(<= 42 Main_x), 72046#(<= 41 Main_x), 72049#(<= 44 Main_x), 72048#(<= 43 Main_x), 72051#(<= 46 Main_x), 72050#(<= 45 Main_x), 72053#(<= 48 Main_x), 72052#(<= 47 Main_x), 72055#(<= 50 Main_x), 72054#(<= 49 Main_x), 72057#(<= 52 Main_x), 72056#(<= 51 Main_x), 72059#(<= 54 Main_x), 72058#(<= 53 Main_x), 72061#(<= 56 Main_x), 72060#(<= 55 Main_x), 72063#(<= 58 Main_x), 72062#(<= 57 Main_x)] [2018-07-23 13:57:01,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:01,562 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:57:01,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:57:01,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:57:01,562 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-07-23 13:57:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:01,670 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-07-23 13:57:01,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:57:01,670 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-23 13:57:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:01,671 INFO L225 Difference]: With dead ends: 139 [2018-07-23 13:57:01,671 INFO L226 Difference]: Without dead ends: 136 [2018-07-23 13:57:01,671 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:57:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-23 13:57:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-23 13:57:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-23 13:57:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-07-23 13:57:01,750 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-07-23 13:57:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:01,750 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-07-23 13:57:01,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:57:01,751 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-07-23 13:57:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-23 13:57:01,751 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:01,751 INFO L357 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1] [2018-07-23 13:57:01,751 INFO L414 AbstractCegarLoop]: === Iteration 196 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1517840353, now seen corresponding path program 193 times [2018-07-23 13:57:01,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:01,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:01,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:57:01,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:01,991 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:57:01,991 INFO L185 omatonBuilderFactory]: Interpolants [72621#true, 72623#(and (<= 0 Main_y) (<= Main_y 0)), 72622#false, 72625#(and (<= Main_y 2) (<= 2 Main_y)), 72624#(and (<= 1 Main_y) (<= Main_y 1)), 72627#(and (<= Main_y 4) (<= 4 Main_y)), 72626#(and (<= Main_y 3) (<= 3 Main_y)), 72629#(and (<= Main_y 6) (<= 6 Main_y)), 72628#(and (<= Main_y 5) (<= 5 Main_y)), 72631#(and (<= 8 Main_y) (<= Main_y 8)), 72630#(and (<= 7 Main_y) (<= Main_y 7)), 72633#(and (<= 10 Main_y) (<= Main_y 10)), 72632#(and (<= Main_y 9) (<= 9 Main_y)), 72635#(and (<= 12 Main_y) (<= Main_y 12)), 72634#(and (<= 11 Main_y) (<= Main_y 11)), 72637#(and (<= 14 Main_y) (<= Main_y 14)), 72636#(and (<= 13 Main_y) (<= Main_y 13)), 72639#(and (<= 16 Main_y) (<= Main_y 16)), 72638#(and (<= Main_y 15) (<= 15 Main_y)), 72641#(and (<= Main_y 18) (<= 18 Main_y)), 72640#(and (<= Main_y 17) (<= 17 Main_y)), 72643#(and (<= 20 Main_y) (<= Main_y 20)), 72642#(and (<= Main_y 19) (<= 19 Main_y)), 72645#(and (<= Main_y 22) (<= 22 Main_y)), 72644#(and (<= 21 Main_y) (<= Main_y 21)), 72647#(and (<= Main_y 24) (<= 24 Main_y)), 72646#(and (<= 23 Main_y) (<= Main_y 23)), 72649#(and (<= Main_y 26) (<= 26 Main_y)), 72648#(and (<= 25 Main_y) (<= Main_y 25)), 72651#(and (<= 28 Main_y) (<= Main_y 28)), 72650#(and (<= 27 Main_y) (<= Main_y 27)), 72653#(and (<= 30 Main_y) (<= Main_y 30)), 72652#(and (<= 29 Main_y) (<= Main_y 29)), 72655#(and (<= 32 Main_y) (<= Main_y 32)), 72654#(and (<= Main_y 31) (<= 31 Main_y)), 72657#(and (<= Main_y 34) (<= 34 Main_y)), 72656#(and (<= 33 Main_y) (<= Main_y 33)), 72659#(and (<= 36 Main_y) (<= Main_y 36)), 72658#(and (<= 35 Main_y) (<= Main_y 35)), 72661#(and (<= Main_y 38) (<= 38 Main_y)), 72660#(and (<= Main_y 37) (<= 37 Main_y)), 72663#(and (<= 40 Main_y) (<= Main_y 40)), 72662#(and (<= 39 Main_y) (<= Main_y 39)), 72665#(and (<= 42 Main_y) (<= Main_y 42)), 72664#(and (<= Main_y 41) (<= 41 Main_y)), 72667#(and (<= 44 Main_y) (<= Main_y 44)), 72666#(and (<= 43 Main_y) (<= Main_y 43)), 72669#(and (<= 46 Main_y) (<= Main_y 46)), 72668#(and (<= Main_y 45) (<= 45 Main_y)), 72671#(and (<= 48 Main_y) (<= Main_y 48)), 72670#(and (<= 47 Main_y) (<= Main_y 47)), 72673#(and (<= 50 Main_y) (<= Main_y 50)), 72672#(and (<= 49 Main_y) (<= Main_y 49)), 72675#(and (<= 52 Main_y) (<= Main_y 52)), 72674#(and (<= 51 Main_y) (<= Main_y 51)), 72677#(and (<= 54 Main_y) (<= Main_y 54)), 72676#(and (<= 53 Main_y) (<= Main_y 53)), 72679#(and (<= Main_y 56) (<= 56 Main_y)), 72678#(and (<= 55 Main_y) (<= Main_y 55)), 72681#(and (<= Main_y 58) (<= 58 Main_y)), 72680#(and (<= Main_y 57) (<= 57 Main_y)), 72683#(and (<= Main_y 60) (<= 60 Main_y)), 72682#(and (<= Main_y 59) (<= 59 Main_y)), 72685#(and (<= 62 Main_y) (<= Main_y 62)), 72684#(and (<= Main_y 61) (<= 61 Main_y)), 72687#(and (<= 64 Main_y) (<= Main_y 64)), 72686#(and (<= 63 Main_y) (<= Main_y 63)), 72688#(and (<= Main_y 65) (<= 65 Main_y))] [2018-07-23 13:57:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:01,992 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:57:01,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:57:01,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:57:01,992 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 68 states. [2018-07-23 13:57:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:02,571 INFO L93 Difference]: Finished difference Result 206 states and 208 transitions. [2018-07-23 13:57:02,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:57:02,571 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 135 [2018-07-23 13:57:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:02,572 INFO L225 Difference]: With dead ends: 206 [2018-07-23 13:57:02,572 INFO L226 Difference]: Without dead ends: 203 [2018-07-23 13:57:02,573 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:57:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-23 13:57:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 138. [2018-07-23 13:57:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-23 13:57:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-07-23 13:57:02,665 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 135 [2018-07-23 13:57:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:02,665 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-07-23 13:57:02,665 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:57:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-07-23 13:57:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 13:57:02,666 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:02,666 INFO L357 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-07-23 13:57:02,666 INFO L414 AbstractCegarLoop]: === Iteration 197 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash -191650835, now seen corresponding path program 194 times [2018-07-23 13:57:02,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:02,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:02,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:57:02,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:02,851 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:57:02,851 INFO L185 omatonBuilderFactory]: Interpolants [73377#true, 73379#(<= Main_x 0), 73378#false, 73381#(<= Main_x 2), 73380#(<= Main_x 1), 73383#(<= Main_x 4), 73382#(<= Main_x 3), 73385#(<= Main_x 6), 73384#(<= Main_x 5), 73387#(<= Main_x 8), 73386#(<= Main_x 7), 73389#(<= Main_x 10), 73388#(<= Main_x 9), 73391#(<= Main_x 12), 73390#(<= Main_x 11), 73393#(<= Main_x 14), 73392#(<= Main_x 13), 73395#(<= Main_x 16), 73394#(<= Main_x 15), 73397#(<= Main_x 18), 73396#(<= Main_x 17), 73399#(<= Main_x 20), 73398#(<= Main_x 19), 73401#(<= Main_x 22), 73400#(<= Main_x 21), 73403#(<= Main_x 24), 73402#(<= Main_x 23), 73405#(<= Main_x 26), 73404#(<= Main_x 25), 73407#(<= Main_x 28), 73406#(<= Main_x 27), 73409#(<= Main_x 30), 73408#(<= Main_x 29), 73411#(<= Main_x 32), 73410#(<= Main_x 31), 73413#(<= Main_x 34), 73412#(<= Main_x 33), 73415#(<= Main_x 36), 73414#(<= Main_x 35), 73417#(<= Main_x 38), 73416#(<= Main_x 37), 73419#(<= Main_x 40), 73418#(<= Main_x 39), 73421#(<= Main_x 42), 73420#(<= Main_x 41), 73423#(<= Main_x 44), 73422#(<= Main_x 43), 73425#(<= Main_x 46), 73424#(<= Main_x 45), 73427#(<= Main_x 48), 73426#(<= Main_x 47), 73429#(<= Main_x 50), 73428#(<= Main_x 49), 73431#(<= Main_x 52), 73430#(<= Main_x 51), 73433#(<= Main_x 54), 73432#(<= Main_x 53), 73435#(<= Main_x 56), 73434#(<= Main_x 55), 73437#(<= Main_x 58), 73436#(<= Main_x 57), 73439#(<= Main_x 60), 73438#(<= Main_x 59), 73441#(<= Main_x 62), 73440#(<= Main_x 61), 73443#(<= Main_x 64), 73442#(<= Main_x 63), 73445#(<= (+ Main_x 1) 0), 73444#(<= Main_x 65)] [2018-07-23 13:57:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:02,851 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:57:02,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:57:02,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:57:02,852 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 69 states. [2018-07-23 13:57:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:03,125 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-07-23 13:57:03,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:57:03,125 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-23 13:57:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:03,126 INFO L225 Difference]: With dead ends: 207 [2018-07-23 13:57:03,126 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 13:57:03,126 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:57:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 13:57:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-23 13:57:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 13:57:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-07-23 13:57:03,215 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 136 [2018-07-23 13:57:03,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:03,216 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-07-23 13:57:03,216 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:57:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-07-23 13:57:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 13:57:03,216 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:03,216 INFO L357 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-07-23 13:57:03,216 INFO L414 AbstractCegarLoop]: === Iteration 198 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1994143495, now seen corresponding path program 195 times [2018-07-23 13:57:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:03,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:03,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:57:03,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:03,409 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:57:03,409 INFO L185 omatonBuilderFactory]: Interpolants [74135#false, 74134#true, 74137#(<= 1 Main_x), 74136#(<= 0 Main_x), 74139#(<= 3 Main_x), 74138#(<= 2 Main_x), 74141#(<= 5 Main_x), 74140#(<= 4 Main_x), 74143#(<= 7 Main_x), 74142#(<= 6 Main_x), 74145#(<= 9 Main_x), 74144#(<= 8 Main_x), 74147#(<= 11 Main_x), 74146#(<= 10 Main_x), 74149#(<= 13 Main_x), 74148#(<= 12 Main_x), 74151#(<= 15 Main_x), 74150#(<= 14 Main_x), 74153#(<= 17 Main_x), 74152#(<= 16 Main_x), 74155#(<= 19 Main_x), 74154#(<= 18 Main_x), 74157#(<= 21 Main_x), 74156#(<= 20 Main_x), 74159#(<= 23 Main_x), 74158#(<= 22 Main_x), 74161#(<= 25 Main_x), 74160#(<= 24 Main_x), 74163#(<= 27 Main_x), 74162#(<= 26 Main_x), 74165#(<= 29 Main_x), 74164#(<= 28 Main_x), 74167#(<= 31 Main_x), 74166#(<= 30 Main_x), 74169#(<= 33 Main_x), 74168#(<= 32 Main_x), 74171#(<= 35 Main_x), 74170#(<= 34 Main_x), 74173#(<= 37 Main_x), 74172#(<= 36 Main_x), 74175#(<= 39 Main_x), 74174#(<= 38 Main_x), 74177#(<= 41 Main_x), 74176#(<= 40 Main_x), 74179#(<= 43 Main_x), 74178#(<= 42 Main_x), 74181#(<= 45 Main_x), 74180#(<= 44 Main_x), 74183#(<= 47 Main_x), 74182#(<= 46 Main_x), 74185#(<= 49 Main_x), 74184#(<= 48 Main_x), 74187#(<= 51 Main_x), 74186#(<= 50 Main_x), 74189#(<= 53 Main_x), 74188#(<= 52 Main_x), 74191#(<= 55 Main_x), 74190#(<= 54 Main_x), 74193#(<= 57 Main_x), 74192#(<= 56 Main_x), 74195#(<= 59 Main_x), 74194#(<= 58 Main_x), 74197#(<= 61 Main_x), 74196#(<= 60 Main_x), 74199#(<= 63 Main_x), 74198#(<= 62 Main_x), 74201#(<= 65 Main_x), 74200#(<= 64 Main_x), 74202#(<= 66 Main_x)] [2018-07-23 13:57:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:03,409 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:57:03,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:57:03,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:57:03,410 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-07-23 13:57:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:03,573 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-07-23 13:57:03,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:57:03,573 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-23 13:57:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:03,574 INFO L225 Difference]: With dead ends: 141 [2018-07-23 13:57:03,574 INFO L226 Difference]: Without dead ends: 138 [2018-07-23 13:57:03,574 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:57:03,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-23 13:57:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-23 13:57:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-23 13:57:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-07-23 13:57:03,678 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 136 [2018-07-23 13:57:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-07-23 13:57:03,678 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:57:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-07-23 13:57:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-23 13:57:03,679 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:03,679 INFO L357 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1] [2018-07-23 13:57:03,679 INFO L414 AbstractCegarLoop]: === Iteration 199 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1688844679, now seen corresponding path program 196 times [2018-07-23 13:57:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:03,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:03,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:57:03,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:03,957 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:57:03,958 INFO L185 omatonBuilderFactory]: Interpolants [74761#true, 74763#(and (<= 0 Main_y) (<= Main_y 0)), 74762#false, 74765#(and (<= Main_y 2) (<= 2 Main_y)), 74764#(and (<= 1 Main_y) (<= Main_y 1)), 74767#(and (<= Main_y 4) (<= 4 Main_y)), 74766#(and (<= Main_y 3) (<= 3 Main_y)), 74769#(and (<= Main_y 6) (<= 6 Main_y)), 74768#(and (<= Main_y 5) (<= 5 Main_y)), 74771#(and (<= 8 Main_y) (<= Main_y 8)), 74770#(and (<= 7 Main_y) (<= Main_y 7)), 74773#(and (<= 10 Main_y) (<= Main_y 10)), 74772#(and (<= Main_y 9) (<= 9 Main_y)), 74775#(and (<= 12 Main_y) (<= Main_y 12)), 74774#(and (<= 11 Main_y) (<= Main_y 11)), 74777#(and (<= 14 Main_y) (<= Main_y 14)), 74776#(and (<= 13 Main_y) (<= Main_y 13)), 74779#(and (<= 16 Main_y) (<= Main_y 16)), 74778#(and (<= Main_y 15) (<= 15 Main_y)), 74781#(and (<= Main_y 18) (<= 18 Main_y)), 74780#(and (<= Main_y 17) (<= 17 Main_y)), 74783#(and (<= 20 Main_y) (<= Main_y 20)), 74782#(and (<= Main_y 19) (<= 19 Main_y)), 74785#(and (<= Main_y 22) (<= 22 Main_y)), 74784#(and (<= 21 Main_y) (<= Main_y 21)), 74787#(and (<= Main_y 24) (<= 24 Main_y)), 74786#(and (<= 23 Main_y) (<= Main_y 23)), 74789#(and (<= Main_y 26) (<= 26 Main_y)), 74788#(and (<= 25 Main_y) (<= Main_y 25)), 74791#(and (<= 28 Main_y) (<= Main_y 28)), 74790#(and (<= 27 Main_y) (<= Main_y 27)), 74793#(and (<= 30 Main_y) (<= Main_y 30)), 74792#(and (<= 29 Main_y) (<= Main_y 29)), 74795#(and (<= 32 Main_y) (<= Main_y 32)), 74794#(and (<= Main_y 31) (<= 31 Main_y)), 74797#(and (<= Main_y 34) (<= 34 Main_y)), 74796#(and (<= 33 Main_y) (<= Main_y 33)), 74799#(and (<= 36 Main_y) (<= Main_y 36)), 74798#(and (<= 35 Main_y) (<= Main_y 35)), 74801#(and (<= Main_y 38) (<= 38 Main_y)), 74800#(and (<= Main_y 37) (<= 37 Main_y)), 74803#(and (<= 40 Main_y) (<= Main_y 40)), 74802#(and (<= 39 Main_y) (<= Main_y 39)), 74805#(and (<= 42 Main_y) (<= Main_y 42)), 74804#(and (<= Main_y 41) (<= 41 Main_y)), 74807#(and (<= 44 Main_y) (<= Main_y 44)), 74806#(and (<= 43 Main_y) (<= Main_y 43)), 74809#(and (<= 46 Main_y) (<= Main_y 46)), 74808#(and (<= Main_y 45) (<= 45 Main_y)), 74811#(and (<= 48 Main_y) (<= Main_y 48)), 74810#(and (<= 47 Main_y) (<= Main_y 47)), 74813#(and (<= 50 Main_y) (<= Main_y 50)), 74812#(and (<= 49 Main_y) (<= Main_y 49)), 74815#(and (<= 52 Main_y) (<= Main_y 52)), 74814#(and (<= 51 Main_y) (<= Main_y 51)), 74817#(and (<= 54 Main_y) (<= Main_y 54)), 74816#(and (<= 53 Main_y) (<= Main_y 53)), 74819#(and (<= Main_y 56) (<= 56 Main_y)), 74818#(and (<= 55 Main_y) (<= Main_y 55)), 74821#(and (<= Main_y 58) (<= 58 Main_y)), 74820#(and (<= Main_y 57) (<= 57 Main_y)), 74823#(and (<= Main_y 60) (<= 60 Main_y)), 74822#(and (<= Main_y 59) (<= 59 Main_y)), 74825#(and (<= 62 Main_y) (<= Main_y 62)), 74824#(and (<= Main_y 61) (<= 61 Main_y)), 74827#(and (<= 64 Main_y) (<= Main_y 64)), 74826#(and (<= 63 Main_y) (<= Main_y 63)), 74829#(and (<= Main_y 66) (<= 66 Main_y)), 74828#(and (<= Main_y 65) (<= 65 Main_y))] [2018-07-23 13:57:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:03,958 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:57:03,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:57:03,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:57:03,959 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 69 states. [2018-07-23 13:57:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:04,678 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-07-23 13:57:04,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:57:04,678 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 137 [2018-07-23 13:57:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:04,679 INFO L225 Difference]: With dead ends: 209 [2018-07-23 13:57:04,679 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 13:57:04,679 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:57:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 13:57:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 140. [2018-07-23 13:57:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-23 13:57:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-07-23 13:57:04,794 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 137 [2018-07-23 13:57:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:04,794 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-07-23 13:57:04,794 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:57:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-07-23 13:57:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-23 13:57:04,795 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:04,795 INFO L357 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-07-23 13:57:04,795 INFO L414 AbstractCegarLoop]: === Iteration 200 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash 814515975, now seen corresponding path program 197 times [2018-07-23 13:57:04,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:04,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:04,989 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:57:04,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:04,990 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:57:04,990 INFO L185 omatonBuilderFactory]: Interpolants [75529#false, 75528#true, 75531#(<= Main_x 1), 75530#(<= Main_x 0), 75533#(<= Main_x 3), 75532#(<= Main_x 2), 75535#(<= Main_x 5), 75534#(<= Main_x 4), 75537#(<= Main_x 7), 75536#(<= Main_x 6), 75539#(<= Main_x 9), 75538#(<= Main_x 8), 75541#(<= Main_x 11), 75540#(<= Main_x 10), 75543#(<= Main_x 13), 75542#(<= Main_x 12), 75545#(<= Main_x 15), 75544#(<= Main_x 14), 75547#(<= Main_x 17), 75546#(<= Main_x 16), 75549#(<= Main_x 19), 75548#(<= Main_x 18), 75551#(<= Main_x 21), 75550#(<= Main_x 20), 75553#(<= Main_x 23), 75552#(<= Main_x 22), 75555#(<= Main_x 25), 75554#(<= Main_x 24), 75557#(<= Main_x 27), 75556#(<= Main_x 26), 75559#(<= Main_x 29), 75558#(<= Main_x 28), 75561#(<= Main_x 31), 75560#(<= Main_x 30), 75563#(<= Main_x 33), 75562#(<= Main_x 32), 75565#(<= Main_x 35), 75564#(<= Main_x 34), 75567#(<= Main_x 37), 75566#(<= Main_x 36), 75569#(<= Main_x 39), 75568#(<= Main_x 38), 75571#(<= Main_x 41), 75570#(<= Main_x 40), 75573#(<= Main_x 43), 75572#(<= Main_x 42), 75575#(<= Main_x 45), 75574#(<= Main_x 44), 75577#(<= Main_x 47), 75576#(<= Main_x 46), 75579#(<= Main_x 49), 75578#(<= Main_x 48), 75581#(<= Main_x 51), 75580#(<= Main_x 50), 75583#(<= Main_x 53), 75582#(<= Main_x 52), 75585#(<= Main_x 55), 75584#(<= Main_x 54), 75587#(<= Main_x 57), 75586#(<= Main_x 56), 75589#(<= Main_x 59), 75588#(<= Main_x 58), 75591#(<= Main_x 61), 75590#(<= Main_x 60), 75593#(<= Main_x 63), 75592#(<= Main_x 62), 75595#(<= Main_x 65), 75594#(<= Main_x 64), 75597#(<= (+ Main_x 1) 0), 75596#(<= Main_x 66)] [2018-07-23 13:57:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:04,990 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:57:04,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:57:04,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:57:04,991 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 70 states. [2018-07-23 13:57:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:05,268 INFO L93 Difference]: Finished difference Result 210 states and 212 transitions. [2018-07-23 13:57:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:57:05,268 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-23 13:57:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:05,268 INFO L225 Difference]: With dead ends: 210 [2018-07-23 13:57:05,268 INFO L226 Difference]: Without dead ends: 139 [2018-07-23 13:57:05,269 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:57:05,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-23 13:57:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-23 13:57:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-23 13:57:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-07-23 13:57:05,358 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 138 [2018-07-23 13:57:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:05,358 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-07-23 13:57:05,358 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:57:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-07-23 13:57:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-23 13:57:05,359 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:05,359 INFO L357 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-07-23 13:57:05,359 INFO L414 AbstractCegarLoop]: === Iteration 201 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash -145336531, now seen corresponding path program 198 times [2018-07-23 13:57:05,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:05,612 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:05,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:57:05,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:05,612 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:57:05,612 INFO L185 omatonBuilderFactory]: Interpolants [76297#false, 76296#true, 76299#(<= 1 Main_x), 76298#(<= 0 Main_x), 76301#(<= 3 Main_x), 76300#(<= 2 Main_x), 76303#(<= 5 Main_x), 76302#(<= 4 Main_x), 76305#(<= 7 Main_x), 76304#(<= 6 Main_x), 76307#(<= 9 Main_x), 76306#(<= 8 Main_x), 76309#(<= 11 Main_x), 76308#(<= 10 Main_x), 76311#(<= 13 Main_x), 76310#(<= 12 Main_x), 76313#(<= 15 Main_x), 76312#(<= 14 Main_x), 76315#(<= 17 Main_x), 76314#(<= 16 Main_x), 76317#(<= 19 Main_x), 76316#(<= 18 Main_x), 76319#(<= 21 Main_x), 76318#(<= 20 Main_x), 76321#(<= 23 Main_x), 76320#(<= 22 Main_x), 76323#(<= 25 Main_x), 76322#(<= 24 Main_x), 76325#(<= 27 Main_x), 76324#(<= 26 Main_x), 76327#(<= 29 Main_x), 76326#(<= 28 Main_x), 76329#(<= 31 Main_x), 76328#(<= 30 Main_x), 76331#(<= 33 Main_x), 76330#(<= 32 Main_x), 76333#(<= 35 Main_x), 76332#(<= 34 Main_x), 76335#(<= 37 Main_x), 76334#(<= 36 Main_x), 76337#(<= 39 Main_x), 76336#(<= 38 Main_x), 76339#(<= 41 Main_x), 76338#(<= 40 Main_x), 76341#(<= 43 Main_x), 76340#(<= 42 Main_x), 76343#(<= 45 Main_x), 76342#(<= 44 Main_x), 76345#(<= 47 Main_x), 76344#(<= 46 Main_x), 76347#(<= 49 Main_x), 76346#(<= 48 Main_x), 76349#(<= 51 Main_x), 76348#(<= 50 Main_x), 76351#(<= 53 Main_x), 76350#(<= 52 Main_x), 76353#(<= 55 Main_x), 76352#(<= 54 Main_x), 76355#(<= 57 Main_x), 76354#(<= 56 Main_x), 76357#(<= 59 Main_x), 76356#(<= 58 Main_x), 76359#(<= 61 Main_x), 76358#(<= 60 Main_x), 76361#(<= 63 Main_x), 76360#(<= 62 Main_x), 76363#(<= 65 Main_x), 76362#(<= 64 Main_x), 76365#(<= 67 Main_x), 76364#(<= 66 Main_x)] [2018-07-23 13:57:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:05,613 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:57:05,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:57:05,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:57:05,613 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-07-23 13:57:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:05,732 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-07-23 13:57:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:57:05,732 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-23 13:57:05,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:05,732 INFO L225 Difference]: With dead ends: 143 [2018-07-23 13:57:05,732 INFO L226 Difference]: Without dead ends: 140 [2018-07-23 13:57:05,733 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:57:05,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-23 13:57:05,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-23 13:57:05,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-23 13:57:05,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-07-23 13:57:05,814 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 138 [2018-07-23 13:57:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:05,815 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-07-23 13:57:05,815 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:57:05,815 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-07-23 13:57:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-23 13:57:05,815 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:05,815 INFO L357 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1] [2018-07-23 13:57:05,815 INFO L414 AbstractCegarLoop]: === Iteration 202 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash -210526687, now seen corresponding path program 199 times [2018-07-23 13:57:05,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:06,074 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:06,074 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:57:06,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:06,075 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:57:06,075 INFO L185 omatonBuilderFactory]: Interpolants [76933#false, 76932#true, 76935#(and (<= 1 Main_y) (<= Main_y 1)), 76934#(and (<= 0 Main_y) (<= Main_y 0)), 76937#(and (<= Main_y 3) (<= 3 Main_y)), 76936#(and (<= Main_y 2) (<= 2 Main_y)), 76939#(and (<= Main_y 5) (<= 5 Main_y)), 76938#(and (<= Main_y 4) (<= 4 Main_y)), 76941#(and (<= 7 Main_y) (<= Main_y 7)), 76940#(and (<= Main_y 6) (<= 6 Main_y)), 76943#(and (<= Main_y 9) (<= 9 Main_y)), 76942#(and (<= 8 Main_y) (<= Main_y 8)), 76945#(and (<= 11 Main_y) (<= Main_y 11)), 76944#(and (<= 10 Main_y) (<= Main_y 10)), 76947#(and (<= 13 Main_y) (<= Main_y 13)), 76946#(and (<= 12 Main_y) (<= Main_y 12)), 76949#(and (<= Main_y 15) (<= 15 Main_y)), 76948#(and (<= 14 Main_y) (<= Main_y 14)), 76951#(and (<= Main_y 17) (<= 17 Main_y)), 76950#(and (<= 16 Main_y) (<= Main_y 16)), 76953#(and (<= Main_y 19) (<= 19 Main_y)), 76952#(and (<= Main_y 18) (<= 18 Main_y)), 76955#(and (<= 21 Main_y) (<= Main_y 21)), 76954#(and (<= 20 Main_y) (<= Main_y 20)), 76957#(and (<= 23 Main_y) (<= Main_y 23)), 76956#(and (<= Main_y 22) (<= 22 Main_y)), 76959#(and (<= 25 Main_y) (<= Main_y 25)), 76958#(and (<= Main_y 24) (<= 24 Main_y)), 76961#(and (<= 27 Main_y) (<= Main_y 27)), 76960#(and (<= Main_y 26) (<= 26 Main_y)), 76963#(and (<= 29 Main_y) (<= Main_y 29)), 76962#(and (<= 28 Main_y) (<= Main_y 28)), 76965#(and (<= Main_y 31) (<= 31 Main_y)), 76964#(and (<= 30 Main_y) (<= Main_y 30)), 76967#(and (<= 33 Main_y) (<= Main_y 33)), 76966#(and (<= 32 Main_y) (<= Main_y 32)), 76969#(and (<= 35 Main_y) (<= Main_y 35)), 76968#(and (<= Main_y 34) (<= 34 Main_y)), 76971#(and (<= Main_y 37) (<= 37 Main_y)), 76970#(and (<= 36 Main_y) (<= Main_y 36)), 76973#(and (<= 39 Main_y) (<= Main_y 39)), 76972#(and (<= Main_y 38) (<= 38 Main_y)), 76975#(and (<= Main_y 41) (<= 41 Main_y)), 76974#(and (<= 40 Main_y) (<= Main_y 40)), 76977#(and (<= 43 Main_y) (<= Main_y 43)), 76976#(and (<= 42 Main_y) (<= Main_y 42)), 76979#(and (<= Main_y 45) (<= 45 Main_y)), 76978#(and (<= 44 Main_y) (<= Main_y 44)), 76981#(and (<= 47 Main_y) (<= Main_y 47)), 76980#(and (<= 46 Main_y) (<= Main_y 46)), 76983#(and (<= 49 Main_y) (<= Main_y 49)), 76982#(and (<= 48 Main_y) (<= Main_y 48)), 76985#(and (<= 51 Main_y) (<= Main_y 51)), 76984#(and (<= 50 Main_y) (<= Main_y 50)), 76987#(and (<= 53 Main_y) (<= Main_y 53)), 76986#(and (<= 52 Main_y) (<= Main_y 52)), 76989#(and (<= 55 Main_y) (<= Main_y 55)), 76988#(and (<= 54 Main_y) (<= Main_y 54)), 76991#(and (<= Main_y 57) (<= 57 Main_y)), 76990#(and (<= Main_y 56) (<= 56 Main_y)), 76993#(and (<= Main_y 59) (<= 59 Main_y)), 76992#(and (<= Main_y 58) (<= 58 Main_y)), 76995#(and (<= Main_y 61) (<= 61 Main_y)), 76994#(and (<= Main_y 60) (<= 60 Main_y)), 76997#(and (<= 63 Main_y) (<= Main_y 63)), 76996#(and (<= 62 Main_y) (<= Main_y 62)), 76999#(and (<= Main_y 65) (<= 65 Main_y)), 76998#(and (<= 64 Main_y) (<= Main_y 64)), 77001#(and (<= 67 Main_y) (<= Main_y 67)), 77000#(and (<= Main_y 66) (<= 66 Main_y))] [2018-07-23 13:57:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:06,075 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:57:06,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:57:06,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:57:06,076 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 70 states. [2018-07-23 13:57:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:06,709 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-07-23 13:57:06,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:57:06,709 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 139 [2018-07-23 13:57:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:06,710 INFO L225 Difference]: With dead ends: 212 [2018-07-23 13:57:06,710 INFO L226 Difference]: Without dead ends: 209 [2018-07-23 13:57:06,710 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:57:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-23 13:57:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 142. [2018-07-23 13:57:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-23 13:57:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-07-23 13:57:06,797 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 139 [2018-07-23 13:57:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:06,798 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-07-23 13:57:06,798 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:57:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2018-07-23 13:57:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 13:57:06,798 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:06,798 INFO L357 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-07-23 13:57:06,798 INFO L414 AbstractCegarLoop]: === Iteration 203 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2063545773, now seen corresponding path program 200 times [2018-07-23 13:57:06,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:06,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:06,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:57:06,963 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:06,964 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:57:06,964 INFO L185 omatonBuilderFactory]: Interpolants [77711#false, 77710#true, 77713#(<= Main_x 1), 77712#(<= Main_x 0), 77715#(<= Main_x 3), 77714#(<= Main_x 2), 77717#(<= Main_x 5), 77716#(<= Main_x 4), 77719#(<= Main_x 7), 77718#(<= Main_x 6), 77721#(<= Main_x 9), 77720#(<= Main_x 8), 77723#(<= Main_x 11), 77722#(<= Main_x 10), 77725#(<= Main_x 13), 77724#(<= Main_x 12), 77727#(<= Main_x 15), 77726#(<= Main_x 14), 77729#(<= Main_x 17), 77728#(<= Main_x 16), 77731#(<= Main_x 19), 77730#(<= Main_x 18), 77733#(<= Main_x 21), 77732#(<= Main_x 20), 77735#(<= Main_x 23), 77734#(<= Main_x 22), 77737#(<= Main_x 25), 77736#(<= Main_x 24), 77739#(<= Main_x 27), 77738#(<= Main_x 26), 77741#(<= Main_x 29), 77740#(<= Main_x 28), 77743#(<= Main_x 31), 77742#(<= Main_x 30), 77745#(<= Main_x 33), 77744#(<= Main_x 32), 77747#(<= Main_x 35), 77746#(<= Main_x 34), 77749#(<= Main_x 37), 77748#(<= Main_x 36), 77751#(<= Main_x 39), 77750#(<= Main_x 38), 77753#(<= Main_x 41), 77752#(<= Main_x 40), 77755#(<= Main_x 43), 77754#(<= Main_x 42), 77757#(<= Main_x 45), 77756#(<= Main_x 44), 77759#(<= Main_x 47), 77758#(<= Main_x 46), 77761#(<= Main_x 49), 77760#(<= Main_x 48), 77763#(<= Main_x 51), 77762#(<= Main_x 50), 77765#(<= Main_x 53), 77764#(<= Main_x 52), 77767#(<= Main_x 55), 77766#(<= Main_x 54), 77769#(<= Main_x 57), 77768#(<= Main_x 56), 77771#(<= Main_x 59), 77770#(<= Main_x 58), 77773#(<= Main_x 61), 77772#(<= Main_x 60), 77775#(<= Main_x 63), 77774#(<= Main_x 62), 77777#(<= Main_x 65), 77776#(<= Main_x 64), 77779#(<= Main_x 67), 77778#(<= Main_x 66), 77780#(<= (+ Main_x 1) 0)] [2018-07-23 13:57:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:06,964 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:57:06,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:57:06,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:57:06,965 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 71 states. [2018-07-23 13:57:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:07,225 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2018-07-23 13:57:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:57:07,225 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-23 13:57:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:07,225 INFO L225 Difference]: With dead ends: 213 [2018-07-23 13:57:07,225 INFO L226 Difference]: Without dead ends: 141 [2018-07-23 13:57:07,226 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:57:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-23 13:57:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-23 13:57:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 13:57:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-07-23 13:57:07,316 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 140 [2018-07-23 13:57:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:07,316 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-07-23 13:57:07,316 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:57:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-07-23 13:57:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 13:57:07,317 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:07,317 INFO L357 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-07-23 13:57:07,317 INFO L414 AbstractCegarLoop]: === Iteration 204 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1922078137, now seen corresponding path program 201 times [2018-07-23 13:57:07,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:07,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:07,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:57:07,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:07,506 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:57:07,506 INFO L185 omatonBuilderFactory]: Interpolants [78489#true, 78491#(<= 0 Main_x), 78490#false, 78493#(<= 2 Main_x), 78492#(<= 1 Main_x), 78495#(<= 4 Main_x), 78494#(<= 3 Main_x), 78497#(<= 6 Main_x), 78496#(<= 5 Main_x), 78499#(<= 8 Main_x), 78498#(<= 7 Main_x), 78501#(<= 10 Main_x), 78500#(<= 9 Main_x), 78503#(<= 12 Main_x), 78502#(<= 11 Main_x), 78505#(<= 14 Main_x), 78504#(<= 13 Main_x), 78507#(<= 16 Main_x), 78506#(<= 15 Main_x), 78509#(<= 18 Main_x), 78508#(<= 17 Main_x), 78511#(<= 20 Main_x), 78510#(<= 19 Main_x), 78513#(<= 22 Main_x), 78512#(<= 21 Main_x), 78515#(<= 24 Main_x), 78514#(<= 23 Main_x), 78517#(<= 26 Main_x), 78516#(<= 25 Main_x), 78519#(<= 28 Main_x), 78518#(<= 27 Main_x), 78521#(<= 30 Main_x), 78520#(<= 29 Main_x), 78523#(<= 32 Main_x), 78522#(<= 31 Main_x), 78525#(<= 34 Main_x), 78524#(<= 33 Main_x), 78527#(<= 36 Main_x), 78526#(<= 35 Main_x), 78529#(<= 38 Main_x), 78528#(<= 37 Main_x), 78531#(<= 40 Main_x), 78530#(<= 39 Main_x), 78533#(<= 42 Main_x), 78532#(<= 41 Main_x), 78535#(<= 44 Main_x), 78534#(<= 43 Main_x), 78537#(<= 46 Main_x), 78536#(<= 45 Main_x), 78539#(<= 48 Main_x), 78538#(<= 47 Main_x), 78541#(<= 50 Main_x), 78540#(<= 49 Main_x), 78543#(<= 52 Main_x), 78542#(<= 51 Main_x), 78545#(<= 54 Main_x), 78544#(<= 53 Main_x), 78547#(<= 56 Main_x), 78546#(<= 55 Main_x), 78549#(<= 58 Main_x), 78548#(<= 57 Main_x), 78551#(<= 60 Main_x), 78550#(<= 59 Main_x), 78553#(<= 62 Main_x), 78552#(<= 61 Main_x), 78555#(<= 64 Main_x), 78554#(<= 63 Main_x), 78557#(<= 66 Main_x), 78556#(<= 65 Main_x), 78559#(<= 68 Main_x), 78558#(<= 67 Main_x)] [2018-07-23 13:57:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:07,506 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:57:07,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:57:07,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:57:07,507 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-07-23 13:57:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:07,622 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-07-23 13:57:07,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:57:07,622 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-23 13:57:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:07,623 INFO L225 Difference]: With dead ends: 145 [2018-07-23 13:57:07,623 INFO L226 Difference]: Without dead ends: 142 [2018-07-23 13:57:07,623 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:57:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-23 13:57:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-23 13:57:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-23 13:57:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-07-23 13:57:07,708 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-07-23 13:57:07,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:07,708 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-07-23 13:57:07,708 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:57:07,708 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-07-23 13:57:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-23 13:57:07,709 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:07,709 INFO L357 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1] [2018-07-23 13:57:07,709 INFO L414 AbstractCegarLoop]: === Iteration 205 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:07,709 INFO L82 PathProgramCache]: Analyzing trace with hash 545058375, now seen corresponding path program 202 times [2018-07-23 13:57:07,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:07,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:07,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:57:07,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:07,981 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:57:07,981 INFO L185 omatonBuilderFactory]: Interpolants [79135#false, 79134#true, 79137#(and (<= 1 Main_y) (<= Main_y 1)), 79136#(and (<= 0 Main_y) (<= Main_y 0)), 79139#(and (<= Main_y 3) (<= 3 Main_y)), 79138#(and (<= Main_y 2) (<= 2 Main_y)), 79141#(and (<= Main_y 5) (<= 5 Main_y)), 79140#(and (<= Main_y 4) (<= 4 Main_y)), 79143#(and (<= 7 Main_y) (<= Main_y 7)), 79142#(and (<= Main_y 6) (<= 6 Main_y)), 79145#(and (<= Main_y 9) (<= 9 Main_y)), 79144#(and (<= 8 Main_y) (<= Main_y 8)), 79147#(and (<= 11 Main_y) (<= Main_y 11)), 79146#(and (<= 10 Main_y) (<= Main_y 10)), 79149#(and (<= 13 Main_y) (<= Main_y 13)), 79148#(and (<= 12 Main_y) (<= Main_y 12)), 79151#(and (<= Main_y 15) (<= 15 Main_y)), 79150#(and (<= 14 Main_y) (<= Main_y 14)), 79153#(and (<= Main_y 17) (<= 17 Main_y)), 79152#(and (<= 16 Main_y) (<= Main_y 16)), 79155#(and (<= Main_y 19) (<= 19 Main_y)), 79154#(and (<= Main_y 18) (<= 18 Main_y)), 79157#(and (<= 21 Main_y) (<= Main_y 21)), 79156#(and (<= 20 Main_y) (<= Main_y 20)), 79159#(and (<= 23 Main_y) (<= Main_y 23)), 79158#(and (<= Main_y 22) (<= 22 Main_y)), 79161#(and (<= 25 Main_y) (<= Main_y 25)), 79160#(and (<= Main_y 24) (<= 24 Main_y)), 79163#(and (<= 27 Main_y) (<= Main_y 27)), 79162#(and (<= Main_y 26) (<= 26 Main_y)), 79165#(and (<= 29 Main_y) (<= Main_y 29)), 79164#(and (<= 28 Main_y) (<= Main_y 28)), 79167#(and (<= Main_y 31) (<= 31 Main_y)), 79166#(and (<= 30 Main_y) (<= Main_y 30)), 79169#(and (<= 33 Main_y) (<= Main_y 33)), 79168#(and (<= 32 Main_y) (<= Main_y 32)), 79171#(and (<= 35 Main_y) (<= Main_y 35)), 79170#(and (<= Main_y 34) (<= 34 Main_y)), 79173#(and (<= Main_y 37) (<= 37 Main_y)), 79172#(and (<= 36 Main_y) (<= Main_y 36)), 79175#(and (<= 39 Main_y) (<= Main_y 39)), 79174#(and (<= Main_y 38) (<= 38 Main_y)), 79177#(and (<= Main_y 41) (<= 41 Main_y)), 79176#(and (<= 40 Main_y) (<= Main_y 40)), 79179#(and (<= 43 Main_y) (<= Main_y 43)), 79178#(and (<= 42 Main_y) (<= Main_y 42)), 79181#(and (<= Main_y 45) (<= 45 Main_y)), 79180#(and (<= 44 Main_y) (<= Main_y 44)), 79183#(and (<= 47 Main_y) (<= Main_y 47)), 79182#(and (<= 46 Main_y) (<= Main_y 46)), 79185#(and (<= 49 Main_y) (<= Main_y 49)), 79184#(and (<= 48 Main_y) (<= Main_y 48)), 79187#(and (<= 51 Main_y) (<= Main_y 51)), 79186#(and (<= 50 Main_y) (<= Main_y 50)), 79189#(and (<= 53 Main_y) (<= Main_y 53)), 79188#(and (<= 52 Main_y) (<= Main_y 52)), 79191#(and (<= 55 Main_y) (<= Main_y 55)), 79190#(and (<= 54 Main_y) (<= Main_y 54)), 79193#(and (<= Main_y 57) (<= 57 Main_y)), 79192#(and (<= Main_y 56) (<= 56 Main_y)), 79195#(and (<= Main_y 59) (<= 59 Main_y)), 79194#(and (<= Main_y 58) (<= 58 Main_y)), 79197#(and (<= Main_y 61) (<= 61 Main_y)), 79196#(and (<= Main_y 60) (<= 60 Main_y)), 79199#(and (<= 63 Main_y) (<= Main_y 63)), 79198#(and (<= 62 Main_y) (<= Main_y 62)), 79201#(and (<= Main_y 65) (<= 65 Main_y)), 79200#(and (<= 64 Main_y) (<= Main_y 64)), 79203#(and (<= 67 Main_y) (<= Main_y 67)), 79202#(and (<= Main_y 66) (<= 66 Main_y)), 79204#(and (<= 68 Main_y) (<= Main_y 68))] [2018-07-23 13:57:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:07,982 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:57:07,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:57:07,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:57:07,982 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 71 states. [2018-07-23 13:57:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:08,652 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2018-07-23 13:57:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:57:08,652 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 141 [2018-07-23 13:57:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:08,652 INFO L225 Difference]: With dead ends: 215 [2018-07-23 13:57:08,653 INFO L226 Difference]: Without dead ends: 212 [2018-07-23 13:57:08,653 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:57:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-23 13:57:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 144. [2018-07-23 13:57:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-23 13:57:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-07-23 13:57:08,804 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 141 [2018-07-23 13:57:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:08,804 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-07-23 13:57:08,804 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:57:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-07-23 13:57:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 13:57:08,805 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:08,805 INFO L357 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-07-23 13:57:08,805 INFO L414 AbstractCegarLoop]: === Iteration 206 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash -283121081, now seen corresponding path program 203 times [2018-07-23 13:57:08,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:08,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:08,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:57:08,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:08,976 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:57:08,976 INFO L185 omatonBuilderFactory]: Interpolants [79923#true, 79925#(<= Main_x 0), 79924#false, 79927#(<= Main_x 2), 79926#(<= Main_x 1), 79929#(<= Main_x 4), 79928#(<= Main_x 3), 79931#(<= Main_x 6), 79930#(<= Main_x 5), 79933#(<= Main_x 8), 79932#(<= Main_x 7), 79935#(<= Main_x 10), 79934#(<= Main_x 9), 79937#(<= Main_x 12), 79936#(<= Main_x 11), 79939#(<= Main_x 14), 79938#(<= Main_x 13), 79941#(<= Main_x 16), 79940#(<= Main_x 15), 79943#(<= Main_x 18), 79942#(<= Main_x 17), 79945#(<= Main_x 20), 79944#(<= Main_x 19), 79947#(<= Main_x 22), 79946#(<= Main_x 21), 79949#(<= Main_x 24), 79948#(<= Main_x 23), 79951#(<= Main_x 26), 79950#(<= Main_x 25), 79953#(<= Main_x 28), 79952#(<= Main_x 27), 79955#(<= Main_x 30), 79954#(<= Main_x 29), 79957#(<= Main_x 32), 79956#(<= Main_x 31), 79959#(<= Main_x 34), 79958#(<= Main_x 33), 79961#(<= Main_x 36), 79960#(<= Main_x 35), 79963#(<= Main_x 38), 79962#(<= Main_x 37), 79965#(<= Main_x 40), 79964#(<= Main_x 39), 79967#(<= Main_x 42), 79966#(<= Main_x 41), 79969#(<= Main_x 44), 79968#(<= Main_x 43), 79971#(<= Main_x 46), 79970#(<= Main_x 45), 79973#(<= Main_x 48), 79972#(<= Main_x 47), 79975#(<= Main_x 50), 79974#(<= Main_x 49), 79977#(<= Main_x 52), 79976#(<= Main_x 51), 79979#(<= Main_x 54), 79978#(<= Main_x 53), 79981#(<= Main_x 56), 79980#(<= Main_x 55), 79983#(<= Main_x 58), 79982#(<= Main_x 57), 79985#(<= Main_x 60), 79984#(<= Main_x 59), 79987#(<= Main_x 62), 79986#(<= Main_x 61), 79989#(<= Main_x 64), 79988#(<= Main_x 63), 79991#(<= Main_x 66), 79990#(<= Main_x 65), 79993#(<= Main_x 68), 79992#(<= Main_x 67), 79994#(<= (+ Main_x 1) 0)] [2018-07-23 13:57:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:08,976 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:57:08,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:57:08,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:57:08,977 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 72 states. [2018-07-23 13:57:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:09,234 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2018-07-23 13:57:09,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:57:09,234 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-23 13:57:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:09,234 INFO L225 Difference]: With dead ends: 216 [2018-07-23 13:57:09,234 INFO L226 Difference]: Without dead ends: 143 [2018-07-23 13:57:09,235 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:57:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-23 13:57:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-23 13:57:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-23 13:57:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-07-23 13:57:09,320 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 142 [2018-07-23 13:57:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:09,320 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-07-23 13:57:09,320 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:57:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-07-23 13:57:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 13:57:09,321 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:09,321 INFO L357 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-07-23 13:57:09,321 INFO L414 AbstractCegarLoop]: === Iteration 207 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash 716589293, now seen corresponding path program 204 times [2018-07-23 13:57:09,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:09,506 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:09,506 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:57:09,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:09,506 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:57:09,507 INFO L185 omatonBuilderFactory]: Interpolants [80769#(<= 54 Main_x), 80768#(<= 53 Main_x), 80771#(<= 56 Main_x), 80770#(<= 55 Main_x), 80773#(<= 58 Main_x), 80772#(<= 57 Main_x), 80775#(<= 60 Main_x), 80774#(<= 59 Main_x), 80777#(<= 62 Main_x), 80776#(<= 61 Main_x), 80779#(<= 64 Main_x), 80778#(<= 63 Main_x), 80781#(<= 66 Main_x), 80780#(<= 65 Main_x), 80783#(<= 68 Main_x), 80782#(<= 67 Main_x), 80784#(<= 69 Main_x), 80713#true, 80715#(<= 0 Main_x), 80714#false, 80717#(<= 2 Main_x), 80716#(<= 1 Main_x), 80719#(<= 4 Main_x), 80718#(<= 3 Main_x), 80721#(<= 6 Main_x), 80720#(<= 5 Main_x), 80723#(<= 8 Main_x), 80722#(<= 7 Main_x), 80725#(<= 10 Main_x), 80724#(<= 9 Main_x), 80727#(<= 12 Main_x), 80726#(<= 11 Main_x), 80729#(<= 14 Main_x), 80728#(<= 13 Main_x), 80731#(<= 16 Main_x), 80730#(<= 15 Main_x), 80733#(<= 18 Main_x), 80732#(<= 17 Main_x), 80735#(<= 20 Main_x), 80734#(<= 19 Main_x), 80737#(<= 22 Main_x), 80736#(<= 21 Main_x), 80739#(<= 24 Main_x), 80738#(<= 23 Main_x), 80741#(<= 26 Main_x), 80740#(<= 25 Main_x), 80743#(<= 28 Main_x), 80742#(<= 27 Main_x), 80745#(<= 30 Main_x), 80744#(<= 29 Main_x), 80747#(<= 32 Main_x), 80746#(<= 31 Main_x), 80749#(<= 34 Main_x), 80748#(<= 33 Main_x), 80751#(<= 36 Main_x), 80750#(<= 35 Main_x), 80753#(<= 38 Main_x), 80752#(<= 37 Main_x), 80755#(<= 40 Main_x), 80754#(<= 39 Main_x), 80757#(<= 42 Main_x), 80756#(<= 41 Main_x), 80759#(<= 44 Main_x), 80758#(<= 43 Main_x), 80761#(<= 46 Main_x), 80760#(<= 45 Main_x), 80763#(<= 48 Main_x), 80762#(<= 47 Main_x), 80765#(<= 50 Main_x), 80764#(<= 49 Main_x), 80767#(<= 52 Main_x), 80766#(<= 51 Main_x)] [2018-07-23 13:57:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:09,507 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:57:09,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:57:09,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:57:09,508 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-07-23 13:57:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:09,659 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-07-23 13:57:09,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:57:09,659 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-23 13:57:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:09,660 INFO L225 Difference]: With dead ends: 147 [2018-07-23 13:57:09,660 INFO L226 Difference]: Without dead ends: 144 [2018-07-23 13:57:09,660 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:57:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-23 13:57:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-23 13:57:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-23 13:57:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-07-23 13:57:09,748 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 142 [2018-07-23 13:57:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-07-23 13:57:09,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:57:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-07-23 13:57:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-23 13:57:09,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:09,749 INFO L357 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1] [2018-07-23 13:57:09,749 INFO L414 AbstractCegarLoop]: === Iteration 208 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:09,749 INFO L82 PathProgramCache]: Analyzing trace with hash 739370081, now seen corresponding path program 205 times [2018-07-23 13:57:09,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:10,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:10,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:57:10,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:10,064 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:57:10,064 INFO L185 omatonBuilderFactory]: Interpolants [81409#(and (<= 40 Main_y) (<= Main_y 40)), 81408#(and (<= 39 Main_y) (<= Main_y 39)), 81411#(and (<= 42 Main_y) (<= Main_y 42)), 81410#(and (<= Main_y 41) (<= 41 Main_y)), 81413#(and (<= 44 Main_y) (<= Main_y 44)), 81412#(and (<= 43 Main_y) (<= Main_y 43)), 81415#(and (<= 46 Main_y) (<= Main_y 46)), 81414#(and (<= Main_y 45) (<= 45 Main_y)), 81417#(and (<= 48 Main_y) (<= Main_y 48)), 81416#(and (<= 47 Main_y) (<= Main_y 47)), 81419#(and (<= 50 Main_y) (<= Main_y 50)), 81418#(and (<= 49 Main_y) (<= Main_y 49)), 81421#(and (<= 52 Main_y) (<= Main_y 52)), 81420#(and (<= 51 Main_y) (<= Main_y 51)), 81423#(and (<= 54 Main_y) (<= Main_y 54)), 81422#(and (<= 53 Main_y) (<= Main_y 53)), 81425#(and (<= Main_y 56) (<= 56 Main_y)), 81424#(and (<= 55 Main_y) (<= Main_y 55)), 81427#(and (<= Main_y 58) (<= 58 Main_y)), 81426#(and (<= Main_y 57) (<= 57 Main_y)), 81429#(and (<= Main_y 60) (<= 60 Main_y)), 81428#(and (<= Main_y 59) (<= 59 Main_y)), 81431#(and (<= 62 Main_y) (<= Main_y 62)), 81430#(and (<= Main_y 61) (<= 61 Main_y)), 81433#(and (<= 64 Main_y) (<= Main_y 64)), 81432#(and (<= 63 Main_y) (<= Main_y 63)), 81435#(and (<= Main_y 66) (<= 66 Main_y)), 81434#(and (<= Main_y 65) (<= 65 Main_y)), 81437#(and (<= 68 Main_y) (<= Main_y 68)), 81436#(and (<= 67 Main_y) (<= Main_y 67)), 81438#(and (<= Main_y 69) (<= 69 Main_y)), 81367#true, 81369#(and (<= 0 Main_y) (<= Main_y 0)), 81368#false, 81371#(and (<= Main_y 2) (<= 2 Main_y)), 81370#(and (<= 1 Main_y) (<= Main_y 1)), 81373#(and (<= Main_y 4) (<= 4 Main_y)), 81372#(and (<= Main_y 3) (<= 3 Main_y)), 81375#(and (<= Main_y 6) (<= 6 Main_y)), 81374#(and (<= Main_y 5) (<= 5 Main_y)), 81377#(and (<= 8 Main_y) (<= Main_y 8)), 81376#(and (<= 7 Main_y) (<= Main_y 7)), 81379#(and (<= 10 Main_y) (<= Main_y 10)), 81378#(and (<= Main_y 9) (<= 9 Main_y)), 81381#(and (<= 12 Main_y) (<= Main_y 12)), 81380#(and (<= 11 Main_y) (<= Main_y 11)), 81383#(and (<= 14 Main_y) (<= Main_y 14)), 81382#(and (<= 13 Main_y) (<= Main_y 13)), 81385#(and (<= 16 Main_y) (<= Main_y 16)), 81384#(and (<= Main_y 15) (<= 15 Main_y)), 81387#(and (<= Main_y 18) (<= 18 Main_y)), 81386#(and (<= Main_y 17) (<= 17 Main_y)), 81389#(and (<= 20 Main_y) (<= Main_y 20)), 81388#(and (<= Main_y 19) (<= 19 Main_y)), 81391#(and (<= Main_y 22) (<= 22 Main_y)), 81390#(and (<= 21 Main_y) (<= Main_y 21)), 81393#(and (<= Main_y 24) (<= 24 Main_y)), 81392#(and (<= 23 Main_y) (<= Main_y 23)), 81395#(and (<= Main_y 26) (<= 26 Main_y)), 81394#(and (<= 25 Main_y) (<= Main_y 25)), 81397#(and (<= 28 Main_y) (<= Main_y 28)), 81396#(and (<= 27 Main_y) (<= Main_y 27)), 81399#(and (<= 30 Main_y) (<= Main_y 30)), 81398#(and (<= 29 Main_y) (<= Main_y 29)), 81401#(and (<= 32 Main_y) (<= Main_y 32)), 81400#(and (<= Main_y 31) (<= 31 Main_y)), 81403#(and (<= Main_y 34) (<= 34 Main_y)), 81402#(and (<= 33 Main_y) (<= Main_y 33)), 81405#(and (<= 36 Main_y) (<= Main_y 36)), 81404#(and (<= 35 Main_y) (<= Main_y 35)), 81407#(and (<= Main_y 38) (<= 38 Main_y)), 81406#(and (<= Main_y 37) (<= 37 Main_y))] [2018-07-23 13:57:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:10,065 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:57:10,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:57:10,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:57:10,065 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 72 states. [2018-07-23 13:57:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:10,729 INFO L93 Difference]: Finished difference Result 218 states and 220 transitions. [2018-07-23 13:57:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:57:10,729 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 143 [2018-07-23 13:57:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:10,730 INFO L225 Difference]: With dead ends: 218 [2018-07-23 13:57:10,730 INFO L226 Difference]: Without dead ends: 215 [2018-07-23 13:57:10,730 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:57:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-23 13:57:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 146. [2018-07-23 13:57:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-23 13:57:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-07-23 13:57:10,822 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 143 [2018-07-23 13:57:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:10,823 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-07-23 13:57:10,823 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:57:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-07-23 13:57:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 13:57:10,823 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:10,823 INFO L357 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-07-23 13:57:10,823 INFO L414 AbstractCegarLoop]: === Iteration 209 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:10,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1445574509, now seen corresponding path program 206 times [2018-07-23 13:57:10,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:10,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:10,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:57:10,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:10,999 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:57:11,000 INFO L185 omatonBuilderFactory]: Interpolants [82177#(<= Main_x 8), 82176#(<= Main_x 7), 82179#(<= Main_x 10), 82178#(<= Main_x 9), 82181#(<= Main_x 12), 82180#(<= Main_x 11), 82183#(<= Main_x 14), 82182#(<= Main_x 13), 82185#(<= Main_x 16), 82184#(<= Main_x 15), 82187#(<= Main_x 18), 82186#(<= Main_x 17), 82189#(<= Main_x 20), 82188#(<= Main_x 19), 82191#(<= Main_x 22), 82190#(<= Main_x 21), 82193#(<= Main_x 24), 82192#(<= Main_x 23), 82195#(<= Main_x 26), 82194#(<= Main_x 25), 82197#(<= Main_x 28), 82196#(<= Main_x 27), 82199#(<= Main_x 30), 82198#(<= Main_x 29), 82201#(<= Main_x 32), 82200#(<= Main_x 31), 82203#(<= Main_x 34), 82202#(<= Main_x 33), 82205#(<= Main_x 36), 82204#(<= Main_x 35), 82207#(<= Main_x 38), 82206#(<= Main_x 37), 82209#(<= Main_x 40), 82208#(<= Main_x 39), 82211#(<= Main_x 42), 82210#(<= Main_x 41), 82213#(<= Main_x 44), 82212#(<= Main_x 43), 82215#(<= Main_x 46), 82214#(<= Main_x 45), 82217#(<= Main_x 48), 82216#(<= Main_x 47), 82219#(<= Main_x 50), 82218#(<= Main_x 49), 82221#(<= Main_x 52), 82220#(<= Main_x 51), 82223#(<= Main_x 54), 82222#(<= Main_x 53), 82225#(<= Main_x 56), 82224#(<= Main_x 55), 82227#(<= Main_x 58), 82226#(<= Main_x 57), 82229#(<= Main_x 60), 82228#(<= Main_x 59), 82231#(<= Main_x 62), 82230#(<= Main_x 61), 82233#(<= Main_x 64), 82232#(<= Main_x 63), 82235#(<= Main_x 66), 82234#(<= Main_x 65), 82237#(<= Main_x 68), 82236#(<= Main_x 67), 82239#(<= (+ Main_x 1) 0), 82238#(<= Main_x 69), 82167#true, 82169#(<= Main_x 0), 82168#false, 82171#(<= Main_x 2), 82170#(<= Main_x 1), 82173#(<= Main_x 4), 82172#(<= Main_x 3), 82175#(<= Main_x 6), 82174#(<= Main_x 5)] [2018-07-23 13:57:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:11,000 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:57:11,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:57:11,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:57:11,001 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 73 states. [2018-07-23 13:57:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:11,257 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2018-07-23 13:57:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:57:11,257 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-23 13:57:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:11,258 INFO L225 Difference]: With dead ends: 219 [2018-07-23 13:57:11,258 INFO L226 Difference]: Without dead ends: 145 [2018-07-23 13:57:11,258 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:57:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-23 13:57:11,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-23 13:57:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 13:57:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-07-23 13:57:11,346 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 144 [2018-07-23 13:57:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:11,347 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-07-23 13:57:11,347 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:57:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-07-23 13:57:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 13:57:11,347 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:11,347 INFO L357 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-07-23 13:57:11,347 INFO L414 AbstractCegarLoop]: === Iteration 210 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:11,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1923142265, now seen corresponding path program 207 times [2018-07-23 13:57:11,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:11,527 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:11,527 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:57:11,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:11,528 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:57:11,528 INFO L185 omatonBuilderFactory]: Interpolants [82969#false, 82968#true, 82971#(<= 1 Main_x), 82970#(<= 0 Main_x), 82973#(<= 3 Main_x), 82972#(<= 2 Main_x), 82975#(<= 5 Main_x), 82974#(<= 4 Main_x), 82977#(<= 7 Main_x), 82976#(<= 6 Main_x), 82979#(<= 9 Main_x), 82978#(<= 8 Main_x), 82981#(<= 11 Main_x), 82980#(<= 10 Main_x), 82983#(<= 13 Main_x), 82982#(<= 12 Main_x), 82985#(<= 15 Main_x), 82984#(<= 14 Main_x), 82987#(<= 17 Main_x), 82986#(<= 16 Main_x), 82989#(<= 19 Main_x), 82988#(<= 18 Main_x), 82991#(<= 21 Main_x), 82990#(<= 20 Main_x), 82993#(<= 23 Main_x), 82992#(<= 22 Main_x), 82995#(<= 25 Main_x), 82994#(<= 24 Main_x), 82997#(<= 27 Main_x), 82996#(<= 26 Main_x), 82999#(<= 29 Main_x), 82998#(<= 28 Main_x), 83001#(<= 31 Main_x), 83000#(<= 30 Main_x), 83003#(<= 33 Main_x), 83002#(<= 32 Main_x), 83005#(<= 35 Main_x), 83004#(<= 34 Main_x), 83007#(<= 37 Main_x), 83006#(<= 36 Main_x), 83009#(<= 39 Main_x), 83008#(<= 38 Main_x), 83011#(<= 41 Main_x), 83010#(<= 40 Main_x), 83013#(<= 43 Main_x), 83012#(<= 42 Main_x), 83015#(<= 45 Main_x), 83014#(<= 44 Main_x), 83017#(<= 47 Main_x), 83016#(<= 46 Main_x), 83019#(<= 49 Main_x), 83018#(<= 48 Main_x), 83021#(<= 51 Main_x), 83020#(<= 50 Main_x), 83023#(<= 53 Main_x), 83022#(<= 52 Main_x), 83025#(<= 55 Main_x), 83024#(<= 54 Main_x), 83027#(<= 57 Main_x), 83026#(<= 56 Main_x), 83029#(<= 59 Main_x), 83028#(<= 58 Main_x), 83031#(<= 61 Main_x), 83030#(<= 60 Main_x), 83033#(<= 63 Main_x), 83032#(<= 62 Main_x), 83035#(<= 65 Main_x), 83034#(<= 64 Main_x), 83037#(<= 67 Main_x), 83036#(<= 66 Main_x), 83039#(<= 69 Main_x), 83038#(<= 68 Main_x), 83040#(<= 70 Main_x)] [2018-07-23 13:57:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:11,528 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:57:11,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:57:11,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:57:11,529 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-07-23 13:57:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:11,648 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-07-23 13:57:11,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:57:11,649 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-23 13:57:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:11,649 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:57:11,649 INFO L226 Difference]: Without dead ends: 146 [2018-07-23 13:57:11,649 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:57:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-23 13:57:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-23 13:57:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-23 13:57:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-07-23 13:57:11,752 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 144 [2018-07-23 13:57:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:11,753 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-07-23 13:57:11,753 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:57:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-07-23 13:57:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-23 13:57:11,754 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:11,754 INFO L357 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1] [2018-07-23 13:57:11,754 INFO L414 AbstractCegarLoop]: === Iteration 211 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 512070407, now seen corresponding path program 208 times [2018-07-23 13:57:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:12,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:12,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:57:12,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:12,107 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:57:12,107 INFO L185 omatonBuilderFactory]: Interpolants [83631#true, 83633#(and (<= 0 Main_y) (<= Main_y 0)), 83632#false, 83635#(and (<= Main_y 2) (<= 2 Main_y)), 83634#(and (<= 1 Main_y) (<= Main_y 1)), 83637#(and (<= Main_y 4) (<= 4 Main_y)), 83636#(and (<= Main_y 3) (<= 3 Main_y)), 83639#(and (<= Main_y 6) (<= 6 Main_y)), 83638#(and (<= Main_y 5) (<= 5 Main_y)), 83641#(and (<= 8 Main_y) (<= Main_y 8)), 83640#(and (<= 7 Main_y) (<= Main_y 7)), 83643#(and (<= 10 Main_y) (<= Main_y 10)), 83642#(and (<= Main_y 9) (<= 9 Main_y)), 83645#(and (<= 12 Main_y) (<= Main_y 12)), 83644#(and (<= 11 Main_y) (<= Main_y 11)), 83647#(and (<= 14 Main_y) (<= Main_y 14)), 83646#(and (<= 13 Main_y) (<= Main_y 13)), 83649#(and (<= 16 Main_y) (<= Main_y 16)), 83648#(and (<= Main_y 15) (<= 15 Main_y)), 83651#(and (<= Main_y 18) (<= 18 Main_y)), 83650#(and (<= Main_y 17) (<= 17 Main_y)), 83653#(and (<= 20 Main_y) (<= Main_y 20)), 83652#(and (<= Main_y 19) (<= 19 Main_y)), 83655#(and (<= Main_y 22) (<= 22 Main_y)), 83654#(and (<= 21 Main_y) (<= Main_y 21)), 83657#(and (<= Main_y 24) (<= 24 Main_y)), 83656#(and (<= 23 Main_y) (<= Main_y 23)), 83659#(and (<= Main_y 26) (<= 26 Main_y)), 83658#(and (<= 25 Main_y) (<= Main_y 25)), 83661#(and (<= 28 Main_y) (<= Main_y 28)), 83660#(and (<= 27 Main_y) (<= Main_y 27)), 83663#(and (<= 30 Main_y) (<= Main_y 30)), 83662#(and (<= 29 Main_y) (<= Main_y 29)), 83665#(and (<= 32 Main_y) (<= Main_y 32)), 83664#(and (<= Main_y 31) (<= 31 Main_y)), 83667#(and (<= Main_y 34) (<= 34 Main_y)), 83666#(and (<= 33 Main_y) (<= Main_y 33)), 83669#(and (<= 36 Main_y) (<= Main_y 36)), 83668#(and (<= 35 Main_y) (<= Main_y 35)), 83671#(and (<= Main_y 38) (<= 38 Main_y)), 83670#(and (<= Main_y 37) (<= 37 Main_y)), 83673#(and (<= 40 Main_y) (<= Main_y 40)), 83672#(and (<= 39 Main_y) (<= Main_y 39)), 83675#(and (<= 42 Main_y) (<= Main_y 42)), 83674#(and (<= Main_y 41) (<= 41 Main_y)), 83677#(and (<= 44 Main_y) (<= Main_y 44)), 83676#(and (<= 43 Main_y) (<= Main_y 43)), 83679#(and (<= 46 Main_y) (<= Main_y 46)), 83678#(and (<= Main_y 45) (<= 45 Main_y)), 83681#(and (<= 48 Main_y) (<= Main_y 48)), 83680#(and (<= 47 Main_y) (<= Main_y 47)), 83683#(and (<= 50 Main_y) (<= Main_y 50)), 83682#(and (<= 49 Main_y) (<= Main_y 49)), 83685#(and (<= 52 Main_y) (<= Main_y 52)), 83684#(and (<= 51 Main_y) (<= Main_y 51)), 83687#(and (<= 54 Main_y) (<= Main_y 54)), 83686#(and (<= 53 Main_y) (<= Main_y 53)), 83689#(and (<= Main_y 56) (<= 56 Main_y)), 83688#(and (<= 55 Main_y) (<= Main_y 55)), 83691#(and (<= Main_y 58) (<= 58 Main_y)), 83690#(and (<= Main_y 57) (<= 57 Main_y)), 83693#(and (<= Main_y 60) (<= 60 Main_y)), 83692#(and (<= Main_y 59) (<= 59 Main_y)), 83695#(and (<= 62 Main_y) (<= Main_y 62)), 83694#(and (<= Main_y 61) (<= 61 Main_y)), 83697#(and (<= 64 Main_y) (<= Main_y 64)), 83696#(and (<= 63 Main_y) (<= Main_y 63)), 83699#(and (<= Main_y 66) (<= 66 Main_y)), 83698#(and (<= Main_y 65) (<= 65 Main_y)), 83701#(and (<= 68 Main_y) (<= Main_y 68)), 83700#(and (<= 67 Main_y) (<= Main_y 67)), 83703#(and (<= 70 Main_y) (<= Main_y 70)), 83702#(and (<= Main_y 69) (<= 69 Main_y))] [2018-07-23 13:57:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:12,107 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:57:12,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:57:12,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:57:12,108 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 73 states. [2018-07-23 13:57:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:12,835 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-07-23 13:57:12,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:57:12,835 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 145 [2018-07-23 13:57:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:12,835 INFO L225 Difference]: With dead ends: 221 [2018-07-23 13:57:12,835 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 13:57:12,836 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:57:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 13:57:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-07-23 13:57:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-23 13:57:12,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-07-23 13:57:12,942 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 145 [2018-07-23 13:57:12,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:12,942 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-07-23 13:57:12,942 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:57:12,942 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-07-23 13:57:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-23 13:57:12,943 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:12,943 INFO L357 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-07-23 13:57:12,943 INFO L414 AbstractCegarLoop]: === Iteration 212 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:12,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1305748089, now seen corresponding path program 209 times [2018-07-23 13:57:12,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:13,144 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:13,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:57:13,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:13,145 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:57:13,145 INFO L185 omatonBuilderFactory]: Interpolants [84481#(<= Main_x 37), 84480#(<= Main_x 36), 84483#(<= Main_x 39), 84482#(<= Main_x 38), 84485#(<= Main_x 41), 84484#(<= Main_x 40), 84487#(<= Main_x 43), 84486#(<= Main_x 42), 84489#(<= Main_x 45), 84488#(<= Main_x 44), 84491#(<= Main_x 47), 84490#(<= Main_x 46), 84493#(<= Main_x 49), 84492#(<= Main_x 48), 84495#(<= Main_x 51), 84494#(<= Main_x 50), 84497#(<= Main_x 53), 84496#(<= Main_x 52), 84499#(<= Main_x 55), 84498#(<= Main_x 54), 84501#(<= Main_x 57), 84500#(<= Main_x 56), 84503#(<= Main_x 59), 84502#(<= Main_x 58), 84505#(<= Main_x 61), 84504#(<= Main_x 60), 84507#(<= Main_x 63), 84506#(<= Main_x 62), 84509#(<= Main_x 65), 84508#(<= Main_x 64), 84511#(<= Main_x 67), 84510#(<= Main_x 66), 84513#(<= Main_x 69), 84512#(<= Main_x 68), 84515#(<= (+ Main_x 1) 0), 84514#(<= Main_x 70), 84443#false, 84442#true, 84445#(<= Main_x 1), 84444#(<= Main_x 0), 84447#(<= Main_x 3), 84446#(<= Main_x 2), 84449#(<= Main_x 5), 84448#(<= Main_x 4), 84451#(<= Main_x 7), 84450#(<= Main_x 6), 84453#(<= Main_x 9), 84452#(<= Main_x 8), 84455#(<= Main_x 11), 84454#(<= Main_x 10), 84457#(<= Main_x 13), 84456#(<= Main_x 12), 84459#(<= Main_x 15), 84458#(<= Main_x 14), 84461#(<= Main_x 17), 84460#(<= Main_x 16), 84463#(<= Main_x 19), 84462#(<= Main_x 18), 84465#(<= Main_x 21), 84464#(<= Main_x 20), 84467#(<= Main_x 23), 84466#(<= Main_x 22), 84469#(<= Main_x 25), 84468#(<= Main_x 24), 84471#(<= Main_x 27), 84470#(<= Main_x 26), 84473#(<= Main_x 29), 84472#(<= Main_x 28), 84475#(<= Main_x 31), 84474#(<= Main_x 30), 84477#(<= Main_x 33), 84476#(<= Main_x 32), 84479#(<= Main_x 35), 84478#(<= Main_x 34)] [2018-07-23 13:57:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:13,146 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:57:13,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:57:13,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:57:13,146 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 74 states. [2018-07-23 13:57:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:13,413 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-07-23 13:57:13,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:57:13,413 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-23 13:57:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:13,413 INFO L225 Difference]: With dead ends: 222 [2018-07-23 13:57:13,413 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 13:57:13,414 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:57:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 13:57:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-23 13:57:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-23 13:57:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-07-23 13:57:13,518 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 146 [2018-07-23 13:57:13,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:13,519 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-07-23 13:57:13,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:57:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-07-23 13:57:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-23 13:57:13,519 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:13,519 INFO L357 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-07-23 13:57:13,519 INFO L414 AbstractCegarLoop]: === Iteration 213 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:13,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1638214317, now seen corresponding path program 210 times [2018-07-23 13:57:13,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:13,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:13,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:57:13,746 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:13,746 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:57:13,746 INFO L185 omatonBuilderFactory]: Interpolants [85255#false, 85254#true, 85257#(<= 1 Main_x), 85256#(<= 0 Main_x), 85259#(<= 3 Main_x), 85258#(<= 2 Main_x), 85261#(<= 5 Main_x), 85260#(<= 4 Main_x), 85263#(<= 7 Main_x), 85262#(<= 6 Main_x), 85265#(<= 9 Main_x), 85264#(<= 8 Main_x), 85267#(<= 11 Main_x), 85266#(<= 10 Main_x), 85269#(<= 13 Main_x), 85268#(<= 12 Main_x), 85271#(<= 15 Main_x), 85270#(<= 14 Main_x), 85273#(<= 17 Main_x), 85272#(<= 16 Main_x), 85275#(<= 19 Main_x), 85274#(<= 18 Main_x), 85277#(<= 21 Main_x), 85276#(<= 20 Main_x), 85279#(<= 23 Main_x), 85278#(<= 22 Main_x), 85281#(<= 25 Main_x), 85280#(<= 24 Main_x), 85283#(<= 27 Main_x), 85282#(<= 26 Main_x), 85285#(<= 29 Main_x), 85284#(<= 28 Main_x), 85287#(<= 31 Main_x), 85286#(<= 30 Main_x), 85289#(<= 33 Main_x), 85288#(<= 32 Main_x), 85291#(<= 35 Main_x), 85290#(<= 34 Main_x), 85293#(<= 37 Main_x), 85292#(<= 36 Main_x), 85295#(<= 39 Main_x), 85294#(<= 38 Main_x), 85297#(<= 41 Main_x), 85296#(<= 40 Main_x), 85299#(<= 43 Main_x), 85298#(<= 42 Main_x), 85301#(<= 45 Main_x), 85300#(<= 44 Main_x), 85303#(<= 47 Main_x), 85302#(<= 46 Main_x), 85305#(<= 49 Main_x), 85304#(<= 48 Main_x), 85307#(<= 51 Main_x), 85306#(<= 50 Main_x), 85309#(<= 53 Main_x), 85308#(<= 52 Main_x), 85311#(<= 55 Main_x), 85310#(<= 54 Main_x), 85313#(<= 57 Main_x), 85312#(<= 56 Main_x), 85315#(<= 59 Main_x), 85314#(<= 58 Main_x), 85317#(<= 61 Main_x), 85316#(<= 60 Main_x), 85319#(<= 63 Main_x), 85318#(<= 62 Main_x), 85321#(<= 65 Main_x), 85320#(<= 64 Main_x), 85323#(<= 67 Main_x), 85322#(<= 66 Main_x), 85325#(<= 69 Main_x), 85324#(<= 68 Main_x), 85327#(<= 71 Main_x), 85326#(<= 70 Main_x)] [2018-07-23 13:57:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:13,747 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:57:13,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:57:13,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:57:13,748 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-07-23 13:57:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:13,887 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2018-07-23 13:57:13,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:57:13,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-23 13:57:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:13,888 INFO L225 Difference]: With dead ends: 151 [2018-07-23 13:57:13,888 INFO L226 Difference]: Without dead ends: 148 [2018-07-23 13:57:13,888 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:57:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-23 13:57:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-23 13:57:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-23 13:57:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-07-23 13:57:13,991 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-07-23 13:57:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:13,991 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-07-23 13:57:13,991 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:57:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-07-23 13:57:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-23 13:57:13,992 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:13,992 INFO L357 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1] [2018-07-23 13:57:13,992 INFO L414 AbstractCegarLoop]: === Iteration 214 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:13,992 INFO L82 PathProgramCache]: Analyzing trace with hash -755025247, now seen corresponding path program 211 times [2018-07-23 13:57:13,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:14,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:14,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:57:14,326 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:14,326 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:57:14,326 INFO L185 omatonBuilderFactory]: Interpolants [85927#false, 85926#true, 85929#(and (<= 1 Main_y) (<= Main_y 1)), 85928#(and (<= 0 Main_y) (<= Main_y 0)), 85931#(and (<= Main_y 3) (<= 3 Main_y)), 85930#(and (<= Main_y 2) (<= 2 Main_y)), 85933#(and (<= Main_y 5) (<= 5 Main_y)), 85932#(and (<= Main_y 4) (<= 4 Main_y)), 85935#(and (<= 7 Main_y) (<= Main_y 7)), 85934#(and (<= Main_y 6) (<= 6 Main_y)), 85937#(and (<= Main_y 9) (<= 9 Main_y)), 85936#(and (<= 8 Main_y) (<= Main_y 8)), 85939#(and (<= 11 Main_y) (<= Main_y 11)), 85938#(and (<= 10 Main_y) (<= Main_y 10)), 85941#(and (<= 13 Main_y) (<= Main_y 13)), 85940#(and (<= 12 Main_y) (<= Main_y 12)), 85943#(and (<= Main_y 15) (<= 15 Main_y)), 85942#(and (<= 14 Main_y) (<= Main_y 14)), 85945#(and (<= Main_y 17) (<= 17 Main_y)), 85944#(and (<= 16 Main_y) (<= Main_y 16)), 85947#(and (<= Main_y 19) (<= 19 Main_y)), 85946#(and (<= Main_y 18) (<= 18 Main_y)), 85949#(and (<= 21 Main_y) (<= Main_y 21)), 85948#(and (<= 20 Main_y) (<= Main_y 20)), 85951#(and (<= 23 Main_y) (<= Main_y 23)), 85950#(and (<= Main_y 22) (<= 22 Main_y)), 85953#(and (<= 25 Main_y) (<= Main_y 25)), 85952#(and (<= Main_y 24) (<= 24 Main_y)), 85955#(and (<= 27 Main_y) (<= Main_y 27)), 85954#(and (<= Main_y 26) (<= 26 Main_y)), 85957#(and (<= 29 Main_y) (<= Main_y 29)), 85956#(and (<= 28 Main_y) (<= Main_y 28)), 85959#(and (<= Main_y 31) (<= 31 Main_y)), 85958#(and (<= 30 Main_y) (<= Main_y 30)), 85961#(and (<= 33 Main_y) (<= Main_y 33)), 85960#(and (<= 32 Main_y) (<= Main_y 32)), 85963#(and (<= 35 Main_y) (<= Main_y 35)), 85962#(and (<= Main_y 34) (<= 34 Main_y)), 85965#(and (<= Main_y 37) (<= 37 Main_y)), 85964#(and (<= 36 Main_y) (<= Main_y 36)), 85967#(and (<= 39 Main_y) (<= Main_y 39)), 85966#(and (<= Main_y 38) (<= 38 Main_y)), 85969#(and (<= Main_y 41) (<= 41 Main_y)), 85968#(and (<= 40 Main_y) (<= Main_y 40)), 85971#(and (<= 43 Main_y) (<= Main_y 43)), 85970#(and (<= 42 Main_y) (<= Main_y 42)), 85973#(and (<= Main_y 45) (<= 45 Main_y)), 85972#(and (<= 44 Main_y) (<= Main_y 44)), 85975#(and (<= 47 Main_y) (<= Main_y 47)), 85974#(and (<= 46 Main_y) (<= Main_y 46)), 85977#(and (<= 49 Main_y) (<= Main_y 49)), 85976#(and (<= 48 Main_y) (<= Main_y 48)), 85979#(and (<= 51 Main_y) (<= Main_y 51)), 85978#(and (<= 50 Main_y) (<= Main_y 50)), 85981#(and (<= 53 Main_y) (<= Main_y 53)), 85980#(and (<= 52 Main_y) (<= Main_y 52)), 85983#(and (<= 55 Main_y) (<= Main_y 55)), 85982#(and (<= 54 Main_y) (<= Main_y 54)), 85985#(and (<= Main_y 57) (<= 57 Main_y)), 85984#(and (<= Main_y 56) (<= 56 Main_y)), 85987#(and (<= Main_y 59) (<= 59 Main_y)), 85986#(and (<= Main_y 58) (<= 58 Main_y)), 85989#(and (<= Main_y 61) (<= 61 Main_y)), 85988#(and (<= Main_y 60) (<= 60 Main_y)), 85991#(and (<= 63 Main_y) (<= Main_y 63)), 85990#(and (<= 62 Main_y) (<= Main_y 62)), 85993#(and (<= Main_y 65) (<= 65 Main_y)), 85992#(and (<= 64 Main_y) (<= Main_y 64)), 85995#(and (<= 67 Main_y) (<= Main_y 67)), 85994#(and (<= Main_y 66) (<= 66 Main_y)), 85997#(and (<= Main_y 69) (<= 69 Main_y)), 85996#(and (<= 68 Main_y) (<= Main_y 68)), 85999#(and (<= Main_y 71) (<= 71 Main_y)), 85998#(and (<= 70 Main_y) (<= Main_y 70))] [2018-07-23 13:57:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:14,327 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:57:14,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:57:14,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:57:14,328 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 74 states. [2018-07-23 13:57:15,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:15,107 INFO L93 Difference]: Finished difference Result 224 states and 226 transitions. [2018-07-23 13:57:15,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:57:15,107 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 147 [2018-07-23 13:57:15,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:15,107 INFO L225 Difference]: With dead ends: 224 [2018-07-23 13:57:15,107 INFO L226 Difference]: Without dead ends: 221 [2018-07-23 13:57:15,108 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:57:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-23 13:57:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 150. [2018-07-23 13:57:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-23 13:57:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-07-23 13:57:15,218 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 147 [2018-07-23 13:57:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:15,219 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-07-23 13:57:15,219 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:57:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-07-23 13:57:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 13:57:15,219 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:15,219 INFO L357 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-07-23 13:57:15,219 INFO L414 AbstractCegarLoop]: === Iteration 215 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1931007699, now seen corresponding path program 212 times [2018-07-23 13:57:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:15,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:15,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:57:15,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:15,447 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:57:15,447 INFO L185 omatonBuilderFactory]: Interpolants [86785#(<= Main_x 35), 86784#(<= Main_x 34), 86787#(<= Main_x 37), 86786#(<= Main_x 36), 86789#(<= Main_x 39), 86788#(<= Main_x 38), 86791#(<= Main_x 41), 86790#(<= Main_x 40), 86793#(<= Main_x 43), 86792#(<= Main_x 42), 86795#(<= Main_x 45), 86794#(<= Main_x 44), 86797#(<= Main_x 47), 86796#(<= Main_x 46), 86799#(<= Main_x 49), 86798#(<= Main_x 48), 86801#(<= Main_x 51), 86800#(<= Main_x 50), 86803#(<= Main_x 53), 86802#(<= Main_x 52), 86805#(<= Main_x 55), 86804#(<= Main_x 54), 86807#(<= Main_x 57), 86806#(<= Main_x 56), 86809#(<= Main_x 59), 86808#(<= Main_x 58), 86811#(<= Main_x 61), 86810#(<= Main_x 60), 86813#(<= Main_x 63), 86812#(<= Main_x 62), 86815#(<= Main_x 65), 86814#(<= Main_x 64), 86817#(<= Main_x 67), 86816#(<= Main_x 66), 86819#(<= Main_x 69), 86818#(<= Main_x 68), 86821#(<= Main_x 71), 86820#(<= Main_x 70), 86822#(<= (+ Main_x 1) 0), 86749#false, 86748#true, 86751#(<= Main_x 1), 86750#(<= Main_x 0), 86753#(<= Main_x 3), 86752#(<= Main_x 2), 86755#(<= Main_x 5), 86754#(<= Main_x 4), 86757#(<= Main_x 7), 86756#(<= Main_x 6), 86759#(<= Main_x 9), 86758#(<= Main_x 8), 86761#(<= Main_x 11), 86760#(<= Main_x 10), 86763#(<= Main_x 13), 86762#(<= Main_x 12), 86765#(<= Main_x 15), 86764#(<= Main_x 14), 86767#(<= Main_x 17), 86766#(<= Main_x 16), 86769#(<= Main_x 19), 86768#(<= Main_x 18), 86771#(<= Main_x 21), 86770#(<= Main_x 20), 86773#(<= Main_x 23), 86772#(<= Main_x 22), 86775#(<= Main_x 25), 86774#(<= Main_x 24), 86777#(<= Main_x 27), 86776#(<= Main_x 26), 86779#(<= Main_x 29), 86778#(<= Main_x 28), 86781#(<= Main_x 31), 86780#(<= Main_x 30), 86783#(<= Main_x 33), 86782#(<= Main_x 32)] [2018-07-23 13:57:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:15,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:57:15,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:57:15,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:57:15,449 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 75 states. [2018-07-23 13:57:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:15,724 INFO L93 Difference]: Finished difference Result 225 states and 227 transitions. [2018-07-23 13:57:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:57:15,724 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-23 13:57:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:15,724 INFO L225 Difference]: With dead ends: 225 [2018-07-23 13:57:15,724 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 13:57:15,725 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:57:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 13:57:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-23 13:57:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 13:57:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-07-23 13:57:15,894 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 148 [2018-07-23 13:57:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-07-23 13:57:15,894 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:57:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-07-23 13:57:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 13:57:15,895 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:15,895 INFO L357 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-07-23 13:57:15,895 INFO L414 AbstractCegarLoop]: === Iteration 216 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:15,895 INFO L82 PathProgramCache]: Analyzing trace with hash -862486329, now seen corresponding path program 213 times [2018-07-23 13:57:15,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:16,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:16,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:57:16,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:16,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:57:16,143 INFO L185 omatonBuilderFactory]: Interpolants [87571#true, 87573#(<= 0 Main_x), 87572#false, 87575#(<= 2 Main_x), 87574#(<= 1 Main_x), 87577#(<= 4 Main_x), 87576#(<= 3 Main_x), 87579#(<= 6 Main_x), 87578#(<= 5 Main_x), 87581#(<= 8 Main_x), 87580#(<= 7 Main_x), 87583#(<= 10 Main_x), 87582#(<= 9 Main_x), 87585#(<= 12 Main_x), 87584#(<= 11 Main_x), 87587#(<= 14 Main_x), 87586#(<= 13 Main_x), 87589#(<= 16 Main_x), 87588#(<= 15 Main_x), 87591#(<= 18 Main_x), 87590#(<= 17 Main_x), 87593#(<= 20 Main_x), 87592#(<= 19 Main_x), 87595#(<= 22 Main_x), 87594#(<= 21 Main_x), 87597#(<= 24 Main_x), 87596#(<= 23 Main_x), 87599#(<= 26 Main_x), 87598#(<= 25 Main_x), 87601#(<= 28 Main_x), 87600#(<= 27 Main_x), 87603#(<= 30 Main_x), 87602#(<= 29 Main_x), 87605#(<= 32 Main_x), 87604#(<= 31 Main_x), 87607#(<= 34 Main_x), 87606#(<= 33 Main_x), 87609#(<= 36 Main_x), 87608#(<= 35 Main_x), 87611#(<= 38 Main_x), 87610#(<= 37 Main_x), 87613#(<= 40 Main_x), 87612#(<= 39 Main_x), 87615#(<= 42 Main_x), 87614#(<= 41 Main_x), 87617#(<= 44 Main_x), 87616#(<= 43 Main_x), 87619#(<= 46 Main_x), 87618#(<= 45 Main_x), 87621#(<= 48 Main_x), 87620#(<= 47 Main_x), 87623#(<= 50 Main_x), 87622#(<= 49 Main_x), 87625#(<= 52 Main_x), 87624#(<= 51 Main_x), 87627#(<= 54 Main_x), 87626#(<= 53 Main_x), 87629#(<= 56 Main_x), 87628#(<= 55 Main_x), 87631#(<= 58 Main_x), 87630#(<= 57 Main_x), 87633#(<= 60 Main_x), 87632#(<= 59 Main_x), 87635#(<= 62 Main_x), 87634#(<= 61 Main_x), 87637#(<= 64 Main_x), 87636#(<= 63 Main_x), 87639#(<= 66 Main_x), 87638#(<= 65 Main_x), 87641#(<= 68 Main_x), 87640#(<= 67 Main_x), 87643#(<= 70 Main_x), 87642#(<= 69 Main_x), 87645#(<= 72 Main_x), 87644#(<= 71 Main_x)] [2018-07-23 13:57:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:16,144 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:57:16,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:57:16,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:57:16,144 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-07-23 13:57:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:16,286 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-07-23 13:57:16,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:57:16,286 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-23 13:57:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:16,287 INFO L225 Difference]: With dead ends: 153 [2018-07-23 13:57:16,287 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 13:57:16,287 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:57:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 13:57:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-23 13:57:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-23 13:57:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-07-23 13:57:16,384 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 148 [2018-07-23 13:57:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-07-23 13:57:16,384 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:57:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-07-23 13:57:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-23 13:57:16,384 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:16,384 INFO L357 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1] [2018-07-23 13:57:16,384 INFO L414 AbstractCegarLoop]: === Iteration 217 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash -967333945, now seen corresponding path program 214 times [2018-07-23 13:57:16,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:16,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:16,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:57:16,687 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:16,687 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:57:16,688 INFO L185 omatonBuilderFactory]: Interpolants [88321#(and (<= 67 Main_y) (<= Main_y 67)), 88320#(and (<= Main_y 66) (<= 66 Main_y)), 88323#(and (<= Main_y 69) (<= 69 Main_y)), 88322#(and (<= 68 Main_y) (<= Main_y 68)), 88325#(and (<= Main_y 71) (<= 71 Main_y)), 88324#(and (<= 70 Main_y) (<= Main_y 70)), 88326#(and (<= 72 Main_y) (<= Main_y 72)), 88253#false, 88252#true, 88255#(and (<= 1 Main_y) (<= Main_y 1)), 88254#(and (<= 0 Main_y) (<= Main_y 0)), 88257#(and (<= Main_y 3) (<= 3 Main_y)), 88256#(and (<= Main_y 2) (<= 2 Main_y)), 88259#(and (<= Main_y 5) (<= 5 Main_y)), 88258#(and (<= Main_y 4) (<= 4 Main_y)), 88261#(and (<= 7 Main_y) (<= Main_y 7)), 88260#(and (<= Main_y 6) (<= 6 Main_y)), 88263#(and (<= Main_y 9) (<= 9 Main_y)), 88262#(and (<= 8 Main_y) (<= Main_y 8)), 88265#(and (<= 11 Main_y) (<= Main_y 11)), 88264#(and (<= 10 Main_y) (<= Main_y 10)), 88267#(and (<= 13 Main_y) (<= Main_y 13)), 88266#(and (<= 12 Main_y) (<= Main_y 12)), 88269#(and (<= Main_y 15) (<= 15 Main_y)), 88268#(and (<= 14 Main_y) (<= Main_y 14)), 88271#(and (<= Main_y 17) (<= 17 Main_y)), 88270#(and (<= 16 Main_y) (<= Main_y 16)), 88273#(and (<= Main_y 19) (<= 19 Main_y)), 88272#(and (<= Main_y 18) (<= 18 Main_y)), 88275#(and (<= 21 Main_y) (<= Main_y 21)), 88274#(and (<= 20 Main_y) (<= Main_y 20)), 88277#(and (<= 23 Main_y) (<= Main_y 23)), 88276#(and (<= Main_y 22) (<= 22 Main_y)), 88279#(and (<= 25 Main_y) (<= Main_y 25)), 88278#(and (<= Main_y 24) (<= 24 Main_y)), 88281#(and (<= 27 Main_y) (<= Main_y 27)), 88280#(and (<= Main_y 26) (<= 26 Main_y)), 88283#(and (<= 29 Main_y) (<= Main_y 29)), 88282#(and (<= 28 Main_y) (<= Main_y 28)), 88285#(and (<= Main_y 31) (<= 31 Main_y)), 88284#(and (<= 30 Main_y) (<= Main_y 30)), 88287#(and (<= 33 Main_y) (<= Main_y 33)), 88286#(and (<= 32 Main_y) (<= Main_y 32)), 88289#(and (<= 35 Main_y) (<= Main_y 35)), 88288#(and (<= Main_y 34) (<= 34 Main_y)), 88291#(and (<= Main_y 37) (<= 37 Main_y)), 88290#(and (<= 36 Main_y) (<= Main_y 36)), 88293#(and (<= 39 Main_y) (<= Main_y 39)), 88292#(and (<= Main_y 38) (<= 38 Main_y)), 88295#(and (<= Main_y 41) (<= 41 Main_y)), 88294#(and (<= 40 Main_y) (<= Main_y 40)), 88297#(and (<= 43 Main_y) (<= Main_y 43)), 88296#(and (<= 42 Main_y) (<= Main_y 42)), 88299#(and (<= Main_y 45) (<= 45 Main_y)), 88298#(and (<= 44 Main_y) (<= Main_y 44)), 88301#(and (<= 47 Main_y) (<= Main_y 47)), 88300#(and (<= 46 Main_y) (<= Main_y 46)), 88303#(and (<= 49 Main_y) (<= Main_y 49)), 88302#(and (<= 48 Main_y) (<= Main_y 48)), 88305#(and (<= 51 Main_y) (<= Main_y 51)), 88304#(and (<= 50 Main_y) (<= Main_y 50)), 88307#(and (<= 53 Main_y) (<= Main_y 53)), 88306#(and (<= 52 Main_y) (<= Main_y 52)), 88309#(and (<= 55 Main_y) (<= Main_y 55)), 88308#(and (<= 54 Main_y) (<= Main_y 54)), 88311#(and (<= Main_y 57) (<= 57 Main_y)), 88310#(and (<= Main_y 56) (<= 56 Main_y)), 88313#(and (<= Main_y 59) (<= 59 Main_y)), 88312#(and (<= Main_y 58) (<= 58 Main_y)), 88315#(and (<= Main_y 61) (<= 61 Main_y)), 88314#(and (<= Main_y 60) (<= 60 Main_y)), 88317#(and (<= 63 Main_y) (<= Main_y 63)), 88316#(and (<= 62 Main_y) (<= Main_y 62)), 88319#(and (<= Main_y 65) (<= 65 Main_y)), 88318#(and (<= 64 Main_y) (<= Main_y 64))] [2018-07-23 13:57:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:16,688 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:57:16,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:57:16,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:57:16,689 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 75 states. [2018-07-23 13:57:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:17,404 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-07-23 13:57:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:57:17,404 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 149 [2018-07-23 13:57:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:17,405 INFO L225 Difference]: With dead ends: 227 [2018-07-23 13:57:17,405 INFO L226 Difference]: Without dead ends: 224 [2018-07-23 13:57:17,405 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:57:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-23 13:57:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2018-07-23 13:57:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-23 13:57:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-07-23 13:57:17,511 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 149 [2018-07-23 13:57:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:17,512 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-07-23 13:57:17,512 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:57:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-07-23 13:57:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-23 13:57:17,512 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:17,512 INFO L357 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-07-23 13:57:17,512 INFO L414 AbstractCegarLoop]: === Iteration 218 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 77357255, now seen corresponding path program 215 times [2018-07-23 13:57:17,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:17,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:17,703 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:57:17,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:17,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:57:17,703 INFO L185 omatonBuilderFactory]: Interpolants [89089#(<= Main_x 2), 89088#(<= Main_x 1), 89091#(<= Main_x 4), 89090#(<= Main_x 3), 89093#(<= Main_x 6), 89092#(<= Main_x 5), 89095#(<= Main_x 8), 89094#(<= Main_x 7), 89097#(<= Main_x 10), 89096#(<= Main_x 9), 89099#(<= Main_x 12), 89098#(<= Main_x 11), 89101#(<= Main_x 14), 89100#(<= Main_x 13), 89103#(<= Main_x 16), 89102#(<= Main_x 15), 89105#(<= Main_x 18), 89104#(<= Main_x 17), 89107#(<= Main_x 20), 89106#(<= Main_x 19), 89109#(<= Main_x 22), 89108#(<= Main_x 21), 89111#(<= Main_x 24), 89110#(<= Main_x 23), 89113#(<= Main_x 26), 89112#(<= Main_x 25), 89115#(<= Main_x 28), 89114#(<= Main_x 27), 89117#(<= Main_x 30), 89116#(<= Main_x 29), 89119#(<= Main_x 32), 89118#(<= Main_x 31), 89121#(<= Main_x 34), 89120#(<= Main_x 33), 89123#(<= Main_x 36), 89122#(<= Main_x 35), 89125#(<= Main_x 38), 89124#(<= Main_x 37), 89127#(<= Main_x 40), 89126#(<= Main_x 39), 89129#(<= Main_x 42), 89128#(<= Main_x 41), 89131#(<= Main_x 44), 89130#(<= Main_x 43), 89133#(<= Main_x 46), 89132#(<= Main_x 45), 89135#(<= Main_x 48), 89134#(<= Main_x 47), 89137#(<= Main_x 50), 89136#(<= Main_x 49), 89139#(<= Main_x 52), 89138#(<= Main_x 51), 89141#(<= Main_x 54), 89140#(<= Main_x 53), 89143#(<= Main_x 56), 89142#(<= Main_x 55), 89145#(<= Main_x 58), 89144#(<= Main_x 57), 89147#(<= Main_x 60), 89146#(<= Main_x 59), 89149#(<= Main_x 62), 89148#(<= Main_x 61), 89151#(<= Main_x 64), 89150#(<= Main_x 63), 89153#(<= Main_x 66), 89152#(<= Main_x 65), 89155#(<= Main_x 68), 89154#(<= Main_x 67), 89157#(<= Main_x 70), 89156#(<= Main_x 69), 89159#(<= Main_x 72), 89158#(<= Main_x 71), 89160#(<= (+ Main_x 1) 0), 89085#true, 89087#(<= Main_x 0), 89086#false] [2018-07-23 13:57:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:17,704 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:57:17,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:57:17,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:57:17,704 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 76 states. [2018-07-23 13:57:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:17,998 INFO L93 Difference]: Finished difference Result 228 states and 230 transitions. [2018-07-23 13:57:17,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:57:17,998 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-23 13:57:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:17,998 INFO L225 Difference]: With dead ends: 228 [2018-07-23 13:57:17,998 INFO L226 Difference]: Without dead ends: 151 [2018-07-23 13:57:17,999 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:57:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-23 13:57:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-23 13:57:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 13:57:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-07-23 13:57:18,097 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 150 [2018-07-23 13:57:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:18,097 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-07-23 13:57:18,097 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:57:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-07-23 13:57:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-23 13:57:18,097 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:18,098 INFO L357 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-07-23 13:57:18,098 INFO L414 AbstractCegarLoop]: === Iteration 219 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1158218643, now seen corresponding path program 216 times [2018-07-23 13:57:18,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:18,387 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:18,387 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:57:18,388 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:18,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:57:18,388 INFO L185 omatonBuilderFactory]: Interpolants [89985#(<= 64 Main_x), 89984#(<= 63 Main_x), 89987#(<= 66 Main_x), 89986#(<= 65 Main_x), 89989#(<= 68 Main_x), 89988#(<= 67 Main_x), 89991#(<= 70 Main_x), 89990#(<= 69 Main_x), 89993#(<= 72 Main_x), 89992#(<= 71 Main_x), 89994#(<= 73 Main_x), 89919#true, 89921#(<= 0 Main_x), 89920#false, 89923#(<= 2 Main_x), 89922#(<= 1 Main_x), 89925#(<= 4 Main_x), 89924#(<= 3 Main_x), 89927#(<= 6 Main_x), 89926#(<= 5 Main_x), 89929#(<= 8 Main_x), 89928#(<= 7 Main_x), 89931#(<= 10 Main_x), 89930#(<= 9 Main_x), 89933#(<= 12 Main_x), 89932#(<= 11 Main_x), 89935#(<= 14 Main_x), 89934#(<= 13 Main_x), 89937#(<= 16 Main_x), 89936#(<= 15 Main_x), 89939#(<= 18 Main_x), 89938#(<= 17 Main_x), 89941#(<= 20 Main_x), 89940#(<= 19 Main_x), 89943#(<= 22 Main_x), 89942#(<= 21 Main_x), 89945#(<= 24 Main_x), 89944#(<= 23 Main_x), 89947#(<= 26 Main_x), 89946#(<= 25 Main_x), 89949#(<= 28 Main_x), 89948#(<= 27 Main_x), 89951#(<= 30 Main_x), 89950#(<= 29 Main_x), 89953#(<= 32 Main_x), 89952#(<= 31 Main_x), 89955#(<= 34 Main_x), 89954#(<= 33 Main_x), 89957#(<= 36 Main_x), 89956#(<= 35 Main_x), 89959#(<= 38 Main_x), 89958#(<= 37 Main_x), 89961#(<= 40 Main_x), 89960#(<= 39 Main_x), 89963#(<= 42 Main_x), 89962#(<= 41 Main_x), 89965#(<= 44 Main_x), 89964#(<= 43 Main_x), 89967#(<= 46 Main_x), 89966#(<= 45 Main_x), 89969#(<= 48 Main_x), 89968#(<= 47 Main_x), 89971#(<= 50 Main_x), 89970#(<= 49 Main_x), 89973#(<= 52 Main_x), 89972#(<= 51 Main_x), 89975#(<= 54 Main_x), 89974#(<= 53 Main_x), 89977#(<= 56 Main_x), 89976#(<= 55 Main_x), 89979#(<= 58 Main_x), 89978#(<= 57 Main_x), 89981#(<= 60 Main_x), 89980#(<= 59 Main_x), 89983#(<= 62 Main_x), 89982#(<= 61 Main_x)] [2018-07-23 13:57:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:18,389 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:57:18,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:57:18,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:57:18,390 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-07-23 13:57:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:18,638 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-07-23 13:57:18,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:57:18,638 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-23 13:57:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:18,639 INFO L225 Difference]: With dead ends: 155 [2018-07-23 13:57:18,639 INFO L226 Difference]: Without dead ends: 152 [2018-07-23 13:57:18,640 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:57:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-23 13:57:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-23 13:57:18,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-23 13:57:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-07-23 13:57:18,803 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 150 [2018-07-23 13:57:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:18,803 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-07-23 13:57:18,803 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:57:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-07-23 13:57:18,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-23 13:57:18,804 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:18,804 INFO L357 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1] [2018-07-23 13:57:18,804 INFO L414 AbstractCegarLoop]: === Iteration 220 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1545101087, now seen corresponding path program 217 times [2018-07-23 13:57:18,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:19,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:19,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:57:19,107 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:19,107 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:57:19,107 INFO L185 omatonBuilderFactory]: Interpolants [90625#(and (<= 14 Main_y) (<= Main_y 14)), 90624#(and (<= 13 Main_y) (<= Main_y 13)), 90627#(and (<= 16 Main_y) (<= Main_y 16)), 90626#(and (<= Main_y 15) (<= 15 Main_y)), 90629#(and (<= Main_y 18) (<= 18 Main_y)), 90628#(and (<= Main_y 17) (<= 17 Main_y)), 90631#(and (<= 20 Main_y) (<= Main_y 20)), 90630#(and (<= Main_y 19) (<= 19 Main_y)), 90633#(and (<= Main_y 22) (<= 22 Main_y)), 90632#(and (<= 21 Main_y) (<= Main_y 21)), 90635#(and (<= Main_y 24) (<= 24 Main_y)), 90634#(and (<= 23 Main_y) (<= Main_y 23)), 90637#(and (<= Main_y 26) (<= 26 Main_y)), 90636#(and (<= 25 Main_y) (<= Main_y 25)), 90639#(and (<= 28 Main_y) (<= Main_y 28)), 90638#(and (<= 27 Main_y) (<= Main_y 27)), 90641#(and (<= 30 Main_y) (<= Main_y 30)), 90640#(and (<= 29 Main_y) (<= Main_y 29)), 90643#(and (<= 32 Main_y) (<= Main_y 32)), 90642#(and (<= Main_y 31) (<= 31 Main_y)), 90645#(and (<= Main_y 34) (<= 34 Main_y)), 90644#(and (<= 33 Main_y) (<= Main_y 33)), 90647#(and (<= 36 Main_y) (<= Main_y 36)), 90646#(and (<= 35 Main_y) (<= Main_y 35)), 90649#(and (<= Main_y 38) (<= 38 Main_y)), 90648#(and (<= Main_y 37) (<= 37 Main_y)), 90651#(and (<= 40 Main_y) (<= Main_y 40)), 90650#(and (<= 39 Main_y) (<= Main_y 39)), 90653#(and (<= 42 Main_y) (<= Main_y 42)), 90652#(and (<= Main_y 41) (<= 41 Main_y)), 90655#(and (<= 44 Main_y) (<= Main_y 44)), 90654#(and (<= 43 Main_y) (<= Main_y 43)), 90657#(and (<= 46 Main_y) (<= Main_y 46)), 90656#(and (<= Main_y 45) (<= 45 Main_y)), 90659#(and (<= 48 Main_y) (<= Main_y 48)), 90658#(and (<= 47 Main_y) (<= Main_y 47)), 90661#(and (<= 50 Main_y) (<= Main_y 50)), 90660#(and (<= 49 Main_y) (<= Main_y 49)), 90663#(and (<= 52 Main_y) (<= Main_y 52)), 90662#(and (<= 51 Main_y) (<= Main_y 51)), 90665#(and (<= 54 Main_y) (<= Main_y 54)), 90664#(and (<= 53 Main_y) (<= Main_y 53)), 90667#(and (<= Main_y 56) (<= 56 Main_y)), 90666#(and (<= 55 Main_y) (<= Main_y 55)), 90669#(and (<= Main_y 58) (<= 58 Main_y)), 90668#(and (<= Main_y 57) (<= 57 Main_y)), 90671#(and (<= Main_y 60) (<= 60 Main_y)), 90670#(and (<= Main_y 59) (<= 59 Main_y)), 90673#(and (<= 62 Main_y) (<= Main_y 62)), 90672#(and (<= Main_y 61) (<= 61 Main_y)), 90675#(and (<= 64 Main_y) (<= Main_y 64)), 90674#(and (<= 63 Main_y) (<= Main_y 63)), 90677#(and (<= Main_y 66) (<= 66 Main_y)), 90676#(and (<= Main_y 65) (<= 65 Main_y)), 90679#(and (<= 68 Main_y) (<= Main_y 68)), 90678#(and (<= 67 Main_y) (<= Main_y 67)), 90681#(and (<= 70 Main_y) (<= Main_y 70)), 90680#(and (<= Main_y 69) (<= 69 Main_y)), 90683#(and (<= 72 Main_y) (<= Main_y 72)), 90682#(and (<= Main_y 71) (<= 71 Main_y)), 90684#(and (<= 73 Main_y) (<= Main_y 73)), 90609#true, 90611#(and (<= 0 Main_y) (<= Main_y 0)), 90610#false, 90613#(and (<= Main_y 2) (<= 2 Main_y)), 90612#(and (<= 1 Main_y) (<= Main_y 1)), 90615#(and (<= Main_y 4) (<= 4 Main_y)), 90614#(and (<= Main_y 3) (<= 3 Main_y)), 90617#(and (<= Main_y 6) (<= 6 Main_y)), 90616#(and (<= Main_y 5) (<= 5 Main_y)), 90619#(and (<= 8 Main_y) (<= Main_y 8)), 90618#(and (<= 7 Main_y) (<= Main_y 7)), 90621#(and (<= 10 Main_y) (<= Main_y 10)), 90620#(and (<= Main_y 9) (<= 9 Main_y)), 90623#(and (<= 12 Main_y) (<= Main_y 12)), 90622#(and (<= 11 Main_y) (<= Main_y 11))] [2018-07-23 13:57:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:19,108 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:57:19,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:57:19,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:57:19,108 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 76 states. [2018-07-23 13:57:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:19,911 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2018-07-23 13:57:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:57:19,911 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 151 [2018-07-23 13:57:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:19,912 INFO L225 Difference]: With dead ends: 230 [2018-07-23 13:57:19,912 INFO L226 Difference]: Without dead ends: 227 [2018-07-23 13:57:19,913 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:57:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-23 13:57:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 154. [2018-07-23 13:57:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-23 13:57:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-07-23 13:57:20,057 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 151 [2018-07-23 13:57:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:20,057 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-07-23 13:57:20,057 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:57:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2018-07-23 13:57:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 13:57:20,057 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:20,058 INFO L357 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-07-23 13:57:20,058 INFO L414 AbstractCegarLoop]: === Iteration 221 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash -653554963, now seen corresponding path program 218 times [2018-07-23 13:57:20,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:20,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:20,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:57:20,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:20,252 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:57:20,252 INFO L185 omatonBuilderFactory]: Interpolants [91521#(<= Main_x 66), 91520#(<= Main_x 65), 91523#(<= Main_x 68), 91522#(<= Main_x 67), 91525#(<= Main_x 70), 91524#(<= Main_x 69), 91527#(<= Main_x 72), 91526#(<= Main_x 71), 91529#(<= (+ Main_x 1) 0), 91528#(<= Main_x 73), 91453#true, 91455#(<= Main_x 0), 91454#false, 91457#(<= Main_x 2), 91456#(<= Main_x 1), 91459#(<= Main_x 4), 91458#(<= Main_x 3), 91461#(<= Main_x 6), 91460#(<= Main_x 5), 91463#(<= Main_x 8), 91462#(<= Main_x 7), 91465#(<= Main_x 10), 91464#(<= Main_x 9), 91467#(<= Main_x 12), 91466#(<= Main_x 11), 91469#(<= Main_x 14), 91468#(<= Main_x 13), 91471#(<= Main_x 16), 91470#(<= Main_x 15), 91473#(<= Main_x 18), 91472#(<= Main_x 17), 91475#(<= Main_x 20), 91474#(<= Main_x 19), 91477#(<= Main_x 22), 91476#(<= Main_x 21), 91479#(<= Main_x 24), 91478#(<= Main_x 23), 91481#(<= Main_x 26), 91480#(<= Main_x 25), 91483#(<= Main_x 28), 91482#(<= Main_x 27), 91485#(<= Main_x 30), 91484#(<= Main_x 29), 91487#(<= Main_x 32), 91486#(<= Main_x 31), 91489#(<= Main_x 34), 91488#(<= Main_x 33), 91491#(<= Main_x 36), 91490#(<= Main_x 35), 91493#(<= Main_x 38), 91492#(<= Main_x 37), 91495#(<= Main_x 40), 91494#(<= Main_x 39), 91497#(<= Main_x 42), 91496#(<= Main_x 41), 91499#(<= Main_x 44), 91498#(<= Main_x 43), 91501#(<= Main_x 46), 91500#(<= Main_x 45), 91503#(<= Main_x 48), 91502#(<= Main_x 47), 91505#(<= Main_x 50), 91504#(<= Main_x 49), 91507#(<= Main_x 52), 91506#(<= Main_x 51), 91509#(<= Main_x 54), 91508#(<= Main_x 53), 91511#(<= Main_x 56), 91510#(<= Main_x 55), 91513#(<= Main_x 58), 91512#(<= Main_x 57), 91515#(<= Main_x 60), 91514#(<= Main_x 59), 91517#(<= Main_x 62), 91516#(<= Main_x 61), 91519#(<= Main_x 64), 91518#(<= Main_x 63)] [2018-07-23 13:57:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:20,252 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:57:20,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:57:20,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:57:20,253 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 77 states. [2018-07-23 13:57:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:20,542 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2018-07-23 13:57:20,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:57:20,542 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-23 13:57:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:20,543 INFO L225 Difference]: With dead ends: 231 [2018-07-23 13:57:20,543 INFO L226 Difference]: Without dead ends: 153 [2018-07-23 13:57:20,543 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:57:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-23 13:57:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-23 13:57:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 13:57:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-07-23 13:57:20,642 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 152 [2018-07-23 13:57:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:20,642 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-07-23 13:57:20,642 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:57:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-07-23 13:57:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 13:57:20,642 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:20,643 INFO L357 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-07-23 13:57:20,643 INFO L414 AbstractCegarLoop]: === Iteration 222 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:20,643 INFO L82 PathProgramCache]: Analyzing trace with hash -301702137, now seen corresponding path program 219 times [2018-07-23 13:57:20,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:20,849 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:20,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:57:20,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:20,850 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:57:20,850 INFO L185 omatonBuilderFactory]: Interpolants [92299#false, 92298#true, 92301#(<= 1 Main_x), 92300#(<= 0 Main_x), 92303#(<= 3 Main_x), 92302#(<= 2 Main_x), 92305#(<= 5 Main_x), 92304#(<= 4 Main_x), 92307#(<= 7 Main_x), 92306#(<= 6 Main_x), 92309#(<= 9 Main_x), 92308#(<= 8 Main_x), 92311#(<= 11 Main_x), 92310#(<= 10 Main_x), 92313#(<= 13 Main_x), 92312#(<= 12 Main_x), 92315#(<= 15 Main_x), 92314#(<= 14 Main_x), 92317#(<= 17 Main_x), 92316#(<= 16 Main_x), 92319#(<= 19 Main_x), 92318#(<= 18 Main_x), 92321#(<= 21 Main_x), 92320#(<= 20 Main_x), 92323#(<= 23 Main_x), 92322#(<= 22 Main_x), 92325#(<= 25 Main_x), 92324#(<= 24 Main_x), 92327#(<= 27 Main_x), 92326#(<= 26 Main_x), 92329#(<= 29 Main_x), 92328#(<= 28 Main_x), 92331#(<= 31 Main_x), 92330#(<= 30 Main_x), 92333#(<= 33 Main_x), 92332#(<= 32 Main_x), 92335#(<= 35 Main_x), 92334#(<= 34 Main_x), 92337#(<= 37 Main_x), 92336#(<= 36 Main_x), 92339#(<= 39 Main_x), 92338#(<= 38 Main_x), 92341#(<= 41 Main_x), 92340#(<= 40 Main_x), 92343#(<= 43 Main_x), 92342#(<= 42 Main_x), 92345#(<= 45 Main_x), 92344#(<= 44 Main_x), 92347#(<= 47 Main_x), 92346#(<= 46 Main_x), 92349#(<= 49 Main_x), 92348#(<= 48 Main_x), 92351#(<= 51 Main_x), 92350#(<= 50 Main_x), 92353#(<= 53 Main_x), 92352#(<= 52 Main_x), 92355#(<= 55 Main_x), 92354#(<= 54 Main_x), 92357#(<= 57 Main_x), 92356#(<= 56 Main_x), 92359#(<= 59 Main_x), 92358#(<= 58 Main_x), 92361#(<= 61 Main_x), 92360#(<= 60 Main_x), 92363#(<= 63 Main_x), 92362#(<= 62 Main_x), 92365#(<= 65 Main_x), 92364#(<= 64 Main_x), 92367#(<= 67 Main_x), 92366#(<= 66 Main_x), 92369#(<= 69 Main_x), 92368#(<= 68 Main_x), 92371#(<= 71 Main_x), 92370#(<= 70 Main_x), 92373#(<= 73 Main_x), 92372#(<= 72 Main_x), 92374#(<= 74 Main_x)] [2018-07-23 13:57:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:20,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:57:20,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:57:20,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:57:20,851 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-07-23 13:57:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:20,983 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-07-23 13:57:20,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:57:20,983 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-23 13:57:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:20,984 INFO L225 Difference]: With dead ends: 157 [2018-07-23 13:57:20,984 INFO L226 Difference]: Without dead ends: 154 [2018-07-23 13:57:20,984 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:57:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-23 13:57:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-23 13:57:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-23 13:57:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-07-23 13:57:21,083 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-07-23 13:57:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:21,084 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-07-23 13:57:21,084 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:57:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-07-23 13:57:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-23 13:57:21,084 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:21,084 INFO L357 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1] [2018-07-23 13:57:21,084 INFO L414 AbstractCegarLoop]: === Iteration 223 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash -762893177, now seen corresponding path program 220 times [2018-07-23 13:57:21,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:21,398 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:21,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:57:21,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:21,398 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:57:21,398 INFO L185 omatonBuilderFactory]: Interpolants [93057#(and (<= Main_y 58) (<= 58 Main_y)), 93056#(and (<= Main_y 57) (<= 57 Main_y)), 93059#(and (<= Main_y 60) (<= 60 Main_y)), 93058#(and (<= Main_y 59) (<= 59 Main_y)), 93061#(and (<= 62 Main_y) (<= Main_y 62)), 93060#(and (<= Main_y 61) (<= 61 Main_y)), 93063#(and (<= 64 Main_y) (<= Main_y 64)), 93062#(and (<= 63 Main_y) (<= Main_y 63)), 93065#(and (<= Main_y 66) (<= 66 Main_y)), 93064#(and (<= Main_y 65) (<= 65 Main_y)), 93067#(and (<= 68 Main_y) (<= Main_y 68)), 93066#(and (<= 67 Main_y) (<= Main_y 67)), 93069#(and (<= 70 Main_y) (<= Main_y 70)), 93068#(and (<= Main_y 69) (<= 69 Main_y)), 93071#(and (<= 72 Main_y) (<= Main_y 72)), 93070#(and (<= Main_y 71) (<= 71 Main_y)), 93073#(and (<= 74 Main_y) (<= Main_y 74)), 93072#(and (<= 73 Main_y) (<= Main_y 73)), 92997#true, 92999#(and (<= 0 Main_y) (<= Main_y 0)), 92998#false, 93001#(and (<= Main_y 2) (<= 2 Main_y)), 93000#(and (<= 1 Main_y) (<= Main_y 1)), 93003#(and (<= Main_y 4) (<= 4 Main_y)), 93002#(and (<= Main_y 3) (<= 3 Main_y)), 93005#(and (<= Main_y 6) (<= 6 Main_y)), 93004#(and (<= Main_y 5) (<= 5 Main_y)), 93007#(and (<= 8 Main_y) (<= Main_y 8)), 93006#(and (<= 7 Main_y) (<= Main_y 7)), 93009#(and (<= 10 Main_y) (<= Main_y 10)), 93008#(and (<= Main_y 9) (<= 9 Main_y)), 93011#(and (<= 12 Main_y) (<= Main_y 12)), 93010#(and (<= 11 Main_y) (<= Main_y 11)), 93013#(and (<= 14 Main_y) (<= Main_y 14)), 93012#(and (<= 13 Main_y) (<= Main_y 13)), 93015#(and (<= 16 Main_y) (<= Main_y 16)), 93014#(and (<= Main_y 15) (<= 15 Main_y)), 93017#(and (<= Main_y 18) (<= 18 Main_y)), 93016#(and (<= Main_y 17) (<= 17 Main_y)), 93019#(and (<= 20 Main_y) (<= Main_y 20)), 93018#(and (<= Main_y 19) (<= 19 Main_y)), 93021#(and (<= Main_y 22) (<= 22 Main_y)), 93020#(and (<= 21 Main_y) (<= Main_y 21)), 93023#(and (<= Main_y 24) (<= 24 Main_y)), 93022#(and (<= 23 Main_y) (<= Main_y 23)), 93025#(and (<= Main_y 26) (<= 26 Main_y)), 93024#(and (<= 25 Main_y) (<= Main_y 25)), 93027#(and (<= 28 Main_y) (<= Main_y 28)), 93026#(and (<= 27 Main_y) (<= Main_y 27)), 93029#(and (<= 30 Main_y) (<= Main_y 30)), 93028#(and (<= 29 Main_y) (<= Main_y 29)), 93031#(and (<= 32 Main_y) (<= Main_y 32)), 93030#(and (<= Main_y 31) (<= 31 Main_y)), 93033#(and (<= Main_y 34) (<= 34 Main_y)), 93032#(and (<= 33 Main_y) (<= Main_y 33)), 93035#(and (<= 36 Main_y) (<= Main_y 36)), 93034#(and (<= 35 Main_y) (<= Main_y 35)), 93037#(and (<= Main_y 38) (<= 38 Main_y)), 93036#(and (<= Main_y 37) (<= 37 Main_y)), 93039#(and (<= 40 Main_y) (<= Main_y 40)), 93038#(and (<= 39 Main_y) (<= Main_y 39)), 93041#(and (<= 42 Main_y) (<= Main_y 42)), 93040#(and (<= Main_y 41) (<= 41 Main_y)), 93043#(and (<= 44 Main_y) (<= Main_y 44)), 93042#(and (<= 43 Main_y) (<= Main_y 43)), 93045#(and (<= 46 Main_y) (<= Main_y 46)), 93044#(and (<= Main_y 45) (<= 45 Main_y)), 93047#(and (<= 48 Main_y) (<= Main_y 48)), 93046#(and (<= 47 Main_y) (<= Main_y 47)), 93049#(and (<= 50 Main_y) (<= Main_y 50)), 93048#(and (<= 49 Main_y) (<= Main_y 49)), 93051#(and (<= 52 Main_y) (<= Main_y 52)), 93050#(and (<= 51 Main_y) (<= Main_y 51)), 93053#(and (<= 54 Main_y) (<= Main_y 54)), 93052#(and (<= 53 Main_y) (<= Main_y 53)), 93055#(and (<= Main_y 56) (<= 56 Main_y)), 93054#(and (<= 55 Main_y) (<= Main_y 55))] [2018-07-23 13:57:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:21,399 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:57:21,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:57:21,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:57:21,399 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 77 states. [2018-07-23 13:57:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:22,154 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-07-23 13:57:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:57:22,154 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 153 [2018-07-23 13:57:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:22,155 INFO L225 Difference]: With dead ends: 233 [2018-07-23 13:57:22,155 INFO L226 Difference]: Without dead ends: 230 [2018-07-23 13:57:22,155 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:57:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-23 13:57:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2018-07-23 13:57:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-23 13:57:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-07-23 13:57:22,260 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 153 [2018-07-23 13:57:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:22,260 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-07-23 13:57:22,261 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:57:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-07-23 13:57:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 13:57:22,261 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:22,261 INFO L357 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-07-23 13:57:22,261 INFO L414 AbstractCegarLoop]: === Iteration 224 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2120053767, now seen corresponding path program 221 times [2018-07-23 13:57:22,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:22,463 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:22,463 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:57:22,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:22,463 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:57:22,463 INFO L185 omatonBuilderFactory]: Interpolants [93853#false, 93852#true, 93855#(<= Main_x 1), 93854#(<= Main_x 0), 93857#(<= Main_x 3), 93856#(<= Main_x 2), 93859#(<= Main_x 5), 93858#(<= Main_x 4), 93861#(<= Main_x 7), 93860#(<= Main_x 6), 93863#(<= Main_x 9), 93862#(<= Main_x 8), 93865#(<= Main_x 11), 93864#(<= Main_x 10), 93867#(<= Main_x 13), 93866#(<= Main_x 12), 93869#(<= Main_x 15), 93868#(<= Main_x 14), 93871#(<= Main_x 17), 93870#(<= Main_x 16), 93873#(<= Main_x 19), 93872#(<= Main_x 18), 93875#(<= Main_x 21), 93874#(<= Main_x 20), 93877#(<= Main_x 23), 93876#(<= Main_x 22), 93879#(<= Main_x 25), 93878#(<= Main_x 24), 93881#(<= Main_x 27), 93880#(<= Main_x 26), 93883#(<= Main_x 29), 93882#(<= Main_x 28), 93885#(<= Main_x 31), 93884#(<= Main_x 30), 93887#(<= Main_x 33), 93886#(<= Main_x 32), 93889#(<= Main_x 35), 93888#(<= Main_x 34), 93891#(<= Main_x 37), 93890#(<= Main_x 36), 93893#(<= Main_x 39), 93892#(<= Main_x 38), 93895#(<= Main_x 41), 93894#(<= Main_x 40), 93897#(<= Main_x 43), 93896#(<= Main_x 42), 93899#(<= Main_x 45), 93898#(<= Main_x 44), 93901#(<= Main_x 47), 93900#(<= Main_x 46), 93903#(<= Main_x 49), 93902#(<= Main_x 48), 93905#(<= Main_x 51), 93904#(<= Main_x 50), 93907#(<= Main_x 53), 93906#(<= Main_x 52), 93909#(<= Main_x 55), 93908#(<= Main_x 54), 93911#(<= Main_x 57), 93910#(<= Main_x 56), 93913#(<= Main_x 59), 93912#(<= Main_x 58), 93915#(<= Main_x 61), 93914#(<= Main_x 60), 93917#(<= Main_x 63), 93916#(<= Main_x 62), 93919#(<= Main_x 65), 93918#(<= Main_x 64), 93921#(<= Main_x 67), 93920#(<= Main_x 66), 93923#(<= Main_x 69), 93922#(<= Main_x 68), 93925#(<= Main_x 71), 93924#(<= Main_x 70), 93927#(<= Main_x 73), 93926#(<= Main_x 72), 93929#(<= (+ Main_x 1) 0), 93928#(<= Main_x 74)] [2018-07-23 13:57:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:22,464 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:57:22,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:57:22,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:57:22,464 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 78 states. [2018-07-23 13:57:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:22,773 INFO L93 Difference]: Finished difference Result 234 states and 236 transitions. [2018-07-23 13:57:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:57:22,773 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-23 13:57:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:22,774 INFO L225 Difference]: With dead ends: 234 [2018-07-23 13:57:22,774 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 13:57:22,775 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:57:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 13:57:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 13:57:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 13:57:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-07-23 13:57:22,962 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 154 [2018-07-23 13:57:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:22,962 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-07-23 13:57:22,963 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:57:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-07-23 13:57:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 13:57:22,963 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:22,963 INFO L357 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-07-23 13:57:22,964 INFO L414 AbstractCegarLoop]: === Iteration 225 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 142589485, now seen corresponding path program 222 times [2018-07-23 13:57:22,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:23,249 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:23,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:57:23,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:23,249 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:57:23,249 INFO L185 omatonBuilderFactory]: Interpolants [94721#(<= 11 Main_x), 94720#(<= 10 Main_x), 94723#(<= 13 Main_x), 94722#(<= 12 Main_x), 94725#(<= 15 Main_x), 94724#(<= 14 Main_x), 94727#(<= 17 Main_x), 94726#(<= 16 Main_x), 94729#(<= 19 Main_x), 94728#(<= 18 Main_x), 94731#(<= 21 Main_x), 94730#(<= 20 Main_x), 94733#(<= 23 Main_x), 94732#(<= 22 Main_x), 94735#(<= 25 Main_x), 94734#(<= 24 Main_x), 94737#(<= 27 Main_x), 94736#(<= 26 Main_x), 94739#(<= 29 Main_x), 94738#(<= 28 Main_x), 94741#(<= 31 Main_x), 94740#(<= 30 Main_x), 94743#(<= 33 Main_x), 94742#(<= 32 Main_x), 94745#(<= 35 Main_x), 94744#(<= 34 Main_x), 94747#(<= 37 Main_x), 94746#(<= 36 Main_x), 94749#(<= 39 Main_x), 94748#(<= 38 Main_x), 94751#(<= 41 Main_x), 94750#(<= 40 Main_x), 94753#(<= 43 Main_x), 94752#(<= 42 Main_x), 94755#(<= 45 Main_x), 94754#(<= 44 Main_x), 94757#(<= 47 Main_x), 94756#(<= 46 Main_x), 94759#(<= 49 Main_x), 94758#(<= 48 Main_x), 94761#(<= 51 Main_x), 94760#(<= 50 Main_x), 94763#(<= 53 Main_x), 94762#(<= 52 Main_x), 94765#(<= 55 Main_x), 94764#(<= 54 Main_x), 94767#(<= 57 Main_x), 94766#(<= 56 Main_x), 94769#(<= 59 Main_x), 94768#(<= 58 Main_x), 94771#(<= 61 Main_x), 94770#(<= 60 Main_x), 94773#(<= 63 Main_x), 94772#(<= 62 Main_x), 94775#(<= 65 Main_x), 94774#(<= 64 Main_x), 94777#(<= 67 Main_x), 94776#(<= 66 Main_x), 94779#(<= 69 Main_x), 94778#(<= 68 Main_x), 94781#(<= 71 Main_x), 94780#(<= 70 Main_x), 94783#(<= 73 Main_x), 94782#(<= 72 Main_x), 94785#(<= 75 Main_x), 94784#(<= 74 Main_x), 94709#false, 94708#true, 94711#(<= 1 Main_x), 94710#(<= 0 Main_x), 94713#(<= 3 Main_x), 94712#(<= 2 Main_x), 94715#(<= 5 Main_x), 94714#(<= 4 Main_x), 94717#(<= 7 Main_x), 94716#(<= 6 Main_x), 94719#(<= 9 Main_x), 94718#(<= 8 Main_x)] [2018-07-23 13:57:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:23,250 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:57:23,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:57:23,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:57:23,251 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-07-23 13:57:23,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:23,408 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-07-23 13:57:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:57:23,409 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-23 13:57:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:23,409 INFO L225 Difference]: With dead ends: 159 [2018-07-23 13:57:23,409 INFO L226 Difference]: Without dead ends: 156 [2018-07-23 13:57:23,410 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:57:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-23 13:57:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-23 13:57:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-23 13:57:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-07-23 13:57:23,517 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 154 [2018-07-23 13:57:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:23,517 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-07-23 13:57:23,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:57:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-07-23 13:57:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-23 13:57:23,518 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:23,518 INFO L357 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1] [2018-07-23 13:57:23,518 INFO L414 AbstractCegarLoop]: === Iteration 226 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 125245217, now seen corresponding path program 223 times [2018-07-23 13:57:23,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:23,881 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:23,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:57:23,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:23,881 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:57:23,881 INFO L185 omatonBuilderFactory]: Interpolants [95489#(and (<= Main_y 71) (<= 71 Main_y)), 95488#(and (<= 70 Main_y) (<= Main_y 70)), 95491#(and (<= 73 Main_y) (<= Main_y 73)), 95490#(and (<= 72 Main_y) (<= Main_y 72)), 95493#(and (<= Main_y 75) (<= 75 Main_y)), 95492#(and (<= 74 Main_y) (<= Main_y 74)), 95417#false, 95416#true, 95419#(and (<= 1 Main_y) (<= Main_y 1)), 95418#(and (<= 0 Main_y) (<= Main_y 0)), 95421#(and (<= Main_y 3) (<= 3 Main_y)), 95420#(and (<= Main_y 2) (<= 2 Main_y)), 95423#(and (<= Main_y 5) (<= 5 Main_y)), 95422#(and (<= Main_y 4) (<= 4 Main_y)), 95425#(and (<= 7 Main_y) (<= Main_y 7)), 95424#(and (<= Main_y 6) (<= 6 Main_y)), 95427#(and (<= Main_y 9) (<= 9 Main_y)), 95426#(and (<= 8 Main_y) (<= Main_y 8)), 95429#(and (<= 11 Main_y) (<= Main_y 11)), 95428#(and (<= 10 Main_y) (<= Main_y 10)), 95431#(and (<= 13 Main_y) (<= Main_y 13)), 95430#(and (<= 12 Main_y) (<= Main_y 12)), 95433#(and (<= Main_y 15) (<= 15 Main_y)), 95432#(and (<= 14 Main_y) (<= Main_y 14)), 95435#(and (<= Main_y 17) (<= 17 Main_y)), 95434#(and (<= 16 Main_y) (<= Main_y 16)), 95437#(and (<= Main_y 19) (<= 19 Main_y)), 95436#(and (<= Main_y 18) (<= 18 Main_y)), 95439#(and (<= 21 Main_y) (<= Main_y 21)), 95438#(and (<= 20 Main_y) (<= Main_y 20)), 95441#(and (<= 23 Main_y) (<= Main_y 23)), 95440#(and (<= Main_y 22) (<= 22 Main_y)), 95443#(and (<= 25 Main_y) (<= Main_y 25)), 95442#(and (<= Main_y 24) (<= 24 Main_y)), 95445#(and (<= 27 Main_y) (<= Main_y 27)), 95444#(and (<= Main_y 26) (<= 26 Main_y)), 95447#(and (<= 29 Main_y) (<= Main_y 29)), 95446#(and (<= 28 Main_y) (<= Main_y 28)), 95449#(and (<= Main_y 31) (<= 31 Main_y)), 95448#(and (<= 30 Main_y) (<= Main_y 30)), 95451#(and (<= 33 Main_y) (<= Main_y 33)), 95450#(and (<= 32 Main_y) (<= Main_y 32)), 95453#(and (<= 35 Main_y) (<= Main_y 35)), 95452#(and (<= Main_y 34) (<= 34 Main_y)), 95455#(and (<= Main_y 37) (<= 37 Main_y)), 95454#(and (<= 36 Main_y) (<= Main_y 36)), 95457#(and (<= 39 Main_y) (<= Main_y 39)), 95456#(and (<= Main_y 38) (<= 38 Main_y)), 95459#(and (<= Main_y 41) (<= 41 Main_y)), 95458#(and (<= 40 Main_y) (<= Main_y 40)), 95461#(and (<= 43 Main_y) (<= Main_y 43)), 95460#(and (<= 42 Main_y) (<= Main_y 42)), 95463#(and (<= Main_y 45) (<= 45 Main_y)), 95462#(and (<= 44 Main_y) (<= Main_y 44)), 95465#(and (<= 47 Main_y) (<= Main_y 47)), 95464#(and (<= 46 Main_y) (<= Main_y 46)), 95467#(and (<= 49 Main_y) (<= Main_y 49)), 95466#(and (<= 48 Main_y) (<= Main_y 48)), 95469#(and (<= 51 Main_y) (<= Main_y 51)), 95468#(and (<= 50 Main_y) (<= Main_y 50)), 95471#(and (<= 53 Main_y) (<= Main_y 53)), 95470#(and (<= 52 Main_y) (<= Main_y 52)), 95473#(and (<= 55 Main_y) (<= Main_y 55)), 95472#(and (<= 54 Main_y) (<= Main_y 54)), 95475#(and (<= Main_y 57) (<= 57 Main_y)), 95474#(and (<= Main_y 56) (<= 56 Main_y)), 95477#(and (<= Main_y 59) (<= 59 Main_y)), 95476#(and (<= Main_y 58) (<= 58 Main_y)), 95479#(and (<= Main_y 61) (<= 61 Main_y)), 95478#(and (<= Main_y 60) (<= 60 Main_y)), 95481#(and (<= 63 Main_y) (<= Main_y 63)), 95480#(and (<= 62 Main_y) (<= Main_y 62)), 95483#(and (<= Main_y 65) (<= 65 Main_y)), 95482#(and (<= 64 Main_y) (<= Main_y 64)), 95485#(and (<= 67 Main_y) (<= Main_y 67)), 95484#(and (<= Main_y 66) (<= 66 Main_y)), 95487#(and (<= Main_y 69) (<= 69 Main_y)), 95486#(and (<= 68 Main_y) (<= Main_y 68))] [2018-07-23 13:57:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:23,882 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:57:23,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:57:23,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:57:23,882 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 78 states. [2018-07-23 13:57:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:24,649 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2018-07-23 13:57:24,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:57:24,649 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 155 [2018-07-23 13:57:24,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:24,650 INFO L225 Difference]: With dead ends: 236 [2018-07-23 13:57:24,650 INFO L226 Difference]: Without dead ends: 233 [2018-07-23 13:57:24,650 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:57:24,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-23 13:57:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 158. [2018-07-23 13:57:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-23 13:57:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-07-23 13:57:24,762 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 155 [2018-07-23 13:57:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:24,762 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-07-23 13:57:24,762 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:57:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-07-23 13:57:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 13:57:24,762 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:24,762 INFO L357 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-07-23 13:57:24,763 INFO L414 AbstractCegarLoop]: === Iteration 227 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash -412427091, now seen corresponding path program 224 times [2018-07-23 13:57:24,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:24,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:24,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:57:24,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:24,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:57:24,963 INFO L185 omatonBuilderFactory]: Interpolants [96283#false, 96282#true, 96285#(<= Main_x 1), 96284#(<= Main_x 0), 96287#(<= Main_x 3), 96286#(<= Main_x 2), 96289#(<= Main_x 5), 96288#(<= Main_x 4), 96291#(<= Main_x 7), 96290#(<= Main_x 6), 96293#(<= Main_x 9), 96292#(<= Main_x 8), 96295#(<= Main_x 11), 96294#(<= Main_x 10), 96297#(<= Main_x 13), 96296#(<= Main_x 12), 96299#(<= Main_x 15), 96298#(<= Main_x 14), 96301#(<= Main_x 17), 96300#(<= Main_x 16), 96303#(<= Main_x 19), 96302#(<= Main_x 18), 96305#(<= Main_x 21), 96304#(<= Main_x 20), 96307#(<= Main_x 23), 96306#(<= Main_x 22), 96309#(<= Main_x 25), 96308#(<= Main_x 24), 96311#(<= Main_x 27), 96310#(<= Main_x 26), 96313#(<= Main_x 29), 96312#(<= Main_x 28), 96315#(<= Main_x 31), 96314#(<= Main_x 30), 96317#(<= Main_x 33), 96316#(<= Main_x 32), 96319#(<= Main_x 35), 96318#(<= Main_x 34), 96321#(<= Main_x 37), 96320#(<= Main_x 36), 96323#(<= Main_x 39), 96322#(<= Main_x 38), 96325#(<= Main_x 41), 96324#(<= Main_x 40), 96327#(<= Main_x 43), 96326#(<= Main_x 42), 96329#(<= Main_x 45), 96328#(<= Main_x 44), 96331#(<= Main_x 47), 96330#(<= Main_x 46), 96333#(<= Main_x 49), 96332#(<= Main_x 48), 96335#(<= Main_x 51), 96334#(<= Main_x 50), 96337#(<= Main_x 53), 96336#(<= Main_x 52), 96339#(<= Main_x 55), 96338#(<= Main_x 54), 96341#(<= Main_x 57), 96340#(<= Main_x 56), 96343#(<= Main_x 59), 96342#(<= Main_x 58), 96345#(<= Main_x 61), 96344#(<= Main_x 60), 96347#(<= Main_x 63), 96346#(<= Main_x 62), 96349#(<= Main_x 65), 96348#(<= Main_x 64), 96351#(<= Main_x 67), 96350#(<= Main_x 66), 96353#(<= Main_x 69), 96352#(<= Main_x 68), 96355#(<= Main_x 71), 96354#(<= Main_x 70), 96357#(<= Main_x 73), 96356#(<= Main_x 72), 96359#(<= Main_x 75), 96358#(<= Main_x 74), 96360#(<= (+ Main_x 1) 0)] [2018-07-23 13:57:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:24,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:57:24,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:57:24,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:57:24,964 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 79 states. [2018-07-23 13:57:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:25,298 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-07-23 13:57:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:57:25,298 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-23 13:57:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:25,298 INFO L225 Difference]: With dead ends: 237 [2018-07-23 13:57:25,298 INFO L226 Difference]: Without dead ends: 157 [2018-07-23 13:57:25,299 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:57:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-23 13:57:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-23 13:57:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 13:57:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-07-23 13:57:25,403 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 156 [2018-07-23 13:57:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:25,403 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-07-23 13:57:25,403 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:57:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-07-23 13:57:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 13:57:25,403 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:25,404 INFO L357 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-07-23 13:57:25,404 INFO L414 AbstractCegarLoop]: === Iteration 228 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:25,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1584277689, now seen corresponding path program 225 times [2018-07-23 13:57:25,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:25,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:25,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:57:25,626 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:25,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:57:25,627 INFO L185 omatonBuilderFactory]: Interpolants [97153#(<= 2 Main_x), 97152#(<= 1 Main_x), 97155#(<= 4 Main_x), 97154#(<= 3 Main_x), 97157#(<= 6 Main_x), 97156#(<= 5 Main_x), 97159#(<= 8 Main_x), 97158#(<= 7 Main_x), 97161#(<= 10 Main_x), 97160#(<= 9 Main_x), 97163#(<= 12 Main_x), 97162#(<= 11 Main_x), 97165#(<= 14 Main_x), 97164#(<= 13 Main_x), 97167#(<= 16 Main_x), 97166#(<= 15 Main_x), 97169#(<= 18 Main_x), 97168#(<= 17 Main_x), 97171#(<= 20 Main_x), 97170#(<= 19 Main_x), 97173#(<= 22 Main_x), 97172#(<= 21 Main_x), 97175#(<= 24 Main_x), 97174#(<= 23 Main_x), 97177#(<= 26 Main_x), 97176#(<= 25 Main_x), 97179#(<= 28 Main_x), 97178#(<= 27 Main_x), 97181#(<= 30 Main_x), 97180#(<= 29 Main_x), 97183#(<= 32 Main_x), 97182#(<= 31 Main_x), 97185#(<= 34 Main_x), 97184#(<= 33 Main_x), 97187#(<= 36 Main_x), 97186#(<= 35 Main_x), 97189#(<= 38 Main_x), 97188#(<= 37 Main_x), 97191#(<= 40 Main_x), 97190#(<= 39 Main_x), 97193#(<= 42 Main_x), 97192#(<= 41 Main_x), 97195#(<= 44 Main_x), 97194#(<= 43 Main_x), 97197#(<= 46 Main_x), 97196#(<= 45 Main_x), 97199#(<= 48 Main_x), 97198#(<= 47 Main_x), 97201#(<= 50 Main_x), 97200#(<= 49 Main_x), 97203#(<= 52 Main_x), 97202#(<= 51 Main_x), 97205#(<= 54 Main_x), 97204#(<= 53 Main_x), 97207#(<= 56 Main_x), 97206#(<= 55 Main_x), 97209#(<= 58 Main_x), 97208#(<= 57 Main_x), 97211#(<= 60 Main_x), 97210#(<= 59 Main_x), 97213#(<= 62 Main_x), 97212#(<= 61 Main_x), 97215#(<= 64 Main_x), 97214#(<= 63 Main_x), 97217#(<= 66 Main_x), 97216#(<= 65 Main_x), 97219#(<= 68 Main_x), 97218#(<= 67 Main_x), 97221#(<= 70 Main_x), 97220#(<= 69 Main_x), 97223#(<= 72 Main_x), 97222#(<= 71 Main_x), 97225#(<= 74 Main_x), 97224#(<= 73 Main_x), 97227#(<= 76 Main_x), 97226#(<= 75 Main_x), 97149#true, 97151#(<= 0 Main_x), 97150#false] [2018-07-23 13:57:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:25,627 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:57:25,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:57:25,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:57:25,628 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-07-23 13:57:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:25,766 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-07-23 13:57:25,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:57:25,766 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-23 13:57:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:25,766 INFO L225 Difference]: With dead ends: 161 [2018-07-23 13:57:25,766 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 13:57:25,767 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:57:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 13:57:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-23 13:57:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-23 13:57:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-07-23 13:57:25,873 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 156 [2018-07-23 13:57:25,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:25,873 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-07-23 13:57:25,873 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:57:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-07-23 13:57:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-23 13:57:25,873 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:25,873 INFO L357 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1] [2018-07-23 13:57:25,874 INFO L414 AbstractCegarLoop]: === Iteration 229 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1868029625, now seen corresponding path program 226 times [2018-07-23 13:57:25,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:26,203 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:26,203 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:57:26,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:26,203 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:57:26,203 INFO L185 omatonBuilderFactory]: Interpolants [97921#(and (<= 53 Main_y) (<= Main_y 53)), 97920#(and (<= 52 Main_y) (<= Main_y 52)), 97923#(and (<= 55 Main_y) (<= Main_y 55)), 97922#(and (<= 54 Main_y) (<= Main_y 54)), 97925#(and (<= Main_y 57) (<= 57 Main_y)), 97924#(and (<= Main_y 56) (<= 56 Main_y)), 97927#(and (<= Main_y 59) (<= 59 Main_y)), 97926#(and (<= Main_y 58) (<= 58 Main_y)), 97929#(and (<= Main_y 61) (<= 61 Main_y)), 97928#(and (<= Main_y 60) (<= 60 Main_y)), 97931#(and (<= 63 Main_y) (<= Main_y 63)), 97930#(and (<= 62 Main_y) (<= Main_y 62)), 97933#(and (<= Main_y 65) (<= 65 Main_y)), 97932#(and (<= 64 Main_y) (<= Main_y 64)), 97935#(and (<= 67 Main_y) (<= Main_y 67)), 97934#(and (<= Main_y 66) (<= 66 Main_y)), 97937#(and (<= Main_y 69) (<= 69 Main_y)), 97936#(and (<= 68 Main_y) (<= Main_y 68)), 97939#(and (<= Main_y 71) (<= 71 Main_y)), 97938#(and (<= 70 Main_y) (<= Main_y 70)), 97941#(and (<= 73 Main_y) (<= Main_y 73)), 97940#(and (<= 72 Main_y) (<= Main_y 72)), 97943#(and (<= Main_y 75) (<= 75 Main_y)), 97942#(and (<= 74 Main_y) (<= Main_y 74)), 97944#(and (<= Main_y 76) (<= 76 Main_y)), 97867#false, 97866#true, 97869#(and (<= 1 Main_y) (<= Main_y 1)), 97868#(and (<= 0 Main_y) (<= Main_y 0)), 97871#(and (<= Main_y 3) (<= 3 Main_y)), 97870#(and (<= Main_y 2) (<= 2 Main_y)), 97873#(and (<= Main_y 5) (<= 5 Main_y)), 97872#(and (<= Main_y 4) (<= 4 Main_y)), 97875#(and (<= 7 Main_y) (<= Main_y 7)), 97874#(and (<= Main_y 6) (<= 6 Main_y)), 97877#(and (<= Main_y 9) (<= 9 Main_y)), 97876#(and (<= 8 Main_y) (<= Main_y 8)), 97879#(and (<= 11 Main_y) (<= Main_y 11)), 97878#(and (<= 10 Main_y) (<= Main_y 10)), 97881#(and (<= 13 Main_y) (<= Main_y 13)), 97880#(and (<= 12 Main_y) (<= Main_y 12)), 97883#(and (<= Main_y 15) (<= 15 Main_y)), 97882#(and (<= 14 Main_y) (<= Main_y 14)), 97885#(and (<= Main_y 17) (<= 17 Main_y)), 97884#(and (<= 16 Main_y) (<= Main_y 16)), 97887#(and (<= Main_y 19) (<= 19 Main_y)), 97886#(and (<= Main_y 18) (<= 18 Main_y)), 97889#(and (<= 21 Main_y) (<= Main_y 21)), 97888#(and (<= 20 Main_y) (<= Main_y 20)), 97891#(and (<= 23 Main_y) (<= Main_y 23)), 97890#(and (<= Main_y 22) (<= 22 Main_y)), 97893#(and (<= 25 Main_y) (<= Main_y 25)), 97892#(and (<= Main_y 24) (<= 24 Main_y)), 97895#(and (<= 27 Main_y) (<= Main_y 27)), 97894#(and (<= Main_y 26) (<= 26 Main_y)), 97897#(and (<= 29 Main_y) (<= Main_y 29)), 97896#(and (<= 28 Main_y) (<= Main_y 28)), 97899#(and (<= Main_y 31) (<= 31 Main_y)), 97898#(and (<= 30 Main_y) (<= Main_y 30)), 97901#(and (<= 33 Main_y) (<= Main_y 33)), 97900#(and (<= 32 Main_y) (<= Main_y 32)), 97903#(and (<= 35 Main_y) (<= Main_y 35)), 97902#(and (<= Main_y 34) (<= 34 Main_y)), 97905#(and (<= Main_y 37) (<= 37 Main_y)), 97904#(and (<= 36 Main_y) (<= Main_y 36)), 97907#(and (<= 39 Main_y) (<= Main_y 39)), 97906#(and (<= Main_y 38) (<= 38 Main_y)), 97909#(and (<= Main_y 41) (<= 41 Main_y)), 97908#(and (<= 40 Main_y) (<= Main_y 40)), 97911#(and (<= 43 Main_y) (<= Main_y 43)), 97910#(and (<= 42 Main_y) (<= Main_y 42)), 97913#(and (<= Main_y 45) (<= 45 Main_y)), 97912#(and (<= 44 Main_y) (<= Main_y 44)), 97915#(and (<= 47 Main_y) (<= Main_y 47)), 97914#(and (<= 46 Main_y) (<= Main_y 46)), 97917#(and (<= 49 Main_y) (<= Main_y 49)), 97916#(and (<= 48 Main_y) (<= Main_y 48)), 97919#(and (<= 51 Main_y) (<= Main_y 51)), 97918#(and (<= 50 Main_y) (<= Main_y 50))] [2018-07-23 13:57:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:26,204 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:57:26,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:57:26,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:57:26,204 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 79 states. [2018-07-23 13:57:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:26,994 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-07-23 13:57:26,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:57:26,994 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 157 [2018-07-23 13:57:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:26,995 INFO L225 Difference]: With dead ends: 239 [2018-07-23 13:57:26,995 INFO L226 Difference]: Without dead ends: 236 [2018-07-23 13:57:26,996 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:57:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-23 13:57:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 160. [2018-07-23 13:57:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-23 13:57:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-07-23 13:57:27,106 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2018-07-23 13:57:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:27,107 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-07-23 13:57:27,107 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:57:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-07-23 13:57:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-23 13:57:27,107 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:27,107 INFO L357 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-07-23 13:57:27,107 INFO L414 AbstractCegarLoop]: === Iteration 230 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2074405049, now seen corresponding path program 227 times [2018-07-23 13:57:27,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:27,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:27,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:57:27,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:27,355 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:57:27,355 INFO L185 omatonBuilderFactory]: Interpolants [98817#(<= Main_x 72), 98816#(<= Main_x 71), 98819#(<= Main_x 74), 98818#(<= Main_x 73), 98821#(<= Main_x 76), 98820#(<= Main_x 75), 98822#(<= (+ Main_x 1) 0), 98743#true, 98745#(<= Main_x 0), 98744#false, 98747#(<= Main_x 2), 98746#(<= Main_x 1), 98749#(<= Main_x 4), 98748#(<= Main_x 3), 98751#(<= Main_x 6), 98750#(<= Main_x 5), 98753#(<= Main_x 8), 98752#(<= Main_x 7), 98755#(<= Main_x 10), 98754#(<= Main_x 9), 98757#(<= Main_x 12), 98756#(<= Main_x 11), 98759#(<= Main_x 14), 98758#(<= Main_x 13), 98761#(<= Main_x 16), 98760#(<= Main_x 15), 98763#(<= Main_x 18), 98762#(<= Main_x 17), 98765#(<= Main_x 20), 98764#(<= Main_x 19), 98767#(<= Main_x 22), 98766#(<= Main_x 21), 98769#(<= Main_x 24), 98768#(<= Main_x 23), 98771#(<= Main_x 26), 98770#(<= Main_x 25), 98773#(<= Main_x 28), 98772#(<= Main_x 27), 98775#(<= Main_x 30), 98774#(<= Main_x 29), 98777#(<= Main_x 32), 98776#(<= Main_x 31), 98779#(<= Main_x 34), 98778#(<= Main_x 33), 98781#(<= Main_x 36), 98780#(<= Main_x 35), 98783#(<= Main_x 38), 98782#(<= Main_x 37), 98785#(<= Main_x 40), 98784#(<= Main_x 39), 98787#(<= Main_x 42), 98786#(<= Main_x 41), 98789#(<= Main_x 44), 98788#(<= Main_x 43), 98791#(<= Main_x 46), 98790#(<= Main_x 45), 98793#(<= Main_x 48), 98792#(<= Main_x 47), 98795#(<= Main_x 50), 98794#(<= Main_x 49), 98797#(<= Main_x 52), 98796#(<= Main_x 51), 98799#(<= Main_x 54), 98798#(<= Main_x 53), 98801#(<= Main_x 56), 98800#(<= Main_x 55), 98803#(<= Main_x 58), 98802#(<= Main_x 57), 98805#(<= Main_x 60), 98804#(<= Main_x 59), 98807#(<= Main_x 62), 98806#(<= Main_x 61), 98809#(<= Main_x 64), 98808#(<= Main_x 63), 98811#(<= Main_x 66), 98810#(<= Main_x 65), 98813#(<= Main_x 68), 98812#(<= Main_x 67), 98815#(<= Main_x 70), 98814#(<= Main_x 69)] [2018-07-23 13:57:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:27,355 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:57:27,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:57:27,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:57:27,356 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 80 states. [2018-07-23 13:57:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:27,674 INFO L93 Difference]: Finished difference Result 240 states and 242 transitions. [2018-07-23 13:57:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:57:27,674 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-23 13:57:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:27,674 INFO L225 Difference]: With dead ends: 240 [2018-07-23 13:57:27,674 INFO L226 Difference]: Without dead ends: 159 [2018-07-23 13:57:27,675 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:57:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-23 13:57:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-23 13:57:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-23 13:57:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-07-23 13:57:27,780 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 158 [2018-07-23 13:57:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:27,780 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-07-23 13:57:27,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:57:27,781 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-07-23 13:57:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-23 13:57:27,781 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:27,781 INFO L357 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-07-23 13:57:27,781 INFO L414 AbstractCegarLoop]: === Iteration 231 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:27,781 INFO L82 PathProgramCache]: Analyzing trace with hash 252932077, now seen corresponding path program 228 times [2018-07-23 13:57:27,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:27,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:27,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:57:27,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:27,997 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:57:27,997 INFO L185 omatonBuilderFactory]: Interpolants [99621#true, 99623#(<= 0 Main_x), 99622#false, 99625#(<= 2 Main_x), 99624#(<= 1 Main_x), 99627#(<= 4 Main_x), 99626#(<= 3 Main_x), 99629#(<= 6 Main_x), 99628#(<= 5 Main_x), 99631#(<= 8 Main_x), 99630#(<= 7 Main_x), 99633#(<= 10 Main_x), 99632#(<= 9 Main_x), 99635#(<= 12 Main_x), 99634#(<= 11 Main_x), 99637#(<= 14 Main_x), 99636#(<= 13 Main_x), 99639#(<= 16 Main_x), 99638#(<= 15 Main_x), 99641#(<= 18 Main_x), 99640#(<= 17 Main_x), 99643#(<= 20 Main_x), 99642#(<= 19 Main_x), 99645#(<= 22 Main_x), 99644#(<= 21 Main_x), 99647#(<= 24 Main_x), 99646#(<= 23 Main_x), 99649#(<= 26 Main_x), 99648#(<= 25 Main_x), 99651#(<= 28 Main_x), 99650#(<= 27 Main_x), 99653#(<= 30 Main_x), 99652#(<= 29 Main_x), 99655#(<= 32 Main_x), 99654#(<= 31 Main_x), 99657#(<= 34 Main_x), 99656#(<= 33 Main_x), 99659#(<= 36 Main_x), 99658#(<= 35 Main_x), 99661#(<= 38 Main_x), 99660#(<= 37 Main_x), 99663#(<= 40 Main_x), 99662#(<= 39 Main_x), 99665#(<= 42 Main_x), 99664#(<= 41 Main_x), 99667#(<= 44 Main_x), 99666#(<= 43 Main_x), 99669#(<= 46 Main_x), 99668#(<= 45 Main_x), 99671#(<= 48 Main_x), 99670#(<= 47 Main_x), 99673#(<= 50 Main_x), 99672#(<= 49 Main_x), 99675#(<= 52 Main_x), 99674#(<= 51 Main_x), 99677#(<= 54 Main_x), 99676#(<= 53 Main_x), 99679#(<= 56 Main_x), 99678#(<= 55 Main_x), 99681#(<= 58 Main_x), 99680#(<= 57 Main_x), 99683#(<= 60 Main_x), 99682#(<= 59 Main_x), 99685#(<= 62 Main_x), 99684#(<= 61 Main_x), 99687#(<= 64 Main_x), 99686#(<= 63 Main_x), 99689#(<= 66 Main_x), 99688#(<= 65 Main_x), 99691#(<= 68 Main_x), 99690#(<= 67 Main_x), 99693#(<= 70 Main_x), 99692#(<= 69 Main_x), 99695#(<= 72 Main_x), 99694#(<= 71 Main_x), 99697#(<= 74 Main_x), 99696#(<= 73 Main_x), 99699#(<= 76 Main_x), 99698#(<= 75 Main_x), 99700#(<= 77 Main_x)] [2018-07-23 13:57:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:27,998 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:57:27,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:57:27,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:57:27,998 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-07-23 13:57:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:28,138 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-07-23 13:57:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:57:28,139 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-23 13:57:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:28,139 INFO L225 Difference]: With dead ends: 163 [2018-07-23 13:57:28,139 INFO L226 Difference]: Without dead ends: 160 [2018-07-23 13:57:28,140 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:57:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-23 13:57:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-23 13:57:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-23 13:57:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-07-23 13:57:28,247 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-07-23 13:57:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:28,247 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-07-23 13:57:28,247 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:57:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-07-23 13:57:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-23 13:57:28,248 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:28,248 INFO L357 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1] [2018-07-23 13:57:28,248 INFO L414 AbstractCegarLoop]: === Iteration 232 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash -749101727, now seen corresponding path program 229 times [2018-07-23 13:57:28,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:28,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:28,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:57:28,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:28,643 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:57:28,643 INFO L185 omatonBuilderFactory]: Interpolants [100353#(and (<= Main_y 4) (<= 4 Main_y)), 100352#(and (<= Main_y 3) (<= 3 Main_y)), 100355#(and (<= Main_y 6) (<= 6 Main_y)), 100354#(and (<= Main_y 5) (<= 5 Main_y)), 100357#(and (<= 8 Main_y) (<= Main_y 8)), 100356#(and (<= 7 Main_y) (<= Main_y 7)), 100359#(and (<= 10 Main_y) (<= Main_y 10)), 100358#(and (<= Main_y 9) (<= 9 Main_y)), 100361#(and (<= 12 Main_y) (<= Main_y 12)), 100360#(and (<= 11 Main_y) (<= Main_y 11)), 100363#(and (<= 14 Main_y) (<= Main_y 14)), 100362#(and (<= 13 Main_y) (<= Main_y 13)), 100365#(and (<= 16 Main_y) (<= Main_y 16)), 100364#(and (<= Main_y 15) (<= 15 Main_y)), 100367#(and (<= Main_y 18) (<= 18 Main_y)), 100366#(and (<= Main_y 17) (<= 17 Main_y)), 100369#(and (<= 20 Main_y) (<= Main_y 20)), 100368#(and (<= Main_y 19) (<= 19 Main_y)), 100371#(and (<= Main_y 22) (<= 22 Main_y)), 100370#(and (<= 21 Main_y) (<= Main_y 21)), 100373#(and (<= Main_y 24) (<= 24 Main_y)), 100372#(and (<= 23 Main_y) (<= Main_y 23)), 100375#(and (<= Main_y 26) (<= 26 Main_y)), 100374#(and (<= 25 Main_y) (<= Main_y 25)), 100377#(and (<= 28 Main_y) (<= Main_y 28)), 100376#(and (<= 27 Main_y) (<= Main_y 27)), 100379#(and (<= 30 Main_y) (<= Main_y 30)), 100378#(and (<= 29 Main_y) (<= Main_y 29)), 100381#(and (<= 32 Main_y) (<= Main_y 32)), 100380#(and (<= Main_y 31) (<= 31 Main_y)), 100383#(and (<= Main_y 34) (<= 34 Main_y)), 100382#(and (<= 33 Main_y) (<= Main_y 33)), 100385#(and (<= 36 Main_y) (<= Main_y 36)), 100384#(and (<= 35 Main_y) (<= Main_y 35)), 100387#(and (<= Main_y 38) (<= 38 Main_y)), 100386#(and (<= Main_y 37) (<= 37 Main_y)), 100389#(and (<= 40 Main_y) (<= Main_y 40)), 100388#(and (<= 39 Main_y) (<= Main_y 39)), 100391#(and (<= 42 Main_y) (<= Main_y 42)), 100390#(and (<= Main_y 41) (<= 41 Main_y)), 100393#(and (<= 44 Main_y) (<= Main_y 44)), 100392#(and (<= 43 Main_y) (<= Main_y 43)), 100395#(and (<= 46 Main_y) (<= Main_y 46)), 100394#(and (<= Main_y 45) (<= 45 Main_y)), 100397#(and (<= 48 Main_y) (<= Main_y 48)), 100396#(and (<= 47 Main_y) (<= Main_y 47)), 100399#(and (<= 50 Main_y) (<= Main_y 50)), 100398#(and (<= 49 Main_y) (<= Main_y 49)), 100401#(and (<= 52 Main_y) (<= Main_y 52)), 100400#(and (<= 51 Main_y) (<= Main_y 51)), 100403#(and (<= 54 Main_y) (<= Main_y 54)), 100402#(and (<= 53 Main_y) (<= Main_y 53)), 100405#(and (<= Main_y 56) (<= 56 Main_y)), 100404#(and (<= 55 Main_y) (<= Main_y 55)), 100407#(and (<= Main_y 58) (<= 58 Main_y)), 100406#(and (<= Main_y 57) (<= 57 Main_y)), 100409#(and (<= Main_y 60) (<= 60 Main_y)), 100408#(and (<= Main_y 59) (<= 59 Main_y)), 100411#(and (<= 62 Main_y) (<= Main_y 62)), 100410#(and (<= Main_y 61) (<= 61 Main_y)), 100413#(and (<= 64 Main_y) (<= Main_y 64)), 100412#(and (<= 63 Main_y) (<= Main_y 63)), 100415#(and (<= Main_y 66) (<= 66 Main_y)), 100414#(and (<= Main_y 65) (<= 65 Main_y)), 100417#(and (<= 68 Main_y) (<= Main_y 68)), 100416#(and (<= 67 Main_y) (<= Main_y 67)), 100419#(and (<= 70 Main_y) (<= Main_y 70)), 100418#(and (<= Main_y 69) (<= 69 Main_y)), 100421#(and (<= 72 Main_y) (<= Main_y 72)), 100420#(and (<= Main_y 71) (<= 71 Main_y)), 100423#(and (<= 74 Main_y) (<= Main_y 74)), 100422#(and (<= 73 Main_y) (<= Main_y 73)), 100425#(and (<= Main_y 76) (<= 76 Main_y)), 100424#(and (<= Main_y 75) (<= 75 Main_y)), 100426#(and (<= Main_y 77) (<= 77 Main_y)), 100347#true, 100349#(and (<= 0 Main_y) (<= Main_y 0)), 100348#false, 100351#(and (<= Main_y 2) (<= 2 Main_y)), 100350#(and (<= 1 Main_y) (<= Main_y 1))] [2018-07-23 13:57:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:28,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:57:28,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:57:28,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:57:28,644 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 80 states. [2018-07-23 13:57:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:29,461 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-07-23 13:57:29,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:57:29,461 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 159 [2018-07-23 13:57:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:29,462 INFO L225 Difference]: With dead ends: 242 [2018-07-23 13:57:29,462 INFO L226 Difference]: Without dead ends: 239 [2018-07-23 13:57:29,462 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:57:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-23 13:57:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 162. [2018-07-23 13:57:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-23 13:57:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-07-23 13:57:29,575 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 159 [2018-07-23 13:57:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:29,576 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-07-23 13:57:29,576 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:57:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-07-23 13:57:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 13:57:29,576 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:29,576 INFO L357 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-07-23 13:57:29,576 INFO L414 AbstractCegarLoop]: === Iteration 233 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:29,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1747378579, now seen corresponding path program 230 times [2018-07-23 13:57:29,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:29,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:29,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:57:29,788 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:29,788 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:57:29,788 INFO L185 omatonBuilderFactory]: Interpolants [101249#(<= Main_x 12), 101248#(<= Main_x 11), 101251#(<= Main_x 14), 101250#(<= Main_x 13), 101253#(<= Main_x 16), 101252#(<= Main_x 15), 101255#(<= Main_x 18), 101254#(<= Main_x 17), 101257#(<= Main_x 20), 101256#(<= Main_x 19), 101259#(<= Main_x 22), 101258#(<= Main_x 21), 101261#(<= Main_x 24), 101260#(<= Main_x 23), 101263#(<= Main_x 26), 101262#(<= Main_x 25), 101265#(<= Main_x 28), 101264#(<= Main_x 27), 101267#(<= Main_x 30), 101266#(<= Main_x 29), 101269#(<= Main_x 32), 101268#(<= Main_x 31), 101271#(<= Main_x 34), 101270#(<= Main_x 33), 101273#(<= Main_x 36), 101272#(<= Main_x 35), 101275#(<= Main_x 38), 101274#(<= Main_x 37), 101277#(<= Main_x 40), 101276#(<= Main_x 39), 101279#(<= Main_x 42), 101278#(<= Main_x 41), 101281#(<= Main_x 44), 101280#(<= Main_x 43), 101283#(<= Main_x 46), 101282#(<= Main_x 45), 101285#(<= Main_x 48), 101284#(<= Main_x 47), 101287#(<= Main_x 50), 101286#(<= Main_x 49), 101289#(<= Main_x 52), 101288#(<= Main_x 51), 101291#(<= Main_x 54), 101290#(<= Main_x 53), 101293#(<= Main_x 56), 101292#(<= Main_x 55), 101295#(<= Main_x 58), 101294#(<= Main_x 57), 101297#(<= Main_x 60), 101296#(<= Main_x 59), 101299#(<= Main_x 62), 101298#(<= Main_x 61), 101301#(<= Main_x 64), 101300#(<= Main_x 63), 101303#(<= Main_x 66), 101302#(<= Main_x 65), 101305#(<= Main_x 68), 101304#(<= Main_x 67), 101307#(<= Main_x 70), 101306#(<= Main_x 69), 101309#(<= Main_x 72), 101308#(<= Main_x 71), 101311#(<= Main_x 74), 101310#(<= Main_x 73), 101313#(<= Main_x 76), 101312#(<= Main_x 75), 101315#(<= (+ Main_x 1) 0), 101314#(<= Main_x 77), 101235#true, 101237#(<= Main_x 0), 101236#false, 101239#(<= Main_x 2), 101238#(<= Main_x 1), 101241#(<= Main_x 4), 101240#(<= Main_x 3), 101243#(<= Main_x 6), 101242#(<= Main_x 5), 101245#(<= Main_x 8), 101244#(<= Main_x 7), 101247#(<= Main_x 10), 101246#(<= Main_x 9)] [2018-07-23 13:57:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:29,789 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:57:29,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:57:29,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:57:29,789 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 81 states. [2018-07-23 13:57:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:30,113 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-07-23 13:57:30,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:57:30,113 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-23 13:57:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:30,114 INFO L225 Difference]: With dead ends: 243 [2018-07-23 13:57:30,114 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 13:57:30,114 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:57:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 13:57:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-23 13:57:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 13:57:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-07-23 13:57:30,224 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 160 [2018-07-23 13:57:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:30,224 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-07-23 13:57:30,224 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:57:30,224 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-07-23 13:57:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 13:57:30,225 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:30,225 INFO L357 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-07-23 13:57:30,225 INFO L414 AbstractCegarLoop]: === Iteration 234 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1680595591, now seen corresponding path program 231 times [2018-07-23 13:57:30,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:30,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:30,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:57:30,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:30,452 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:57:30,452 INFO L185 omatonBuilderFactory]: Interpolants [102145#(<= 19 Main_x), 102144#(<= 18 Main_x), 102147#(<= 21 Main_x), 102146#(<= 20 Main_x), 102149#(<= 23 Main_x), 102148#(<= 22 Main_x), 102151#(<= 25 Main_x), 102150#(<= 24 Main_x), 102153#(<= 27 Main_x), 102152#(<= 26 Main_x), 102155#(<= 29 Main_x), 102154#(<= 28 Main_x), 102157#(<= 31 Main_x), 102156#(<= 30 Main_x), 102159#(<= 33 Main_x), 102158#(<= 32 Main_x), 102161#(<= 35 Main_x), 102160#(<= 34 Main_x), 102163#(<= 37 Main_x), 102162#(<= 36 Main_x), 102165#(<= 39 Main_x), 102164#(<= 38 Main_x), 102167#(<= 41 Main_x), 102166#(<= 40 Main_x), 102169#(<= 43 Main_x), 102168#(<= 42 Main_x), 102171#(<= 45 Main_x), 102170#(<= 44 Main_x), 102173#(<= 47 Main_x), 102172#(<= 46 Main_x), 102175#(<= 49 Main_x), 102174#(<= 48 Main_x), 102177#(<= 51 Main_x), 102176#(<= 50 Main_x), 102179#(<= 53 Main_x), 102178#(<= 52 Main_x), 102181#(<= 55 Main_x), 102180#(<= 54 Main_x), 102183#(<= 57 Main_x), 102182#(<= 56 Main_x), 102185#(<= 59 Main_x), 102184#(<= 58 Main_x), 102187#(<= 61 Main_x), 102186#(<= 60 Main_x), 102189#(<= 63 Main_x), 102188#(<= 62 Main_x), 102191#(<= 65 Main_x), 102190#(<= 64 Main_x), 102193#(<= 67 Main_x), 102192#(<= 66 Main_x), 102195#(<= 69 Main_x), 102194#(<= 68 Main_x), 102197#(<= 71 Main_x), 102196#(<= 70 Main_x), 102199#(<= 73 Main_x), 102198#(<= 72 Main_x), 102201#(<= 75 Main_x), 102200#(<= 74 Main_x), 102203#(<= 77 Main_x), 102202#(<= 76 Main_x), 102204#(<= 78 Main_x), 102125#false, 102124#true, 102127#(<= 1 Main_x), 102126#(<= 0 Main_x), 102129#(<= 3 Main_x), 102128#(<= 2 Main_x), 102131#(<= 5 Main_x), 102130#(<= 4 Main_x), 102133#(<= 7 Main_x), 102132#(<= 6 Main_x), 102135#(<= 9 Main_x), 102134#(<= 8 Main_x), 102137#(<= 11 Main_x), 102136#(<= 10 Main_x), 102139#(<= 13 Main_x), 102138#(<= 12 Main_x), 102141#(<= 15 Main_x), 102140#(<= 14 Main_x), 102143#(<= 17 Main_x), 102142#(<= 16 Main_x)] [2018-07-23 13:57:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:30,453 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:57:30,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:57:30,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:57:30,453 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-07-23 13:57:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:30,615 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-07-23 13:57:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:57:30,615 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-23 13:57:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:30,615 INFO L225 Difference]: With dead ends: 165 [2018-07-23 13:57:30,615 INFO L226 Difference]: Without dead ends: 162 [2018-07-23 13:57:30,616 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:57:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-23 13:57:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-23 13:57:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-23 13:57:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-07-23 13:57:30,747 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 160 [2018-07-23 13:57:30,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-07-23 13:57:30,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:57:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-07-23 13:57:30,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-23 13:57:30,748 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:30,748 INFO L357 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1] [2018-07-23 13:57:30,748 INFO L414 AbstractCegarLoop]: === Iteration 235 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash 558794247, now seen corresponding path program 232 times [2018-07-23 13:57:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:31,181 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:31,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:57:31,181 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:31,181 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:57:31,182 INFO L185 omatonBuilderFactory]: Interpolants [102913#(and (<= 52 Main_y) (<= Main_y 52)), 102912#(and (<= 51 Main_y) (<= Main_y 51)), 102915#(and (<= 54 Main_y) (<= Main_y 54)), 102914#(and (<= 53 Main_y) (<= Main_y 53)), 102917#(and (<= Main_y 56) (<= 56 Main_y)), 102916#(and (<= 55 Main_y) (<= Main_y 55)), 102919#(and (<= Main_y 58) (<= 58 Main_y)), 102918#(and (<= Main_y 57) (<= 57 Main_y)), 102921#(and (<= Main_y 60) (<= 60 Main_y)), 102920#(and (<= Main_y 59) (<= 59 Main_y)), 102923#(and (<= 62 Main_y) (<= Main_y 62)), 102922#(and (<= Main_y 61) (<= 61 Main_y)), 102925#(and (<= 64 Main_y) (<= Main_y 64)), 102924#(and (<= 63 Main_y) (<= Main_y 63)), 102927#(and (<= Main_y 66) (<= 66 Main_y)), 102926#(and (<= Main_y 65) (<= 65 Main_y)), 102929#(and (<= 68 Main_y) (<= Main_y 68)), 102928#(and (<= 67 Main_y) (<= Main_y 67)), 102931#(and (<= 70 Main_y) (<= Main_y 70)), 102930#(and (<= Main_y 69) (<= 69 Main_y)), 102933#(and (<= 72 Main_y) (<= Main_y 72)), 102932#(and (<= Main_y 71) (<= 71 Main_y)), 102935#(and (<= 74 Main_y) (<= Main_y 74)), 102934#(and (<= 73 Main_y) (<= Main_y 73)), 102937#(and (<= Main_y 76) (<= 76 Main_y)), 102936#(and (<= Main_y 75) (<= 75 Main_y)), 102939#(and (<= Main_y 78) (<= 78 Main_y)), 102938#(and (<= Main_y 77) (<= 77 Main_y)), 102859#true, 102861#(and (<= 0 Main_y) (<= Main_y 0)), 102860#false, 102863#(and (<= Main_y 2) (<= 2 Main_y)), 102862#(and (<= 1 Main_y) (<= Main_y 1)), 102865#(and (<= Main_y 4) (<= 4 Main_y)), 102864#(and (<= Main_y 3) (<= 3 Main_y)), 102867#(and (<= Main_y 6) (<= 6 Main_y)), 102866#(and (<= Main_y 5) (<= 5 Main_y)), 102869#(and (<= 8 Main_y) (<= Main_y 8)), 102868#(and (<= 7 Main_y) (<= Main_y 7)), 102871#(and (<= 10 Main_y) (<= Main_y 10)), 102870#(and (<= Main_y 9) (<= 9 Main_y)), 102873#(and (<= 12 Main_y) (<= Main_y 12)), 102872#(and (<= 11 Main_y) (<= Main_y 11)), 102875#(and (<= 14 Main_y) (<= Main_y 14)), 102874#(and (<= 13 Main_y) (<= Main_y 13)), 102877#(and (<= 16 Main_y) (<= Main_y 16)), 102876#(and (<= Main_y 15) (<= 15 Main_y)), 102879#(and (<= Main_y 18) (<= 18 Main_y)), 102878#(and (<= Main_y 17) (<= 17 Main_y)), 102881#(and (<= 20 Main_y) (<= Main_y 20)), 102880#(and (<= Main_y 19) (<= 19 Main_y)), 102883#(and (<= Main_y 22) (<= 22 Main_y)), 102882#(and (<= 21 Main_y) (<= Main_y 21)), 102885#(and (<= Main_y 24) (<= 24 Main_y)), 102884#(and (<= 23 Main_y) (<= Main_y 23)), 102887#(and (<= Main_y 26) (<= 26 Main_y)), 102886#(and (<= 25 Main_y) (<= Main_y 25)), 102889#(and (<= 28 Main_y) (<= Main_y 28)), 102888#(and (<= 27 Main_y) (<= Main_y 27)), 102891#(and (<= 30 Main_y) (<= Main_y 30)), 102890#(and (<= 29 Main_y) (<= Main_y 29)), 102893#(and (<= 32 Main_y) (<= Main_y 32)), 102892#(and (<= Main_y 31) (<= 31 Main_y)), 102895#(and (<= Main_y 34) (<= 34 Main_y)), 102894#(and (<= 33 Main_y) (<= Main_y 33)), 102897#(and (<= 36 Main_y) (<= Main_y 36)), 102896#(and (<= 35 Main_y) (<= Main_y 35)), 102899#(and (<= Main_y 38) (<= 38 Main_y)), 102898#(and (<= Main_y 37) (<= 37 Main_y)), 102901#(and (<= 40 Main_y) (<= Main_y 40)), 102900#(and (<= 39 Main_y) (<= Main_y 39)), 102903#(and (<= 42 Main_y) (<= Main_y 42)), 102902#(and (<= Main_y 41) (<= 41 Main_y)), 102905#(and (<= 44 Main_y) (<= Main_y 44)), 102904#(and (<= 43 Main_y) (<= Main_y 43)), 102907#(and (<= 46 Main_y) (<= Main_y 46)), 102906#(and (<= Main_y 45) (<= 45 Main_y)), 102909#(and (<= 48 Main_y) (<= Main_y 48)), 102908#(and (<= 47 Main_y) (<= Main_y 47)), 102911#(and (<= 50 Main_y) (<= Main_y 50)), 102910#(and (<= 49 Main_y) (<= Main_y 49))] [2018-07-23 13:57:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:31,182 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:57:31,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:57:31,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:57:31,183 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 81 states. [2018-07-23 13:57:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:32,117 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-07-23 13:57:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:57:32,117 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 161 [2018-07-23 13:57:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:32,118 INFO L225 Difference]: With dead ends: 245 [2018-07-23 13:57:32,118 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 13:57:32,118 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:57:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 13:57:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 164. [2018-07-23 13:57:32,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-23 13:57:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-07-23 13:57:32,237 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 161 [2018-07-23 13:57:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:32,237 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-07-23 13:57:32,237 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:57:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-07-23 13:57:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-23 13:57:32,237 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:32,237 INFO L357 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-07-23 13:57:32,237 INFO L414 AbstractCegarLoop]: === Iteration 236 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 142690951, now seen corresponding path program 233 times [2018-07-23 13:57:32,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:32,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:32,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:57:32,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:32,457 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:57:32,457 INFO L185 omatonBuilderFactory]: Interpolants [103809#(<= Main_x 49), 103808#(<= Main_x 48), 103811#(<= Main_x 51), 103810#(<= Main_x 50), 103813#(<= Main_x 53), 103812#(<= Main_x 52), 103815#(<= Main_x 55), 103814#(<= Main_x 54), 103817#(<= Main_x 57), 103816#(<= Main_x 56), 103819#(<= Main_x 59), 103818#(<= Main_x 58), 103821#(<= Main_x 61), 103820#(<= Main_x 60), 103823#(<= Main_x 63), 103822#(<= Main_x 62), 103825#(<= Main_x 65), 103824#(<= Main_x 64), 103827#(<= Main_x 67), 103826#(<= Main_x 66), 103829#(<= Main_x 69), 103828#(<= Main_x 68), 103831#(<= Main_x 71), 103830#(<= Main_x 70), 103833#(<= Main_x 73), 103832#(<= Main_x 72), 103835#(<= Main_x 75), 103834#(<= Main_x 74), 103837#(<= Main_x 77), 103836#(<= Main_x 76), 103839#(<= (+ Main_x 1) 0), 103838#(<= Main_x 78), 103759#false, 103758#true, 103761#(<= Main_x 1), 103760#(<= Main_x 0), 103763#(<= Main_x 3), 103762#(<= Main_x 2), 103765#(<= Main_x 5), 103764#(<= Main_x 4), 103767#(<= Main_x 7), 103766#(<= Main_x 6), 103769#(<= Main_x 9), 103768#(<= Main_x 8), 103771#(<= Main_x 11), 103770#(<= Main_x 10), 103773#(<= Main_x 13), 103772#(<= Main_x 12), 103775#(<= Main_x 15), 103774#(<= Main_x 14), 103777#(<= Main_x 17), 103776#(<= Main_x 16), 103779#(<= Main_x 19), 103778#(<= Main_x 18), 103781#(<= Main_x 21), 103780#(<= Main_x 20), 103783#(<= Main_x 23), 103782#(<= Main_x 22), 103785#(<= Main_x 25), 103784#(<= Main_x 24), 103787#(<= Main_x 27), 103786#(<= Main_x 26), 103789#(<= Main_x 29), 103788#(<= Main_x 28), 103791#(<= Main_x 31), 103790#(<= Main_x 30), 103793#(<= Main_x 33), 103792#(<= Main_x 32), 103795#(<= Main_x 35), 103794#(<= Main_x 34), 103797#(<= Main_x 37), 103796#(<= Main_x 36), 103799#(<= Main_x 39), 103798#(<= Main_x 38), 103801#(<= Main_x 41), 103800#(<= Main_x 40), 103803#(<= Main_x 43), 103802#(<= Main_x 42), 103805#(<= Main_x 45), 103804#(<= Main_x 44), 103807#(<= Main_x 47), 103806#(<= Main_x 46)] [2018-07-23 13:57:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:32,457 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:57:32,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:57:32,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:57:32,458 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 82 states. [2018-07-23 13:57:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:32,755 INFO L93 Difference]: Finished difference Result 246 states and 248 transitions. [2018-07-23 13:57:32,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:57:32,755 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-23 13:57:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:32,756 INFO L225 Difference]: With dead ends: 246 [2018-07-23 13:57:32,756 INFO L226 Difference]: Without dead ends: 163 [2018-07-23 13:57:32,756 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:57:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-23 13:57:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-23 13:57:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 13:57:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-07-23 13:57:32,868 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 162 [2018-07-23 13:57:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:32,868 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-07-23 13:57:32,868 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:57:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-07-23 13:57:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-23 13:57:32,869 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:32,869 INFO L357 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-07-23 13:57:32,869 INFO L414 AbstractCegarLoop]: === Iteration 237 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash -964292179, now seen corresponding path program 234 times [2018-07-23 13:57:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:33,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:33,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:57:33,114 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:33,115 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:57:33,115 INFO L185 omatonBuilderFactory]: Interpolants [104705#(<= 45 Main_x), 104704#(<= 44 Main_x), 104707#(<= 47 Main_x), 104706#(<= 46 Main_x), 104709#(<= 49 Main_x), 104708#(<= 48 Main_x), 104711#(<= 51 Main_x), 104710#(<= 50 Main_x), 104713#(<= 53 Main_x), 104712#(<= 52 Main_x), 104715#(<= 55 Main_x), 104714#(<= 54 Main_x), 104717#(<= 57 Main_x), 104716#(<= 56 Main_x), 104719#(<= 59 Main_x), 104718#(<= 58 Main_x), 104721#(<= 61 Main_x), 104720#(<= 60 Main_x), 104723#(<= 63 Main_x), 104722#(<= 62 Main_x), 104725#(<= 65 Main_x), 104724#(<= 64 Main_x), 104727#(<= 67 Main_x), 104726#(<= 66 Main_x), 104729#(<= 69 Main_x), 104728#(<= 68 Main_x), 104731#(<= 71 Main_x), 104730#(<= 70 Main_x), 104733#(<= 73 Main_x), 104732#(<= 72 Main_x), 104735#(<= 75 Main_x), 104734#(<= 74 Main_x), 104737#(<= 77 Main_x), 104736#(<= 76 Main_x), 104739#(<= 79 Main_x), 104738#(<= 78 Main_x), 104659#false, 104658#true, 104661#(<= 1 Main_x), 104660#(<= 0 Main_x), 104663#(<= 3 Main_x), 104662#(<= 2 Main_x), 104665#(<= 5 Main_x), 104664#(<= 4 Main_x), 104667#(<= 7 Main_x), 104666#(<= 6 Main_x), 104669#(<= 9 Main_x), 104668#(<= 8 Main_x), 104671#(<= 11 Main_x), 104670#(<= 10 Main_x), 104673#(<= 13 Main_x), 104672#(<= 12 Main_x), 104675#(<= 15 Main_x), 104674#(<= 14 Main_x), 104677#(<= 17 Main_x), 104676#(<= 16 Main_x), 104679#(<= 19 Main_x), 104678#(<= 18 Main_x), 104681#(<= 21 Main_x), 104680#(<= 20 Main_x), 104683#(<= 23 Main_x), 104682#(<= 22 Main_x), 104685#(<= 25 Main_x), 104684#(<= 24 Main_x), 104687#(<= 27 Main_x), 104686#(<= 26 Main_x), 104689#(<= 29 Main_x), 104688#(<= 28 Main_x), 104691#(<= 31 Main_x), 104690#(<= 30 Main_x), 104693#(<= 33 Main_x), 104692#(<= 32 Main_x), 104695#(<= 35 Main_x), 104694#(<= 34 Main_x), 104697#(<= 37 Main_x), 104696#(<= 36 Main_x), 104699#(<= 39 Main_x), 104698#(<= 38 Main_x), 104701#(<= 41 Main_x), 104700#(<= 40 Main_x), 104703#(<= 43 Main_x), 104702#(<= 42 Main_x)] [2018-07-23 13:57:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3160 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:33,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:57:33,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:57:33,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:57:33,116 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-07-23 13:57:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:33,302 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-07-23 13:57:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:57:33,302 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-23 13:57:33,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:33,302 INFO L225 Difference]: With dead ends: 167 [2018-07-23 13:57:33,303 INFO L226 Difference]: Without dead ends: 164 [2018-07-23 13:57:33,303 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:57:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-23 13:57:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-23 13:57:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-23 13:57:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2018-07-23 13:57:33,430 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 162 [2018-07-23 13:57:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2018-07-23 13:57:33,431 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:57:33,431 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2018-07-23 13:57:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-23 13:57:33,431 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:33,431 INFO L357 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1] [2018-07-23 13:57:33,431 INFO L414 AbstractCegarLoop]: === Iteration 238 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:33,431 INFO L82 PathProgramCache]: Analyzing trace with hash 171652001, now seen corresponding path program 235 times [2018-07-23 13:57:33,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:33,816 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:33,816 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:57:33,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:33,816 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:57:33,816 INFO L185 omatonBuilderFactory]: Interpolants [105473#(and (<= Main_y 69) (<= 69 Main_y)), 105472#(and (<= 68 Main_y) (<= Main_y 68)), 105475#(and (<= Main_y 71) (<= 71 Main_y)), 105474#(and (<= 70 Main_y) (<= Main_y 70)), 105477#(and (<= 73 Main_y) (<= Main_y 73)), 105476#(and (<= 72 Main_y) (<= Main_y 72)), 105479#(and (<= Main_y 75) (<= 75 Main_y)), 105478#(and (<= 74 Main_y) (<= Main_y 74)), 105481#(and (<= Main_y 77) (<= 77 Main_y)), 105480#(and (<= Main_y 76) (<= 76 Main_y)), 105483#(and (<= 79 Main_y) (<= Main_y 79)), 105482#(and (<= Main_y 78) (<= 78 Main_y)), 105403#false, 105402#true, 105405#(and (<= 1 Main_y) (<= Main_y 1)), 105404#(and (<= 0 Main_y) (<= Main_y 0)), 105407#(and (<= Main_y 3) (<= 3 Main_y)), 105406#(and (<= Main_y 2) (<= 2 Main_y)), 105409#(and (<= Main_y 5) (<= 5 Main_y)), 105408#(and (<= Main_y 4) (<= 4 Main_y)), 105411#(and (<= 7 Main_y) (<= Main_y 7)), 105410#(and (<= Main_y 6) (<= 6 Main_y)), 105413#(and (<= Main_y 9) (<= 9 Main_y)), 105412#(and (<= 8 Main_y) (<= Main_y 8)), 105415#(and (<= 11 Main_y) (<= Main_y 11)), 105414#(and (<= 10 Main_y) (<= Main_y 10)), 105417#(and (<= 13 Main_y) (<= Main_y 13)), 105416#(and (<= 12 Main_y) (<= Main_y 12)), 105419#(and (<= Main_y 15) (<= 15 Main_y)), 105418#(and (<= 14 Main_y) (<= Main_y 14)), 105421#(and (<= Main_y 17) (<= 17 Main_y)), 105420#(and (<= 16 Main_y) (<= Main_y 16)), 105423#(and (<= Main_y 19) (<= 19 Main_y)), 105422#(and (<= Main_y 18) (<= 18 Main_y)), 105425#(and (<= 21 Main_y) (<= Main_y 21)), 105424#(and (<= 20 Main_y) (<= Main_y 20)), 105427#(and (<= 23 Main_y) (<= Main_y 23)), 105426#(and (<= Main_y 22) (<= 22 Main_y)), 105429#(and (<= 25 Main_y) (<= Main_y 25)), 105428#(and (<= Main_y 24) (<= 24 Main_y)), 105431#(and (<= 27 Main_y) (<= Main_y 27)), 105430#(and (<= Main_y 26) (<= 26 Main_y)), 105433#(and (<= 29 Main_y) (<= Main_y 29)), 105432#(and (<= 28 Main_y) (<= Main_y 28)), 105435#(and (<= Main_y 31) (<= 31 Main_y)), 105434#(and (<= 30 Main_y) (<= Main_y 30)), 105437#(and (<= 33 Main_y) (<= Main_y 33)), 105436#(and (<= 32 Main_y) (<= Main_y 32)), 105439#(and (<= 35 Main_y) (<= Main_y 35)), 105438#(and (<= Main_y 34) (<= 34 Main_y)), 105441#(and (<= Main_y 37) (<= 37 Main_y)), 105440#(and (<= 36 Main_y) (<= Main_y 36)), 105443#(and (<= 39 Main_y) (<= Main_y 39)), 105442#(and (<= Main_y 38) (<= 38 Main_y)), 105445#(and (<= Main_y 41) (<= 41 Main_y)), 105444#(and (<= 40 Main_y) (<= Main_y 40)), 105447#(and (<= 43 Main_y) (<= Main_y 43)), 105446#(and (<= 42 Main_y) (<= Main_y 42)), 105449#(and (<= Main_y 45) (<= 45 Main_y)), 105448#(and (<= 44 Main_y) (<= Main_y 44)), 105451#(and (<= 47 Main_y) (<= Main_y 47)), 105450#(and (<= 46 Main_y) (<= Main_y 46)), 105453#(and (<= 49 Main_y) (<= Main_y 49)), 105452#(and (<= 48 Main_y) (<= Main_y 48)), 105455#(and (<= 51 Main_y) (<= Main_y 51)), 105454#(and (<= 50 Main_y) (<= Main_y 50)), 105457#(and (<= 53 Main_y) (<= Main_y 53)), 105456#(and (<= 52 Main_y) (<= Main_y 52)), 105459#(and (<= 55 Main_y) (<= Main_y 55)), 105458#(and (<= 54 Main_y) (<= Main_y 54)), 105461#(and (<= Main_y 57) (<= 57 Main_y)), 105460#(and (<= Main_y 56) (<= 56 Main_y)), 105463#(and (<= Main_y 59) (<= 59 Main_y)), 105462#(and (<= Main_y 58) (<= 58 Main_y)), 105465#(and (<= Main_y 61) (<= 61 Main_y)), 105464#(and (<= Main_y 60) (<= 60 Main_y)), 105467#(and (<= 63 Main_y) (<= Main_y 63)), 105466#(and (<= 62 Main_y) (<= Main_y 62)), 105469#(and (<= Main_y 65) (<= 65 Main_y)), 105468#(and (<= 64 Main_y) (<= Main_y 64)), 105471#(and (<= 67 Main_y) (<= Main_y 67)), 105470#(and (<= Main_y 66) (<= 66 Main_y))] [2018-07-23 13:57:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:33,817 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:57:33,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:57:33,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:57:33,817 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand 82 states. [2018-07-23 13:57:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:34,766 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-07-23 13:57:34,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:57:34,767 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 163 [2018-07-23 13:57:34,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:34,767 INFO L225 Difference]: With dead ends: 248 [2018-07-23 13:57:34,767 INFO L226 Difference]: Without dead ends: 245 [2018-07-23 13:57:34,768 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:57:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-23 13:57:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 166. [2018-07-23 13:57:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-23 13:57:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-07-23 13:57:34,902 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 163 [2018-07-23 13:57:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:34,902 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-07-23 13:57:34,902 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:57:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-07-23 13:57:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 13:57:34,903 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:34,903 INFO L357 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2018-07-23 13:57:34,903 INFO L414 AbstractCegarLoop]: === Iteration 239 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:34,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1026183213, now seen corresponding path program 236 times [2018-07-23 13:57:34,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3240 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:35,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:35,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:57:35,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:35,185 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:57:35,185 INFO L185 omatonBuilderFactory]: Interpolants [106369#(<= Main_x 55), 106368#(<= Main_x 54), 106371#(<= Main_x 57), 106370#(<= Main_x 56), 106373#(<= Main_x 59), 106372#(<= Main_x 58), 106375#(<= Main_x 61), 106374#(<= Main_x 60), 106377#(<= Main_x 63), 106376#(<= Main_x 62), 106379#(<= Main_x 65), 106378#(<= Main_x 64), 106381#(<= Main_x 67), 106380#(<= Main_x 66), 106383#(<= Main_x 69), 106382#(<= Main_x 68), 106385#(<= Main_x 71), 106384#(<= Main_x 70), 106387#(<= Main_x 73), 106386#(<= Main_x 72), 106389#(<= Main_x 75), 106388#(<= Main_x 74), 106391#(<= Main_x 77), 106390#(<= Main_x 76), 106393#(<= Main_x 79), 106392#(<= Main_x 78), 106394#(<= (+ Main_x 1) 0), 106313#false, 106312#true, 106315#(<= Main_x 1), 106314#(<= Main_x 0), 106317#(<= Main_x 3), 106316#(<= Main_x 2), 106319#(<= Main_x 5), 106318#(<= Main_x 4), 106321#(<= Main_x 7), 106320#(<= Main_x 6), 106323#(<= Main_x 9), 106322#(<= Main_x 8), 106325#(<= Main_x 11), 106324#(<= Main_x 10), 106327#(<= Main_x 13), 106326#(<= Main_x 12), 106329#(<= Main_x 15), 106328#(<= Main_x 14), 106331#(<= Main_x 17), 106330#(<= Main_x 16), 106333#(<= Main_x 19), 106332#(<= Main_x 18), 106335#(<= Main_x 21), 106334#(<= Main_x 20), 106337#(<= Main_x 23), 106336#(<= Main_x 22), 106339#(<= Main_x 25), 106338#(<= Main_x 24), 106341#(<= Main_x 27), 106340#(<= Main_x 26), 106343#(<= Main_x 29), 106342#(<= Main_x 28), 106345#(<= Main_x 31), 106344#(<= Main_x 30), 106347#(<= Main_x 33), 106346#(<= Main_x 32), 106349#(<= Main_x 35), 106348#(<= Main_x 34), 106351#(<= Main_x 37), 106350#(<= Main_x 36), 106353#(<= Main_x 39), 106352#(<= Main_x 38), 106355#(<= Main_x 41), 106354#(<= Main_x 40), 106357#(<= Main_x 43), 106356#(<= Main_x 42), 106359#(<= Main_x 45), 106358#(<= Main_x 44), 106361#(<= Main_x 47), 106360#(<= Main_x 46), 106363#(<= Main_x 49), 106362#(<= Main_x 48), 106365#(<= Main_x 51), 106364#(<= Main_x 50), 106367#(<= Main_x 53), 106366#(<= Main_x 52)] [2018-07-23 13:57:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3240 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:35,186 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:57:35,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:57:35,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:57:35,186 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 83 states. [2018-07-23 13:57:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:35,551 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2018-07-23 13:57:35,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:57:35,551 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-23 13:57:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:35,551 INFO L225 Difference]: With dead ends: 249 [2018-07-23 13:57:35,551 INFO L226 Difference]: Without dead ends: 165 [2018-07-23 13:57:35,552 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:57:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-23 13:57:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-23 13:57:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 13:57:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-07-23 13:57:35,671 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 164 [2018-07-23 13:57:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:35,671 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-07-23 13:57:35,671 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:57:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-07-23 13:57:35,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 13:57:35,671 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:35,671 INFO L357 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2018-07-23 13:57:35,672 INFO L414 AbstractCegarLoop]: === Iteration 240 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1069444551, now seen corresponding path program 237 times [2018-07-23 13:57:35,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3240 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:35,913 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:35,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:57:35,914 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:35,914 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:57:35,914 INFO L185 omatonBuilderFactory]: Interpolants [107265#(<= 40 Main_x), 107264#(<= 39 Main_x), 107267#(<= 42 Main_x), 107266#(<= 41 Main_x), 107269#(<= 44 Main_x), 107268#(<= 43 Main_x), 107271#(<= 46 Main_x), 107270#(<= 45 Main_x), 107273#(<= 48 Main_x), 107272#(<= 47 Main_x), 107275#(<= 50 Main_x), 107274#(<= 49 Main_x), 107277#(<= 52 Main_x), 107276#(<= 51 Main_x), 107279#(<= 54 Main_x), 107278#(<= 53 Main_x), 107281#(<= 56 Main_x), 107280#(<= 55 Main_x), 107283#(<= 58 Main_x), 107282#(<= 57 Main_x), 107285#(<= 60 Main_x), 107284#(<= 59 Main_x), 107287#(<= 62 Main_x), 107286#(<= 61 Main_x), 107289#(<= 64 Main_x), 107288#(<= 63 Main_x), 107291#(<= 66 Main_x), 107290#(<= 65 Main_x), 107293#(<= 68 Main_x), 107292#(<= 67 Main_x), 107295#(<= 70 Main_x), 107294#(<= 69 Main_x), 107297#(<= 72 Main_x), 107296#(<= 71 Main_x), 107299#(<= 74 Main_x), 107298#(<= 73 Main_x), 107301#(<= 76 Main_x), 107300#(<= 75 Main_x), 107303#(<= 78 Main_x), 107302#(<= 77 Main_x), 107305#(<= 80 Main_x), 107304#(<= 79 Main_x), 107223#true, 107225#(<= 0 Main_x), 107224#false, 107227#(<= 2 Main_x), 107226#(<= 1 Main_x), 107229#(<= 4 Main_x), 107228#(<= 3 Main_x), 107231#(<= 6 Main_x), 107230#(<= 5 Main_x), 107233#(<= 8 Main_x), 107232#(<= 7 Main_x), 107235#(<= 10 Main_x), 107234#(<= 9 Main_x), 107237#(<= 12 Main_x), 107236#(<= 11 Main_x), 107239#(<= 14 Main_x), 107238#(<= 13 Main_x), 107241#(<= 16 Main_x), 107240#(<= 15 Main_x), 107243#(<= 18 Main_x), 107242#(<= 17 Main_x), 107245#(<= 20 Main_x), 107244#(<= 19 Main_x), 107247#(<= 22 Main_x), 107246#(<= 21 Main_x), 107249#(<= 24 Main_x), 107248#(<= 23 Main_x), 107251#(<= 26 Main_x), 107250#(<= 25 Main_x), 107253#(<= 28 Main_x), 107252#(<= 27 Main_x), 107255#(<= 30 Main_x), 107254#(<= 29 Main_x), 107257#(<= 32 Main_x), 107256#(<= 31 Main_x), 107259#(<= 34 Main_x), 107258#(<= 33 Main_x), 107261#(<= 36 Main_x), 107260#(<= 35 Main_x), 107263#(<= 38 Main_x), 107262#(<= 37 Main_x)] [2018-07-23 13:57:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3240 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:35,914 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:57:35,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:57:35,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:57:35,915 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-07-23 13:57:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:36,082 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-07-23 13:57:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:57:36,082 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-23 13:57:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:36,082 INFO L225 Difference]: With dead ends: 169 [2018-07-23 13:57:36,082 INFO L226 Difference]: Without dead ends: 166 [2018-07-23 13:57:36,083 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:57:36,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-23 13:57:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-23 13:57:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-23 13:57:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-07-23 13:57:36,198 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-07-23 13:57:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:36,199 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-07-23 13:57:36,199 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:57:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-07-23 13:57:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-23 13:57:36,199 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:36,199 INFO L357 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1] [2018-07-23 13:57:36,199 INFO L414 AbstractCegarLoop]: === Iteration 241 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1207018809, now seen corresponding path program 238 times [2018-07-23 13:57:36,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:36,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:36,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:57:36,571 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:36,572 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:57:36,572 INFO L185 omatonBuilderFactory]: Interpolants [108033#(and (<= 55 Main_y) (<= Main_y 55)), 108032#(and (<= 54 Main_y) (<= Main_y 54)), 108035#(and (<= Main_y 57) (<= 57 Main_y)), 108034#(and (<= Main_y 56) (<= 56 Main_y)), 108037#(and (<= Main_y 59) (<= 59 Main_y)), 108036#(and (<= Main_y 58) (<= 58 Main_y)), 108039#(and (<= Main_y 61) (<= 61 Main_y)), 108038#(and (<= Main_y 60) (<= 60 Main_y)), 108041#(and (<= 63 Main_y) (<= Main_y 63)), 108040#(and (<= 62 Main_y) (<= Main_y 62)), 108043#(and (<= Main_y 65) (<= 65 Main_y)), 108042#(and (<= 64 Main_y) (<= Main_y 64)), 108045#(and (<= 67 Main_y) (<= Main_y 67)), 108044#(and (<= Main_y 66) (<= 66 Main_y)), 108047#(and (<= Main_y 69) (<= 69 Main_y)), 108046#(and (<= 68 Main_y) (<= Main_y 68)), 108049#(and (<= Main_y 71) (<= 71 Main_y)), 108048#(and (<= 70 Main_y) (<= Main_y 70)), 108051#(and (<= 73 Main_y) (<= Main_y 73)), 108050#(and (<= 72 Main_y) (<= Main_y 72)), 108053#(and (<= Main_y 75) (<= 75 Main_y)), 108052#(and (<= 74 Main_y) (<= Main_y 74)), 108055#(and (<= Main_y 77) (<= 77 Main_y)), 108054#(and (<= Main_y 76) (<= 76 Main_y)), 108057#(and (<= 79 Main_y) (<= Main_y 79)), 108056#(and (<= Main_y 78) (<= 78 Main_y)), 108058#(and (<= Main_y 80) (<= 80 Main_y)), 107977#false, 107976#true, 107979#(and (<= 1 Main_y) (<= Main_y 1)), 107978#(and (<= 0 Main_y) (<= Main_y 0)), 107981#(and (<= Main_y 3) (<= 3 Main_y)), 107980#(and (<= Main_y 2) (<= 2 Main_y)), 107983#(and (<= Main_y 5) (<= 5 Main_y)), 107982#(and (<= Main_y 4) (<= 4 Main_y)), 107985#(and (<= 7 Main_y) (<= Main_y 7)), 107984#(and (<= Main_y 6) (<= 6 Main_y)), 107987#(and (<= Main_y 9) (<= 9 Main_y)), 107986#(and (<= 8 Main_y) (<= Main_y 8)), 107989#(and (<= 11 Main_y) (<= Main_y 11)), 107988#(and (<= 10 Main_y) (<= Main_y 10)), 107991#(and (<= 13 Main_y) (<= Main_y 13)), 107990#(and (<= 12 Main_y) (<= Main_y 12)), 107993#(and (<= Main_y 15) (<= 15 Main_y)), 107992#(and (<= 14 Main_y) (<= Main_y 14)), 107995#(and (<= Main_y 17) (<= 17 Main_y)), 107994#(and (<= 16 Main_y) (<= Main_y 16)), 107997#(and (<= Main_y 19) (<= 19 Main_y)), 107996#(and (<= Main_y 18) (<= 18 Main_y)), 107999#(and (<= 21 Main_y) (<= Main_y 21)), 107998#(and (<= 20 Main_y) (<= Main_y 20)), 108001#(and (<= 23 Main_y) (<= Main_y 23)), 108000#(and (<= Main_y 22) (<= 22 Main_y)), 108003#(and (<= 25 Main_y) (<= Main_y 25)), 108002#(and (<= Main_y 24) (<= 24 Main_y)), 108005#(and (<= 27 Main_y) (<= Main_y 27)), 108004#(and (<= Main_y 26) (<= 26 Main_y)), 108007#(and (<= 29 Main_y) (<= Main_y 29)), 108006#(and (<= 28 Main_y) (<= Main_y 28)), 108009#(and (<= Main_y 31) (<= 31 Main_y)), 108008#(and (<= 30 Main_y) (<= Main_y 30)), 108011#(and (<= 33 Main_y) (<= Main_y 33)), 108010#(and (<= 32 Main_y) (<= Main_y 32)), 108013#(and (<= 35 Main_y) (<= Main_y 35)), 108012#(and (<= Main_y 34) (<= 34 Main_y)), 108015#(and (<= Main_y 37) (<= 37 Main_y)), 108014#(and (<= 36 Main_y) (<= Main_y 36)), 108017#(and (<= 39 Main_y) (<= Main_y 39)), 108016#(and (<= Main_y 38) (<= 38 Main_y)), 108019#(and (<= Main_y 41) (<= 41 Main_y)), 108018#(and (<= 40 Main_y) (<= Main_y 40)), 108021#(and (<= 43 Main_y) (<= Main_y 43)), 108020#(and (<= 42 Main_y) (<= Main_y 42)), 108023#(and (<= Main_y 45) (<= 45 Main_y)), 108022#(and (<= 44 Main_y) (<= Main_y 44)), 108025#(and (<= 47 Main_y) (<= Main_y 47)), 108024#(and (<= 46 Main_y) (<= Main_y 46)), 108027#(and (<= 49 Main_y) (<= Main_y 49)), 108026#(and (<= 48 Main_y) (<= Main_y 48)), 108029#(and (<= 51 Main_y) (<= Main_y 51)), 108028#(and (<= 50 Main_y) (<= Main_y 50)), 108031#(and (<= 53 Main_y) (<= Main_y 53)), 108030#(and (<= 52 Main_y) (<= Main_y 52))] [2018-07-23 13:57:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:36,572 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:57:36,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:57:36,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:57:36,573 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 83 states. [2018-07-23 13:57:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:37,553 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2018-07-23 13:57:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:57:37,553 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 165 [2018-07-23 13:57:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:37,554 INFO L225 Difference]: With dead ends: 251 [2018-07-23 13:57:37,554 INFO L226 Difference]: Without dead ends: 248 [2018-07-23 13:57:37,554 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:57:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-07-23 13:57:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 168. [2018-07-23 13:57:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-23 13:57:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-07-23 13:57:37,773 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 165 [2018-07-23 13:57:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:37,774 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-07-23 13:57:37,774 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:57:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-07-23 13:57:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 13:57:37,774 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:37,775 INFO L357 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2018-07-23 13:57:37,775 INFO L414 AbstractCegarLoop]: === Iteration 242 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1237061063, now seen corresponding path program 239 times [2018-07-23 13:57:37,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:38,088 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:38,088 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:57:38,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:38,089 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:57:38,089 INFO L185 omatonBuilderFactory]: Interpolants [108929#(<= Main_x 30), 108928#(<= Main_x 29), 108931#(<= Main_x 32), 108930#(<= Main_x 31), 108933#(<= Main_x 34), 108932#(<= Main_x 33), 108935#(<= Main_x 36), 108934#(<= Main_x 35), 108937#(<= Main_x 38), 108936#(<= Main_x 37), 108939#(<= Main_x 40), 108938#(<= Main_x 39), 108941#(<= Main_x 42), 108940#(<= Main_x 41), 108943#(<= Main_x 44), 108942#(<= Main_x 43), 108945#(<= Main_x 46), 108944#(<= Main_x 45), 108947#(<= Main_x 48), 108946#(<= Main_x 47), 108949#(<= Main_x 50), 108948#(<= Main_x 49), 108951#(<= Main_x 52), 108950#(<= Main_x 51), 108953#(<= Main_x 54), 108952#(<= Main_x 53), 108955#(<= Main_x 56), 108954#(<= Main_x 55), 108957#(<= Main_x 58), 108956#(<= Main_x 57), 108959#(<= Main_x 60), 108958#(<= Main_x 59), 108961#(<= Main_x 62), 108960#(<= Main_x 61), 108963#(<= Main_x 64), 108962#(<= Main_x 63), 108965#(<= Main_x 66), 108964#(<= Main_x 65), 108967#(<= Main_x 68), 108966#(<= Main_x 67), 108969#(<= Main_x 70), 108968#(<= Main_x 69), 108971#(<= Main_x 72), 108970#(<= Main_x 71), 108973#(<= Main_x 74), 108972#(<= Main_x 73), 108975#(<= Main_x 76), 108974#(<= Main_x 75), 108977#(<= Main_x 78), 108976#(<= Main_x 77), 108979#(<= Main_x 80), 108978#(<= Main_x 79), 108980#(<= (+ Main_x 1) 0), 108897#true, 108899#(<= Main_x 0), 108898#false, 108901#(<= Main_x 2), 108900#(<= Main_x 1), 108903#(<= Main_x 4), 108902#(<= Main_x 3), 108905#(<= Main_x 6), 108904#(<= Main_x 5), 108907#(<= Main_x 8), 108906#(<= Main_x 7), 108909#(<= Main_x 10), 108908#(<= Main_x 9), 108911#(<= Main_x 12), 108910#(<= Main_x 11), 108913#(<= Main_x 14), 108912#(<= Main_x 13), 108915#(<= Main_x 16), 108914#(<= Main_x 15), 108917#(<= Main_x 18), 108916#(<= Main_x 17), 108919#(<= Main_x 20), 108918#(<= Main_x 19), 108921#(<= Main_x 22), 108920#(<= Main_x 21), 108923#(<= Main_x 24), 108922#(<= Main_x 23), 108925#(<= Main_x 26), 108924#(<= Main_x 25), 108927#(<= Main_x 28), 108926#(<= Main_x 27)] [2018-07-23 13:57:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:38,090 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:57:38,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:57:38,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:57:38,090 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 84 states. [2018-07-23 13:57:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:38,459 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-07-23 13:57:38,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:57:38,459 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-23 13:57:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:38,459 INFO L225 Difference]: With dead ends: 252 [2018-07-23 13:57:38,459 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 13:57:38,460 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:57:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 13:57:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-23 13:57:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-23 13:57:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-07-23 13:57:38,596 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 166 [2018-07-23 13:57:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:38,596 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-07-23 13:57:38,596 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:57:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-07-23 13:57:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 13:57:38,597 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:38,597 INFO L357 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2018-07-23 13:57:38,597 INFO L414 AbstractCegarLoop]: === Iteration 243 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1716804755, now seen corresponding path program 240 times [2018-07-23 13:57:38,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:38,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:38,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:57:38,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:38,933 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:57:38,933 INFO L185 omatonBuilderFactory]: Interpolants [109825#(<= 4 Main_x), 109824#(<= 3 Main_x), 109827#(<= 6 Main_x), 109826#(<= 5 Main_x), 109829#(<= 8 Main_x), 109828#(<= 7 Main_x), 109831#(<= 10 Main_x), 109830#(<= 9 Main_x), 109833#(<= 12 Main_x), 109832#(<= 11 Main_x), 109835#(<= 14 Main_x), 109834#(<= 13 Main_x), 109837#(<= 16 Main_x), 109836#(<= 15 Main_x), 109839#(<= 18 Main_x), 109838#(<= 17 Main_x), 109841#(<= 20 Main_x), 109840#(<= 19 Main_x), 109843#(<= 22 Main_x), 109842#(<= 21 Main_x), 109845#(<= 24 Main_x), 109844#(<= 23 Main_x), 109847#(<= 26 Main_x), 109846#(<= 25 Main_x), 109849#(<= 28 Main_x), 109848#(<= 27 Main_x), 109851#(<= 30 Main_x), 109850#(<= 29 Main_x), 109853#(<= 32 Main_x), 109852#(<= 31 Main_x), 109855#(<= 34 Main_x), 109854#(<= 33 Main_x), 109857#(<= 36 Main_x), 109856#(<= 35 Main_x), 109859#(<= 38 Main_x), 109858#(<= 37 Main_x), 109861#(<= 40 Main_x), 109860#(<= 39 Main_x), 109863#(<= 42 Main_x), 109862#(<= 41 Main_x), 109865#(<= 44 Main_x), 109864#(<= 43 Main_x), 109867#(<= 46 Main_x), 109866#(<= 45 Main_x), 109869#(<= 48 Main_x), 109868#(<= 47 Main_x), 109871#(<= 50 Main_x), 109870#(<= 49 Main_x), 109873#(<= 52 Main_x), 109872#(<= 51 Main_x), 109875#(<= 54 Main_x), 109874#(<= 53 Main_x), 109877#(<= 56 Main_x), 109876#(<= 55 Main_x), 109879#(<= 58 Main_x), 109878#(<= 57 Main_x), 109881#(<= 60 Main_x), 109880#(<= 59 Main_x), 109883#(<= 62 Main_x), 109882#(<= 61 Main_x), 109885#(<= 64 Main_x), 109884#(<= 63 Main_x), 109887#(<= 66 Main_x), 109886#(<= 65 Main_x), 109889#(<= 68 Main_x), 109888#(<= 67 Main_x), 109891#(<= 70 Main_x), 109890#(<= 69 Main_x), 109893#(<= 72 Main_x), 109892#(<= 71 Main_x), 109895#(<= 74 Main_x), 109894#(<= 73 Main_x), 109897#(<= 76 Main_x), 109896#(<= 75 Main_x), 109899#(<= 78 Main_x), 109898#(<= 77 Main_x), 109901#(<= 80 Main_x), 109900#(<= 79 Main_x), 109902#(<= 81 Main_x), 109819#true, 109821#(<= 0 Main_x), 109820#false, 109823#(<= 2 Main_x), 109822#(<= 1 Main_x)] [2018-07-23 13:57:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3321 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:38,934 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:57:38,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:57:38,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:57:38,934 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-07-23 13:57:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:39,107 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-07-23 13:57:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:57:39,107 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-23 13:57:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:39,108 INFO L225 Difference]: With dead ends: 171 [2018-07-23 13:57:39,108 INFO L226 Difference]: Without dead ends: 168 [2018-07-23 13:57:39,108 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:57:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-23 13:57:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-23 13:57:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-23 13:57:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-07-23 13:57:39,242 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 166 [2018-07-23 13:57:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:39,242 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-07-23 13:57:39,242 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:57:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-07-23 13:57:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-23 13:57:39,242 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:39,243 INFO L357 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1] [2018-07-23 13:57:39,243 INFO L414 AbstractCegarLoop]: === Iteration 244 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1681401375, now seen corresponding path program 241 times [2018-07-23 13:57:39,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:39,650 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:39,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:57:39,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:39,651 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:57:39,651 INFO L185 omatonBuilderFactory]: Interpolants [110593#(and (<= 10 Main_y) (<= Main_y 10)), 110592#(and (<= Main_y 9) (<= 9 Main_y)), 110595#(and (<= 12 Main_y) (<= Main_y 12)), 110594#(and (<= 11 Main_y) (<= Main_y 11)), 110597#(and (<= 14 Main_y) (<= Main_y 14)), 110596#(and (<= 13 Main_y) (<= Main_y 13)), 110599#(and (<= 16 Main_y) (<= Main_y 16)), 110598#(and (<= Main_y 15) (<= 15 Main_y)), 110601#(and (<= Main_y 18) (<= 18 Main_y)), 110600#(and (<= Main_y 17) (<= 17 Main_y)), 110603#(and (<= 20 Main_y) (<= Main_y 20)), 110602#(and (<= Main_y 19) (<= 19 Main_y)), 110605#(and (<= Main_y 22) (<= 22 Main_y)), 110604#(and (<= 21 Main_y) (<= Main_y 21)), 110607#(and (<= Main_y 24) (<= 24 Main_y)), 110606#(and (<= 23 Main_y) (<= Main_y 23)), 110609#(and (<= Main_y 26) (<= 26 Main_y)), 110608#(and (<= 25 Main_y) (<= Main_y 25)), 110611#(and (<= 28 Main_y) (<= Main_y 28)), 110610#(and (<= 27 Main_y) (<= Main_y 27)), 110613#(and (<= 30 Main_y) (<= Main_y 30)), 110612#(and (<= 29 Main_y) (<= Main_y 29)), 110615#(and (<= 32 Main_y) (<= Main_y 32)), 110614#(and (<= Main_y 31) (<= 31 Main_y)), 110617#(and (<= Main_y 34) (<= 34 Main_y)), 110616#(and (<= 33 Main_y) (<= Main_y 33)), 110619#(and (<= 36 Main_y) (<= Main_y 36)), 110618#(and (<= 35 Main_y) (<= Main_y 35)), 110621#(and (<= Main_y 38) (<= 38 Main_y)), 110620#(and (<= Main_y 37) (<= 37 Main_y)), 110623#(and (<= 40 Main_y) (<= Main_y 40)), 110622#(and (<= 39 Main_y) (<= Main_y 39)), 110625#(and (<= 42 Main_y) (<= Main_y 42)), 110624#(and (<= Main_y 41) (<= 41 Main_y)), 110627#(and (<= 44 Main_y) (<= Main_y 44)), 110626#(and (<= 43 Main_y) (<= Main_y 43)), 110629#(and (<= 46 Main_y) (<= Main_y 46)), 110628#(and (<= Main_y 45) (<= 45 Main_y)), 110631#(and (<= 48 Main_y) (<= Main_y 48)), 110630#(and (<= 47 Main_y) (<= Main_y 47)), 110633#(and (<= 50 Main_y) (<= Main_y 50)), 110632#(and (<= 49 Main_y) (<= Main_y 49)), 110635#(and (<= 52 Main_y) (<= Main_y 52)), 110634#(and (<= 51 Main_y) (<= Main_y 51)), 110637#(and (<= 54 Main_y) (<= Main_y 54)), 110636#(and (<= 53 Main_y) (<= Main_y 53)), 110639#(and (<= Main_y 56) (<= 56 Main_y)), 110638#(and (<= 55 Main_y) (<= Main_y 55)), 110641#(and (<= Main_y 58) (<= 58 Main_y)), 110640#(and (<= Main_y 57) (<= 57 Main_y)), 110643#(and (<= Main_y 60) (<= 60 Main_y)), 110642#(and (<= Main_y 59) (<= 59 Main_y)), 110645#(and (<= 62 Main_y) (<= Main_y 62)), 110644#(and (<= Main_y 61) (<= 61 Main_y)), 110647#(and (<= 64 Main_y) (<= Main_y 64)), 110646#(and (<= 63 Main_y) (<= Main_y 63)), 110649#(and (<= Main_y 66) (<= 66 Main_y)), 110648#(and (<= Main_y 65) (<= 65 Main_y)), 110651#(and (<= 68 Main_y) (<= Main_y 68)), 110650#(and (<= 67 Main_y) (<= Main_y 67)), 110653#(and (<= 70 Main_y) (<= Main_y 70)), 110652#(and (<= Main_y 69) (<= 69 Main_y)), 110655#(and (<= 72 Main_y) (<= Main_y 72)), 110654#(and (<= Main_y 71) (<= 71 Main_y)), 110657#(and (<= 74 Main_y) (<= Main_y 74)), 110656#(and (<= 73 Main_y) (<= Main_y 73)), 110659#(and (<= Main_y 76) (<= 76 Main_y)), 110658#(and (<= Main_y 75) (<= 75 Main_y)), 110661#(and (<= Main_y 78) (<= 78 Main_y)), 110660#(and (<= Main_y 77) (<= 77 Main_y)), 110663#(and (<= Main_y 80) (<= 80 Main_y)), 110662#(and (<= 79 Main_y) (<= Main_y 79)), 110664#(and (<= 81 Main_y) (<= Main_y 81)), 110581#true, 110583#(and (<= 0 Main_y) (<= Main_y 0)), 110582#false, 110585#(and (<= Main_y 2) (<= 2 Main_y)), 110584#(and (<= 1 Main_y) (<= Main_y 1)), 110587#(and (<= Main_y 4) (<= 4 Main_y)), 110586#(and (<= Main_y 3) (<= 3 Main_y)), 110589#(and (<= Main_y 6) (<= 6 Main_y)), 110588#(and (<= Main_y 5) (<= 5 Main_y)), 110591#(and (<= 8 Main_y) (<= Main_y 8)), 110590#(and (<= 7 Main_y) (<= Main_y 7))] [2018-07-23 13:57:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:39,651 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:57:39,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:57:39,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:57:39,652 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 84 states. [2018-07-23 13:57:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:40,619 INFO L93 Difference]: Finished difference Result 254 states and 256 transitions. [2018-07-23 13:57:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:57:40,619 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 167 [2018-07-23 13:57:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:40,620 INFO L225 Difference]: With dead ends: 254 [2018-07-23 13:57:40,620 INFO L226 Difference]: Without dead ends: 251 [2018-07-23 13:57:40,620 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:57:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-23 13:57:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 170. [2018-07-23 13:57:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-23 13:57:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-07-23 13:57:40,754 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 167 [2018-07-23 13:57:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:40,754 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-07-23 13:57:40,754 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:57:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-07-23 13:57:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 13:57:40,754 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:40,755 INFO L357 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2018-07-23 13:57:40,755 INFO L414 AbstractCegarLoop]: === Iteration 245 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash -583896595, now seen corresponding path program 242 times [2018-07-23 13:57:40,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3403 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:41,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:41,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:57:41,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:41,014 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:57:41,014 INFO L185 omatonBuilderFactory]: Interpolants [111513#true, 111515#(<= Main_x 0), 111514#false, 111517#(<= Main_x 2), 111516#(<= Main_x 1), 111519#(<= Main_x 4), 111518#(<= Main_x 3), 111521#(<= Main_x 6), 111520#(<= Main_x 5), 111523#(<= Main_x 8), 111522#(<= Main_x 7), 111525#(<= Main_x 10), 111524#(<= Main_x 9), 111527#(<= Main_x 12), 111526#(<= Main_x 11), 111529#(<= Main_x 14), 111528#(<= Main_x 13), 111531#(<= Main_x 16), 111530#(<= Main_x 15), 111533#(<= Main_x 18), 111532#(<= Main_x 17), 111535#(<= Main_x 20), 111534#(<= Main_x 19), 111537#(<= Main_x 22), 111536#(<= Main_x 21), 111539#(<= Main_x 24), 111538#(<= Main_x 23), 111541#(<= Main_x 26), 111540#(<= Main_x 25), 111543#(<= Main_x 28), 111542#(<= Main_x 27), 111545#(<= Main_x 30), 111544#(<= Main_x 29), 111547#(<= Main_x 32), 111546#(<= Main_x 31), 111549#(<= Main_x 34), 111548#(<= Main_x 33), 111551#(<= Main_x 36), 111550#(<= Main_x 35), 111553#(<= Main_x 38), 111552#(<= Main_x 37), 111555#(<= Main_x 40), 111554#(<= Main_x 39), 111557#(<= Main_x 42), 111556#(<= Main_x 41), 111559#(<= Main_x 44), 111558#(<= Main_x 43), 111561#(<= Main_x 46), 111560#(<= Main_x 45), 111563#(<= Main_x 48), 111562#(<= Main_x 47), 111565#(<= Main_x 50), 111564#(<= Main_x 49), 111567#(<= Main_x 52), 111566#(<= Main_x 51), 111569#(<= Main_x 54), 111568#(<= Main_x 53), 111571#(<= Main_x 56), 111570#(<= Main_x 55), 111573#(<= Main_x 58), 111572#(<= Main_x 57), 111575#(<= Main_x 60), 111574#(<= Main_x 59), 111577#(<= Main_x 62), 111576#(<= Main_x 61), 111579#(<= Main_x 64), 111578#(<= Main_x 63), 111581#(<= Main_x 66), 111580#(<= Main_x 65), 111583#(<= Main_x 68), 111582#(<= Main_x 67), 111585#(<= Main_x 70), 111584#(<= Main_x 69), 111587#(<= Main_x 72), 111586#(<= Main_x 71), 111589#(<= Main_x 74), 111588#(<= Main_x 73), 111591#(<= Main_x 76), 111590#(<= Main_x 75), 111593#(<= Main_x 78), 111592#(<= Main_x 77), 111595#(<= Main_x 80), 111594#(<= Main_x 79), 111597#(<= (+ Main_x 1) 0), 111596#(<= Main_x 81)] [2018-07-23 13:57:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3403 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:41,014 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:57:41,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:57:41,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:57:41,015 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 85 states. [2018-07-23 13:57:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:41,422 INFO L93 Difference]: Finished difference Result 255 states and 257 transitions. [2018-07-23 13:57:41,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:57:41,423 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-23 13:57:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:41,423 INFO L225 Difference]: With dead ends: 255 [2018-07-23 13:57:41,423 INFO L226 Difference]: Without dead ends: 169 [2018-07-23 13:57:41,424 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:57:41,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-23 13:57:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-23 13:57:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 13:57:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-07-23 13:57:41,549 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 168 [2018-07-23 13:57:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:41,549 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-07-23 13:57:41,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:57:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-07-23 13:57:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 13:57:41,550 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:41,550 INFO L357 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2018-07-23 13:57:41,550 INFO L414 AbstractCegarLoop]: === Iteration 246 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1959423737, now seen corresponding path program 243 times [2018-07-23 13:57:41,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3403 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:41,806 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:41,806 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:57:41,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:41,807 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:57:41,807 INFO L185 omatonBuilderFactory]: Interpolants [112513#(<= 65 Main_x), 112512#(<= 64 Main_x), 112515#(<= 67 Main_x), 112514#(<= 66 Main_x), 112517#(<= 69 Main_x), 112516#(<= 68 Main_x), 112519#(<= 71 Main_x), 112518#(<= 70 Main_x), 112521#(<= 73 Main_x), 112520#(<= 72 Main_x), 112523#(<= 75 Main_x), 112522#(<= 74 Main_x), 112525#(<= 77 Main_x), 112524#(<= 76 Main_x), 112527#(<= 79 Main_x), 112526#(<= 78 Main_x), 112529#(<= 81 Main_x), 112528#(<= 80 Main_x), 112530#(<= 82 Main_x), 112447#false, 112446#true, 112449#(<= 1 Main_x), 112448#(<= 0 Main_x), 112451#(<= 3 Main_x), 112450#(<= 2 Main_x), 112453#(<= 5 Main_x), 112452#(<= 4 Main_x), 112455#(<= 7 Main_x), 112454#(<= 6 Main_x), 112457#(<= 9 Main_x), 112456#(<= 8 Main_x), 112459#(<= 11 Main_x), 112458#(<= 10 Main_x), 112461#(<= 13 Main_x), 112460#(<= 12 Main_x), 112463#(<= 15 Main_x), 112462#(<= 14 Main_x), 112465#(<= 17 Main_x), 112464#(<= 16 Main_x), 112467#(<= 19 Main_x), 112466#(<= 18 Main_x), 112469#(<= 21 Main_x), 112468#(<= 20 Main_x), 112471#(<= 23 Main_x), 112470#(<= 22 Main_x), 112473#(<= 25 Main_x), 112472#(<= 24 Main_x), 112475#(<= 27 Main_x), 112474#(<= 26 Main_x), 112477#(<= 29 Main_x), 112476#(<= 28 Main_x), 112479#(<= 31 Main_x), 112478#(<= 30 Main_x), 112481#(<= 33 Main_x), 112480#(<= 32 Main_x), 112483#(<= 35 Main_x), 112482#(<= 34 Main_x), 112485#(<= 37 Main_x), 112484#(<= 36 Main_x), 112487#(<= 39 Main_x), 112486#(<= 38 Main_x), 112489#(<= 41 Main_x), 112488#(<= 40 Main_x), 112491#(<= 43 Main_x), 112490#(<= 42 Main_x), 112493#(<= 45 Main_x), 112492#(<= 44 Main_x), 112495#(<= 47 Main_x), 112494#(<= 46 Main_x), 112497#(<= 49 Main_x), 112496#(<= 48 Main_x), 112499#(<= 51 Main_x), 112498#(<= 50 Main_x), 112501#(<= 53 Main_x), 112500#(<= 52 Main_x), 112503#(<= 55 Main_x), 112502#(<= 54 Main_x), 112505#(<= 57 Main_x), 112504#(<= 56 Main_x), 112507#(<= 59 Main_x), 112506#(<= 58 Main_x), 112509#(<= 61 Main_x), 112508#(<= 60 Main_x), 112511#(<= 63 Main_x), 112510#(<= 62 Main_x)] [2018-07-23 13:57:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3403 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:41,807 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:57:41,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:57:41,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:57:41,808 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-07-23 13:57:41,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:41,982 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-07-23 13:57:41,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:57:41,982 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-23 13:57:41,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:41,983 INFO L225 Difference]: With dead ends: 173 [2018-07-23 13:57:41,983 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 13:57:41,983 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:57:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 13:57:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-23 13:57:42,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-23 13:57:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-07-23 13:57:42,106 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 168 [2018-07-23 13:57:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:42,106 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-07-23 13:57:42,106 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:57:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-07-23 13:57:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-23 13:57:42,107 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:42,107 INFO L357 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1] [2018-07-23 13:57:42,107 INFO L414 AbstractCegarLoop]: === Iteration 247 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:42,107 INFO L82 PathProgramCache]: Analyzing trace with hash -612655225, now seen corresponding path program 244 times [2018-07-23 13:57:42,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:42,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:42,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:57:42,525 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:42,525 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:57:42,525 INFO L185 omatonBuilderFactory]: Interpolants [113281#(and (<= 62 Main_y) (<= Main_y 62)), 113280#(and (<= Main_y 61) (<= 61 Main_y)), 113283#(and (<= 64 Main_y) (<= Main_y 64)), 113282#(and (<= 63 Main_y) (<= Main_y 63)), 113285#(and (<= Main_y 66) (<= 66 Main_y)), 113284#(and (<= Main_y 65) (<= 65 Main_y)), 113287#(and (<= 68 Main_y) (<= Main_y 68)), 113286#(and (<= 67 Main_y) (<= Main_y 67)), 113289#(and (<= 70 Main_y) (<= Main_y 70)), 113288#(and (<= Main_y 69) (<= 69 Main_y)), 113291#(and (<= 72 Main_y) (<= Main_y 72)), 113290#(and (<= Main_y 71) (<= 71 Main_y)), 113293#(and (<= 74 Main_y) (<= Main_y 74)), 113292#(and (<= 73 Main_y) (<= Main_y 73)), 113295#(and (<= Main_y 76) (<= 76 Main_y)), 113294#(and (<= Main_y 75) (<= 75 Main_y)), 113297#(and (<= Main_y 78) (<= 78 Main_y)), 113296#(and (<= Main_y 77) (<= 77 Main_y)), 113299#(and (<= Main_y 80) (<= 80 Main_y)), 113298#(and (<= 79 Main_y) (<= Main_y 79)), 113301#(and (<= Main_y 82) (<= 82 Main_y)), 113300#(and (<= 81 Main_y) (<= Main_y 81)), 113217#true, 113219#(and (<= 0 Main_y) (<= Main_y 0)), 113218#false, 113221#(and (<= Main_y 2) (<= 2 Main_y)), 113220#(and (<= 1 Main_y) (<= Main_y 1)), 113223#(and (<= Main_y 4) (<= 4 Main_y)), 113222#(and (<= Main_y 3) (<= 3 Main_y)), 113225#(and (<= Main_y 6) (<= 6 Main_y)), 113224#(and (<= Main_y 5) (<= 5 Main_y)), 113227#(and (<= 8 Main_y) (<= Main_y 8)), 113226#(and (<= 7 Main_y) (<= Main_y 7)), 113229#(and (<= 10 Main_y) (<= Main_y 10)), 113228#(and (<= Main_y 9) (<= 9 Main_y)), 113231#(and (<= 12 Main_y) (<= Main_y 12)), 113230#(and (<= 11 Main_y) (<= Main_y 11)), 113233#(and (<= 14 Main_y) (<= Main_y 14)), 113232#(and (<= 13 Main_y) (<= Main_y 13)), 113235#(and (<= 16 Main_y) (<= Main_y 16)), 113234#(and (<= Main_y 15) (<= 15 Main_y)), 113237#(and (<= Main_y 18) (<= 18 Main_y)), 113236#(and (<= Main_y 17) (<= 17 Main_y)), 113239#(and (<= 20 Main_y) (<= Main_y 20)), 113238#(and (<= Main_y 19) (<= 19 Main_y)), 113241#(and (<= Main_y 22) (<= 22 Main_y)), 113240#(and (<= 21 Main_y) (<= Main_y 21)), 113243#(and (<= Main_y 24) (<= 24 Main_y)), 113242#(and (<= 23 Main_y) (<= Main_y 23)), 113245#(and (<= Main_y 26) (<= 26 Main_y)), 113244#(and (<= 25 Main_y) (<= Main_y 25)), 113247#(and (<= 28 Main_y) (<= Main_y 28)), 113246#(and (<= 27 Main_y) (<= Main_y 27)), 113249#(and (<= 30 Main_y) (<= Main_y 30)), 113248#(and (<= 29 Main_y) (<= Main_y 29)), 113251#(and (<= 32 Main_y) (<= Main_y 32)), 113250#(and (<= Main_y 31) (<= 31 Main_y)), 113253#(and (<= Main_y 34) (<= 34 Main_y)), 113252#(and (<= 33 Main_y) (<= Main_y 33)), 113255#(and (<= 36 Main_y) (<= Main_y 36)), 113254#(and (<= 35 Main_y) (<= Main_y 35)), 113257#(and (<= Main_y 38) (<= 38 Main_y)), 113256#(and (<= Main_y 37) (<= 37 Main_y)), 113259#(and (<= 40 Main_y) (<= Main_y 40)), 113258#(and (<= 39 Main_y) (<= Main_y 39)), 113261#(and (<= 42 Main_y) (<= Main_y 42)), 113260#(and (<= Main_y 41) (<= 41 Main_y)), 113263#(and (<= 44 Main_y) (<= Main_y 44)), 113262#(and (<= 43 Main_y) (<= Main_y 43)), 113265#(and (<= 46 Main_y) (<= Main_y 46)), 113264#(and (<= Main_y 45) (<= 45 Main_y)), 113267#(and (<= 48 Main_y) (<= Main_y 48)), 113266#(and (<= 47 Main_y) (<= Main_y 47)), 113269#(and (<= 50 Main_y) (<= Main_y 50)), 113268#(and (<= 49 Main_y) (<= Main_y 49)), 113271#(and (<= 52 Main_y) (<= Main_y 52)), 113270#(and (<= 51 Main_y) (<= Main_y 51)), 113273#(and (<= 54 Main_y) (<= Main_y 54)), 113272#(and (<= 53 Main_y) (<= Main_y 53)), 113275#(and (<= Main_y 56) (<= 56 Main_y)), 113274#(and (<= 55 Main_y) (<= Main_y 55)), 113277#(and (<= Main_y 58) (<= 58 Main_y)), 113276#(and (<= Main_y 57) (<= 57 Main_y)), 113279#(and (<= Main_y 60) (<= 60 Main_y)), 113278#(and (<= Main_y 59) (<= 59 Main_y))] [2018-07-23 13:57:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:42,526 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:57:42,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:57:42,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:57:42,526 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 85 states. [2018-07-23 13:57:43,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:43,448 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-07-23 13:57:43,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:57:43,449 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 169 [2018-07-23 13:57:43,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:43,449 INFO L225 Difference]: With dead ends: 257 [2018-07-23 13:57:43,449 INFO L226 Difference]: Without dead ends: 254 [2018-07-23 13:57:43,450 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:57:43,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-23 13:57:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 172. [2018-07-23 13:57:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-23 13:57:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-07-23 13:57:43,578 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 169 [2018-07-23 13:57:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:43,578 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-07-23 13:57:43,578 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:57:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-07-23 13:57:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-23 13:57:43,579 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:43,579 INFO L357 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2018-07-23 13:57:43,579 INFO L414 AbstractCegarLoop]: === Iteration 248 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1812504313, now seen corresponding path program 245 times [2018-07-23 13:57:43,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:43,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:43,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:57:43,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:43,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:57:43,825 INFO L185 omatonBuilderFactory]: Interpolants [114177#(<= Main_x 15), 114176#(<= Main_x 14), 114179#(<= Main_x 17), 114178#(<= Main_x 16), 114181#(<= Main_x 19), 114180#(<= Main_x 18), 114183#(<= Main_x 21), 114182#(<= Main_x 20), 114185#(<= Main_x 23), 114184#(<= Main_x 22), 114187#(<= Main_x 25), 114186#(<= Main_x 24), 114189#(<= Main_x 27), 114188#(<= Main_x 26), 114191#(<= Main_x 29), 114190#(<= Main_x 28), 114193#(<= Main_x 31), 114192#(<= Main_x 30), 114195#(<= Main_x 33), 114194#(<= Main_x 32), 114197#(<= Main_x 35), 114196#(<= Main_x 34), 114199#(<= Main_x 37), 114198#(<= Main_x 36), 114201#(<= Main_x 39), 114200#(<= Main_x 38), 114203#(<= Main_x 41), 114202#(<= Main_x 40), 114205#(<= Main_x 43), 114204#(<= Main_x 42), 114207#(<= Main_x 45), 114206#(<= Main_x 44), 114209#(<= Main_x 47), 114208#(<= Main_x 46), 114211#(<= Main_x 49), 114210#(<= Main_x 48), 114213#(<= Main_x 51), 114212#(<= Main_x 50), 114215#(<= Main_x 53), 114214#(<= Main_x 52), 114217#(<= Main_x 55), 114216#(<= Main_x 54), 114219#(<= Main_x 57), 114218#(<= Main_x 56), 114221#(<= Main_x 59), 114220#(<= Main_x 58), 114223#(<= Main_x 61), 114222#(<= Main_x 60), 114225#(<= Main_x 63), 114224#(<= Main_x 62), 114227#(<= Main_x 65), 114226#(<= Main_x 64), 114229#(<= Main_x 67), 114228#(<= Main_x 66), 114231#(<= Main_x 69), 114230#(<= Main_x 68), 114233#(<= Main_x 71), 114232#(<= Main_x 70), 114235#(<= Main_x 73), 114234#(<= Main_x 72), 114237#(<= Main_x 75), 114236#(<= Main_x 74), 114239#(<= Main_x 77), 114238#(<= Main_x 76), 114241#(<= Main_x 79), 114240#(<= Main_x 78), 114243#(<= Main_x 81), 114242#(<= Main_x 80), 114245#(<= (+ Main_x 1) 0), 114244#(<= Main_x 82), 114161#false, 114160#true, 114163#(<= Main_x 1), 114162#(<= Main_x 0), 114165#(<= Main_x 3), 114164#(<= Main_x 2), 114167#(<= Main_x 5), 114166#(<= Main_x 4), 114169#(<= Main_x 7), 114168#(<= Main_x 6), 114171#(<= Main_x 9), 114170#(<= Main_x 8), 114173#(<= Main_x 11), 114172#(<= Main_x 10), 114175#(<= Main_x 13), 114174#(<= Main_x 12)] [2018-07-23 13:57:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:43,826 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:57:43,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:57:43,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:57:43,827 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 86 states. [2018-07-23 13:57:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:44,187 INFO L93 Difference]: Finished difference Result 258 states and 260 transitions. [2018-07-23 13:57:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:57:44,187 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-23 13:57:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:44,187 INFO L225 Difference]: With dead ends: 258 [2018-07-23 13:57:44,188 INFO L226 Difference]: Without dead ends: 171 [2018-07-23 13:57:44,188 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:57:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-23 13:57:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-23 13:57:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-23 13:57:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-07-23 13:57:44,316 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 170 [2018-07-23 13:57:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:44,316 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-07-23 13:57:44,316 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:57:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-07-23 13:57:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-23 13:57:44,317 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:44,317 INFO L357 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2018-07-23 13:57:44,317 INFO L414 AbstractCegarLoop]: === Iteration 249 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1504172755, now seen corresponding path program 246 times [2018-07-23 13:57:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:44,594 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:44,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:57:44,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:44,594 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:57:44,594 INFO L185 omatonBuilderFactory]: Interpolants [115105#false, 115104#true, 115107#(<= 1 Main_x), 115106#(<= 0 Main_x), 115109#(<= 3 Main_x), 115108#(<= 2 Main_x), 115111#(<= 5 Main_x), 115110#(<= 4 Main_x), 115113#(<= 7 Main_x), 115112#(<= 6 Main_x), 115115#(<= 9 Main_x), 115114#(<= 8 Main_x), 115117#(<= 11 Main_x), 115116#(<= 10 Main_x), 115119#(<= 13 Main_x), 115118#(<= 12 Main_x), 115121#(<= 15 Main_x), 115120#(<= 14 Main_x), 115123#(<= 17 Main_x), 115122#(<= 16 Main_x), 115125#(<= 19 Main_x), 115124#(<= 18 Main_x), 115127#(<= 21 Main_x), 115126#(<= 20 Main_x), 115129#(<= 23 Main_x), 115128#(<= 22 Main_x), 115131#(<= 25 Main_x), 115130#(<= 24 Main_x), 115133#(<= 27 Main_x), 115132#(<= 26 Main_x), 115135#(<= 29 Main_x), 115134#(<= 28 Main_x), 115137#(<= 31 Main_x), 115136#(<= 30 Main_x), 115139#(<= 33 Main_x), 115138#(<= 32 Main_x), 115141#(<= 35 Main_x), 115140#(<= 34 Main_x), 115143#(<= 37 Main_x), 115142#(<= 36 Main_x), 115145#(<= 39 Main_x), 115144#(<= 38 Main_x), 115147#(<= 41 Main_x), 115146#(<= 40 Main_x), 115149#(<= 43 Main_x), 115148#(<= 42 Main_x), 115151#(<= 45 Main_x), 115150#(<= 44 Main_x), 115153#(<= 47 Main_x), 115152#(<= 46 Main_x), 115155#(<= 49 Main_x), 115154#(<= 48 Main_x), 115157#(<= 51 Main_x), 115156#(<= 50 Main_x), 115159#(<= 53 Main_x), 115158#(<= 52 Main_x), 115161#(<= 55 Main_x), 115160#(<= 54 Main_x), 115163#(<= 57 Main_x), 115162#(<= 56 Main_x), 115165#(<= 59 Main_x), 115164#(<= 58 Main_x), 115167#(<= 61 Main_x), 115166#(<= 60 Main_x), 115169#(<= 63 Main_x), 115168#(<= 62 Main_x), 115171#(<= 65 Main_x), 115170#(<= 64 Main_x), 115173#(<= 67 Main_x), 115172#(<= 66 Main_x), 115175#(<= 69 Main_x), 115174#(<= 68 Main_x), 115177#(<= 71 Main_x), 115176#(<= 70 Main_x), 115179#(<= 73 Main_x), 115178#(<= 72 Main_x), 115181#(<= 75 Main_x), 115180#(<= 74 Main_x), 115183#(<= 77 Main_x), 115182#(<= 76 Main_x), 115185#(<= 79 Main_x), 115184#(<= 78 Main_x), 115187#(<= 81 Main_x), 115186#(<= 80 Main_x), 115189#(<= 83 Main_x), 115188#(<= 82 Main_x)] [2018-07-23 13:57:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3486 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:44,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:57:44,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:57:44,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:57:44,595 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-07-23 13:57:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:44,755 INFO L93 Difference]: Finished difference Result 175 states and 176 transitions. [2018-07-23 13:57:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:57:44,755 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-23 13:57:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:44,756 INFO L225 Difference]: With dead ends: 175 [2018-07-23 13:57:44,756 INFO L226 Difference]: Without dead ends: 172 [2018-07-23 13:57:44,756 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:57:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-23 13:57:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-23 13:57:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-23 13:57:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-07-23 13:57:44,881 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-07-23 13:57:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:44,881 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-07-23 13:57:44,881 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:57:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-07-23 13:57:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-23 13:57:44,882 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:44,882 INFO L357 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1] [2018-07-23 13:57:44,882 INFO L414 AbstractCegarLoop]: === Iteration 250 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 615223329, now seen corresponding path program 247 times [2018-07-23 13:57:44,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:45,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:45,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:57:45,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:45,313 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:57:45,313 INFO L185 omatonBuilderFactory]: Interpolants [115969#(and (<= Main_y 83) (<= 83 Main_y)), 115968#(and (<= Main_y 82) (<= 82 Main_y)), 115885#false, 115884#true, 115887#(and (<= 1 Main_y) (<= Main_y 1)), 115886#(and (<= 0 Main_y) (<= Main_y 0)), 115889#(and (<= Main_y 3) (<= 3 Main_y)), 115888#(and (<= Main_y 2) (<= 2 Main_y)), 115891#(and (<= Main_y 5) (<= 5 Main_y)), 115890#(and (<= Main_y 4) (<= 4 Main_y)), 115893#(and (<= 7 Main_y) (<= Main_y 7)), 115892#(and (<= Main_y 6) (<= 6 Main_y)), 115895#(and (<= Main_y 9) (<= 9 Main_y)), 115894#(and (<= 8 Main_y) (<= Main_y 8)), 115897#(and (<= 11 Main_y) (<= Main_y 11)), 115896#(and (<= 10 Main_y) (<= Main_y 10)), 115899#(and (<= 13 Main_y) (<= Main_y 13)), 115898#(and (<= 12 Main_y) (<= Main_y 12)), 115901#(and (<= Main_y 15) (<= 15 Main_y)), 115900#(and (<= 14 Main_y) (<= Main_y 14)), 115903#(and (<= Main_y 17) (<= 17 Main_y)), 115902#(and (<= 16 Main_y) (<= Main_y 16)), 115905#(and (<= Main_y 19) (<= 19 Main_y)), 115904#(and (<= Main_y 18) (<= 18 Main_y)), 115907#(and (<= 21 Main_y) (<= Main_y 21)), 115906#(and (<= 20 Main_y) (<= Main_y 20)), 115909#(and (<= 23 Main_y) (<= Main_y 23)), 115908#(and (<= Main_y 22) (<= 22 Main_y)), 115911#(and (<= 25 Main_y) (<= Main_y 25)), 115910#(and (<= Main_y 24) (<= 24 Main_y)), 115913#(and (<= 27 Main_y) (<= Main_y 27)), 115912#(and (<= Main_y 26) (<= 26 Main_y)), 115915#(and (<= 29 Main_y) (<= Main_y 29)), 115914#(and (<= 28 Main_y) (<= Main_y 28)), 115917#(and (<= Main_y 31) (<= 31 Main_y)), 115916#(and (<= 30 Main_y) (<= Main_y 30)), 115919#(and (<= 33 Main_y) (<= Main_y 33)), 115918#(and (<= 32 Main_y) (<= Main_y 32)), 115921#(and (<= 35 Main_y) (<= Main_y 35)), 115920#(and (<= Main_y 34) (<= 34 Main_y)), 115923#(and (<= Main_y 37) (<= 37 Main_y)), 115922#(and (<= 36 Main_y) (<= Main_y 36)), 115925#(and (<= 39 Main_y) (<= Main_y 39)), 115924#(and (<= Main_y 38) (<= 38 Main_y)), 115927#(and (<= Main_y 41) (<= 41 Main_y)), 115926#(and (<= 40 Main_y) (<= Main_y 40)), 115929#(and (<= 43 Main_y) (<= Main_y 43)), 115928#(and (<= 42 Main_y) (<= Main_y 42)), 115931#(and (<= Main_y 45) (<= 45 Main_y)), 115930#(and (<= 44 Main_y) (<= Main_y 44)), 115933#(and (<= 47 Main_y) (<= Main_y 47)), 115932#(and (<= 46 Main_y) (<= Main_y 46)), 115935#(and (<= 49 Main_y) (<= Main_y 49)), 115934#(and (<= 48 Main_y) (<= Main_y 48)), 115937#(and (<= 51 Main_y) (<= Main_y 51)), 115936#(and (<= 50 Main_y) (<= Main_y 50)), 115939#(and (<= 53 Main_y) (<= Main_y 53)), 115938#(and (<= 52 Main_y) (<= Main_y 52)), 115941#(and (<= 55 Main_y) (<= Main_y 55)), 115940#(and (<= 54 Main_y) (<= Main_y 54)), 115943#(and (<= Main_y 57) (<= 57 Main_y)), 115942#(and (<= Main_y 56) (<= 56 Main_y)), 115945#(and (<= Main_y 59) (<= 59 Main_y)), 115944#(and (<= Main_y 58) (<= 58 Main_y)), 115947#(and (<= Main_y 61) (<= 61 Main_y)), 115946#(and (<= Main_y 60) (<= 60 Main_y)), 115949#(and (<= 63 Main_y) (<= Main_y 63)), 115948#(and (<= 62 Main_y) (<= Main_y 62)), 115951#(and (<= Main_y 65) (<= 65 Main_y)), 115950#(and (<= 64 Main_y) (<= Main_y 64)), 115953#(and (<= 67 Main_y) (<= Main_y 67)), 115952#(and (<= Main_y 66) (<= 66 Main_y)), 115955#(and (<= Main_y 69) (<= 69 Main_y)), 115954#(and (<= 68 Main_y) (<= Main_y 68)), 115957#(and (<= Main_y 71) (<= 71 Main_y)), 115956#(and (<= 70 Main_y) (<= Main_y 70)), 115959#(and (<= 73 Main_y) (<= Main_y 73)), 115958#(and (<= 72 Main_y) (<= Main_y 72)), 115961#(and (<= Main_y 75) (<= 75 Main_y)), 115960#(and (<= 74 Main_y) (<= Main_y 74)), 115963#(and (<= Main_y 77) (<= 77 Main_y)), 115962#(and (<= Main_y 76) (<= 76 Main_y)), 115965#(and (<= 79 Main_y) (<= Main_y 79)), 115964#(and (<= Main_y 78) (<= 78 Main_y)), 115967#(and (<= 81 Main_y) (<= Main_y 81)), 115966#(and (<= Main_y 80) (<= 80 Main_y))] [2018-07-23 13:57:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:45,313 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:57:45,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:57:45,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:57:45,314 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 86 states. [2018-07-23 13:57:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:46,276 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2018-07-23 13:57:46,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:57:46,276 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 171 [2018-07-23 13:57:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:46,277 INFO L225 Difference]: With dead ends: 260 [2018-07-23 13:57:46,277 INFO L226 Difference]: Without dead ends: 257 [2018-07-23 13:57:46,278 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:57:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-23 13:57:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 174. [2018-07-23 13:57:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-23 13:57:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2018-07-23 13:57:46,536 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 171 [2018-07-23 13:57:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:46,537 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2018-07-23 13:57:46,537 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:57:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2018-07-23 13:57:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 13:57:46,537 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:46,537 INFO L357 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2018-07-23 13:57:46,538 INFO L414 AbstractCegarLoop]: === Iteration 251 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1891992493, now seen corresponding path program 248 times [2018-07-23 13:57:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3570 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:46,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:46,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:57:46,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:46,796 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:57:46,796 INFO L185 omatonBuilderFactory]: Interpolants [116865#(<= Main_x 25), 116864#(<= Main_x 24), 116867#(<= Main_x 27), 116866#(<= Main_x 26), 116869#(<= Main_x 29), 116868#(<= Main_x 28), 116871#(<= Main_x 31), 116870#(<= Main_x 30), 116873#(<= Main_x 33), 116872#(<= Main_x 32), 116875#(<= Main_x 35), 116874#(<= Main_x 34), 116877#(<= Main_x 37), 116876#(<= Main_x 36), 116879#(<= Main_x 39), 116878#(<= Main_x 38), 116881#(<= Main_x 41), 116880#(<= Main_x 40), 116883#(<= Main_x 43), 116882#(<= Main_x 42), 116885#(<= Main_x 45), 116884#(<= Main_x 44), 116887#(<= Main_x 47), 116886#(<= Main_x 46), 116889#(<= Main_x 49), 116888#(<= Main_x 48), 116891#(<= Main_x 51), 116890#(<= Main_x 50), 116893#(<= Main_x 53), 116892#(<= Main_x 52), 116895#(<= Main_x 55), 116894#(<= Main_x 54), 116897#(<= Main_x 57), 116896#(<= Main_x 56), 116899#(<= Main_x 59), 116898#(<= Main_x 58), 116901#(<= Main_x 61), 116900#(<= Main_x 60), 116903#(<= Main_x 63), 116902#(<= Main_x 62), 116905#(<= Main_x 65), 116904#(<= Main_x 64), 116907#(<= Main_x 67), 116906#(<= Main_x 66), 116909#(<= Main_x 69), 116908#(<= Main_x 68), 116911#(<= Main_x 71), 116910#(<= Main_x 70), 116913#(<= Main_x 73), 116912#(<= Main_x 72), 116915#(<= Main_x 75), 116914#(<= Main_x 74), 116917#(<= Main_x 77), 116916#(<= Main_x 76), 116919#(<= Main_x 79), 116918#(<= Main_x 78), 116921#(<= Main_x 81), 116920#(<= Main_x 80), 116923#(<= Main_x 83), 116922#(<= Main_x 82), 116924#(<= (+ Main_x 1) 0), 116839#false, 116838#true, 116841#(<= Main_x 1), 116840#(<= Main_x 0), 116843#(<= Main_x 3), 116842#(<= Main_x 2), 116845#(<= Main_x 5), 116844#(<= Main_x 4), 116847#(<= Main_x 7), 116846#(<= Main_x 6), 116849#(<= Main_x 9), 116848#(<= Main_x 8), 116851#(<= Main_x 11), 116850#(<= Main_x 10), 116853#(<= Main_x 13), 116852#(<= Main_x 12), 116855#(<= Main_x 15), 116854#(<= Main_x 14), 116857#(<= Main_x 17), 116856#(<= Main_x 16), 116859#(<= Main_x 19), 116858#(<= Main_x 18), 116861#(<= Main_x 21), 116860#(<= Main_x 20), 116863#(<= Main_x 23), 116862#(<= Main_x 22)] [2018-07-23 13:57:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3570 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:46,797 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:57:46,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:57:46,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:57:46,798 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 87 states. [2018-07-23 13:57:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:47,156 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2018-07-23 13:57:47,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:57:47,157 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-23 13:57:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:47,157 INFO L225 Difference]: With dead ends: 261 [2018-07-23 13:57:47,157 INFO L226 Difference]: Without dead ends: 173 [2018-07-23 13:57:47,158 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:57:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-23 13:57:47,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-23 13:57:47,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 13:57:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-07-23 13:57:47,284 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 172 [2018-07-23 13:57:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:47,285 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-07-23 13:57:47,285 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:57:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-07-23 13:57:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 13:57:47,285 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:47,285 INFO L357 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2018-07-23 13:57:47,285 INFO L414 AbstractCegarLoop]: === Iteration 252 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1434631097, now seen corresponding path program 249 times [2018-07-23 13:57:47,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3570 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:47,547 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:47,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:57:47,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:47,548 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:57:47,548 INFO L185 omatonBuilderFactory]: Interpolants [117793#true, 117795#(<= 0 Main_x), 117794#false, 117797#(<= 2 Main_x), 117796#(<= 1 Main_x), 117799#(<= 4 Main_x), 117798#(<= 3 Main_x), 117801#(<= 6 Main_x), 117800#(<= 5 Main_x), 117803#(<= 8 Main_x), 117802#(<= 7 Main_x), 117805#(<= 10 Main_x), 117804#(<= 9 Main_x), 117807#(<= 12 Main_x), 117806#(<= 11 Main_x), 117809#(<= 14 Main_x), 117808#(<= 13 Main_x), 117811#(<= 16 Main_x), 117810#(<= 15 Main_x), 117813#(<= 18 Main_x), 117812#(<= 17 Main_x), 117815#(<= 20 Main_x), 117814#(<= 19 Main_x), 117817#(<= 22 Main_x), 117816#(<= 21 Main_x), 117819#(<= 24 Main_x), 117818#(<= 23 Main_x), 117821#(<= 26 Main_x), 117820#(<= 25 Main_x), 117823#(<= 28 Main_x), 117822#(<= 27 Main_x), 117825#(<= 30 Main_x), 117824#(<= 29 Main_x), 117827#(<= 32 Main_x), 117826#(<= 31 Main_x), 117829#(<= 34 Main_x), 117828#(<= 33 Main_x), 117831#(<= 36 Main_x), 117830#(<= 35 Main_x), 117833#(<= 38 Main_x), 117832#(<= 37 Main_x), 117835#(<= 40 Main_x), 117834#(<= 39 Main_x), 117837#(<= 42 Main_x), 117836#(<= 41 Main_x), 117839#(<= 44 Main_x), 117838#(<= 43 Main_x), 117841#(<= 46 Main_x), 117840#(<= 45 Main_x), 117843#(<= 48 Main_x), 117842#(<= 47 Main_x), 117845#(<= 50 Main_x), 117844#(<= 49 Main_x), 117847#(<= 52 Main_x), 117846#(<= 51 Main_x), 117849#(<= 54 Main_x), 117848#(<= 53 Main_x), 117851#(<= 56 Main_x), 117850#(<= 55 Main_x), 117853#(<= 58 Main_x), 117852#(<= 57 Main_x), 117855#(<= 60 Main_x), 117854#(<= 59 Main_x), 117857#(<= 62 Main_x), 117856#(<= 61 Main_x), 117859#(<= 64 Main_x), 117858#(<= 63 Main_x), 117861#(<= 66 Main_x), 117860#(<= 65 Main_x), 117863#(<= 68 Main_x), 117862#(<= 67 Main_x), 117865#(<= 70 Main_x), 117864#(<= 69 Main_x), 117867#(<= 72 Main_x), 117866#(<= 71 Main_x), 117869#(<= 74 Main_x), 117868#(<= 73 Main_x), 117871#(<= 76 Main_x), 117870#(<= 75 Main_x), 117873#(<= 78 Main_x), 117872#(<= 77 Main_x), 117875#(<= 80 Main_x), 117874#(<= 79 Main_x), 117877#(<= 82 Main_x), 117876#(<= 81 Main_x), 117879#(<= 84 Main_x), 117878#(<= 83 Main_x)] [2018-07-23 13:57:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3570 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:47,548 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:57:47,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:57:47,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:57:47,549 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-07-23 13:57:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:47,713 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-07-23 13:57:47,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:57:47,713 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-23 13:57:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:47,714 INFO L225 Difference]: With dead ends: 177 [2018-07-23 13:57:47,714 INFO L226 Difference]: Without dead ends: 174 [2018-07-23 13:57:47,714 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:57:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-23 13:57:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-23 13:57:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-23 13:57:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-07-23 13:57:47,841 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 172 [2018-07-23 13:57:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:47,842 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-07-23 13:57:47,842 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:57:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-07-23 13:57:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-23 13:57:47,842 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:47,842 INFO L357 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1] [2018-07-23 13:57:47,843 INFO L414 AbstractCegarLoop]: === Iteration 253 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1523952569, now seen corresponding path program 250 times [2018-07-23 13:57:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:48,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:48,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:57:48,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:48,257 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:57:48,258 INFO L185 omatonBuilderFactory]: Interpolants [118657#(and (<= 73 Main_y) (<= Main_y 73)), 118656#(and (<= 72 Main_y) (<= Main_y 72)), 118659#(and (<= Main_y 75) (<= 75 Main_y)), 118658#(and (<= 74 Main_y) (<= Main_y 74)), 118661#(and (<= Main_y 77) (<= 77 Main_y)), 118660#(and (<= Main_y 76) (<= 76 Main_y)), 118663#(and (<= 79 Main_y) (<= Main_y 79)), 118662#(and (<= Main_y 78) (<= 78 Main_y)), 118665#(and (<= 81 Main_y) (<= Main_y 81)), 118664#(and (<= Main_y 80) (<= 80 Main_y)), 118667#(and (<= Main_y 83) (<= 83 Main_y)), 118666#(and (<= Main_y 82) (<= 82 Main_y)), 118668#(and (<= Main_y 84) (<= 84 Main_y)), 118583#false, 118582#true, 118585#(and (<= 1 Main_y) (<= Main_y 1)), 118584#(and (<= 0 Main_y) (<= Main_y 0)), 118587#(and (<= Main_y 3) (<= 3 Main_y)), 118586#(and (<= Main_y 2) (<= 2 Main_y)), 118589#(and (<= Main_y 5) (<= 5 Main_y)), 118588#(and (<= Main_y 4) (<= 4 Main_y)), 118591#(and (<= 7 Main_y) (<= Main_y 7)), 118590#(and (<= Main_y 6) (<= 6 Main_y)), 118593#(and (<= Main_y 9) (<= 9 Main_y)), 118592#(and (<= 8 Main_y) (<= Main_y 8)), 118595#(and (<= 11 Main_y) (<= Main_y 11)), 118594#(and (<= 10 Main_y) (<= Main_y 10)), 118597#(and (<= 13 Main_y) (<= Main_y 13)), 118596#(and (<= 12 Main_y) (<= Main_y 12)), 118599#(and (<= Main_y 15) (<= 15 Main_y)), 118598#(and (<= 14 Main_y) (<= Main_y 14)), 118601#(and (<= Main_y 17) (<= 17 Main_y)), 118600#(and (<= 16 Main_y) (<= Main_y 16)), 118603#(and (<= Main_y 19) (<= 19 Main_y)), 118602#(and (<= Main_y 18) (<= 18 Main_y)), 118605#(and (<= 21 Main_y) (<= Main_y 21)), 118604#(and (<= 20 Main_y) (<= Main_y 20)), 118607#(and (<= 23 Main_y) (<= Main_y 23)), 118606#(and (<= Main_y 22) (<= 22 Main_y)), 118609#(and (<= 25 Main_y) (<= Main_y 25)), 118608#(and (<= Main_y 24) (<= 24 Main_y)), 118611#(and (<= 27 Main_y) (<= Main_y 27)), 118610#(and (<= Main_y 26) (<= 26 Main_y)), 118613#(and (<= 29 Main_y) (<= Main_y 29)), 118612#(and (<= 28 Main_y) (<= Main_y 28)), 118615#(and (<= Main_y 31) (<= 31 Main_y)), 118614#(and (<= 30 Main_y) (<= Main_y 30)), 118617#(and (<= 33 Main_y) (<= Main_y 33)), 118616#(and (<= 32 Main_y) (<= Main_y 32)), 118619#(and (<= 35 Main_y) (<= Main_y 35)), 118618#(and (<= Main_y 34) (<= 34 Main_y)), 118621#(and (<= Main_y 37) (<= 37 Main_y)), 118620#(and (<= 36 Main_y) (<= Main_y 36)), 118623#(and (<= 39 Main_y) (<= Main_y 39)), 118622#(and (<= Main_y 38) (<= 38 Main_y)), 118625#(and (<= Main_y 41) (<= 41 Main_y)), 118624#(and (<= 40 Main_y) (<= Main_y 40)), 118627#(and (<= 43 Main_y) (<= Main_y 43)), 118626#(and (<= 42 Main_y) (<= Main_y 42)), 118629#(and (<= Main_y 45) (<= 45 Main_y)), 118628#(and (<= 44 Main_y) (<= Main_y 44)), 118631#(and (<= 47 Main_y) (<= Main_y 47)), 118630#(and (<= 46 Main_y) (<= Main_y 46)), 118633#(and (<= 49 Main_y) (<= Main_y 49)), 118632#(and (<= 48 Main_y) (<= Main_y 48)), 118635#(and (<= 51 Main_y) (<= Main_y 51)), 118634#(and (<= 50 Main_y) (<= Main_y 50)), 118637#(and (<= 53 Main_y) (<= Main_y 53)), 118636#(and (<= 52 Main_y) (<= Main_y 52)), 118639#(and (<= 55 Main_y) (<= Main_y 55)), 118638#(and (<= 54 Main_y) (<= Main_y 54)), 118641#(and (<= Main_y 57) (<= 57 Main_y)), 118640#(and (<= Main_y 56) (<= 56 Main_y)), 118643#(and (<= Main_y 59) (<= 59 Main_y)), 118642#(and (<= Main_y 58) (<= 58 Main_y)), 118645#(and (<= Main_y 61) (<= 61 Main_y)), 118644#(and (<= Main_y 60) (<= 60 Main_y)), 118647#(and (<= 63 Main_y) (<= Main_y 63)), 118646#(and (<= 62 Main_y) (<= Main_y 62)), 118649#(and (<= Main_y 65) (<= 65 Main_y)), 118648#(and (<= 64 Main_y) (<= Main_y 64)), 118651#(and (<= 67 Main_y) (<= Main_y 67)), 118650#(and (<= Main_y 66) (<= 66 Main_y)), 118653#(and (<= Main_y 69) (<= 69 Main_y)), 118652#(and (<= 68 Main_y) (<= Main_y 68)), 118655#(and (<= Main_y 71) (<= 71 Main_y)), 118654#(and (<= 70 Main_y) (<= Main_y 70))] [2018-07-23 13:57:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:48,258 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:57:48,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:57:48,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:57:48,259 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 87 states. [2018-07-23 13:57:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:49,318 INFO L93 Difference]: Finished difference Result 263 states and 265 transitions. [2018-07-23 13:57:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:57:49,318 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 173 [2018-07-23 13:57:49,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:49,319 INFO L225 Difference]: With dead ends: 263 [2018-07-23 13:57:49,319 INFO L226 Difference]: Without dead ends: 260 [2018-07-23 13:57:49,319 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:57:49,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-07-23 13:57:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 176. [2018-07-23 13:57:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-23 13:57:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-07-23 13:57:49,467 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 173 [2018-07-23 13:57:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:49,467 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-07-23 13:57:49,467 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:57:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-07-23 13:57:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-23 13:57:49,467 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:49,467 INFO L357 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2018-07-23 13:57:49,468 INFO L414 AbstractCegarLoop]: === Iteration 254 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2049095, now seen corresponding path program 251 times [2018-07-23 13:57:49,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:49,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:49,731 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:57:49,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:49,732 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:57:49,732 INFO L185 omatonBuilderFactory]: Interpolants [119553#(<= Main_x 4), 119552#(<= Main_x 3), 119555#(<= Main_x 6), 119554#(<= Main_x 5), 119557#(<= Main_x 8), 119556#(<= Main_x 7), 119559#(<= Main_x 10), 119558#(<= Main_x 9), 119561#(<= Main_x 12), 119560#(<= Main_x 11), 119563#(<= Main_x 14), 119562#(<= Main_x 13), 119565#(<= Main_x 16), 119564#(<= Main_x 15), 119567#(<= Main_x 18), 119566#(<= Main_x 17), 119569#(<= Main_x 20), 119568#(<= Main_x 19), 119571#(<= Main_x 22), 119570#(<= Main_x 21), 119573#(<= Main_x 24), 119572#(<= Main_x 23), 119575#(<= Main_x 26), 119574#(<= Main_x 25), 119577#(<= Main_x 28), 119576#(<= Main_x 27), 119579#(<= Main_x 30), 119578#(<= Main_x 29), 119581#(<= Main_x 32), 119580#(<= Main_x 31), 119583#(<= Main_x 34), 119582#(<= Main_x 33), 119585#(<= Main_x 36), 119584#(<= Main_x 35), 119587#(<= Main_x 38), 119586#(<= Main_x 37), 119589#(<= Main_x 40), 119588#(<= Main_x 39), 119591#(<= Main_x 42), 119590#(<= Main_x 41), 119593#(<= Main_x 44), 119592#(<= Main_x 43), 119595#(<= Main_x 46), 119594#(<= Main_x 45), 119597#(<= Main_x 48), 119596#(<= Main_x 47), 119599#(<= Main_x 50), 119598#(<= Main_x 49), 119601#(<= Main_x 52), 119600#(<= Main_x 51), 119603#(<= Main_x 54), 119602#(<= Main_x 53), 119605#(<= Main_x 56), 119604#(<= Main_x 55), 119607#(<= Main_x 58), 119606#(<= Main_x 57), 119609#(<= Main_x 60), 119608#(<= Main_x 59), 119611#(<= Main_x 62), 119610#(<= Main_x 61), 119613#(<= Main_x 64), 119612#(<= Main_x 63), 119615#(<= Main_x 66), 119614#(<= Main_x 65), 119617#(<= Main_x 68), 119616#(<= Main_x 67), 119619#(<= Main_x 70), 119618#(<= Main_x 69), 119621#(<= Main_x 72), 119620#(<= Main_x 71), 119623#(<= Main_x 74), 119622#(<= Main_x 73), 119625#(<= Main_x 76), 119624#(<= Main_x 75), 119627#(<= Main_x 78), 119626#(<= Main_x 77), 119629#(<= Main_x 80), 119628#(<= Main_x 79), 119631#(<= Main_x 82), 119630#(<= Main_x 81), 119633#(<= Main_x 84), 119632#(<= Main_x 83), 119634#(<= (+ Main_x 1) 0), 119547#true, 119549#(<= Main_x 0), 119548#false, 119551#(<= Main_x 2), 119550#(<= Main_x 1)] [2018-07-23 13:57:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:49,732 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:57:49,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:57:49,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:57:49,733 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 88 states. [2018-07-23 13:57:50,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:50,187 INFO L93 Difference]: Finished difference Result 264 states and 266 transitions. [2018-07-23 13:57:50,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:57:50,187 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-23 13:57:50,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:50,187 INFO L225 Difference]: With dead ends: 264 [2018-07-23 13:57:50,187 INFO L226 Difference]: Without dead ends: 175 [2018-07-23 13:57:50,188 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:57:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-23 13:57:50,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-23 13:57:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-23 13:57:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-07-23 13:57:50,322 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 174 [2018-07-23 13:57:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:50,323 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-07-23 13:57:50,323 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:57:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-07-23 13:57:50,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-23 13:57:50,324 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:50,324 INFO L357 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2018-07-23 13:57:50,324 INFO L414 AbstractCegarLoop]: === Iteration 255 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:50,324 INFO L82 PathProgramCache]: Analyzing trace with hash -44067091, now seen corresponding path program 252 times [2018-07-23 13:57:50,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:50,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:50,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:57:50,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:50,633 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:57:50,633 INFO L185 omatonBuilderFactory]: Interpolants [120577#(<= 62 Main_x), 120576#(<= 61 Main_x), 120579#(<= 64 Main_x), 120578#(<= 63 Main_x), 120581#(<= 66 Main_x), 120580#(<= 65 Main_x), 120583#(<= 68 Main_x), 120582#(<= 67 Main_x), 120585#(<= 70 Main_x), 120584#(<= 69 Main_x), 120587#(<= 72 Main_x), 120586#(<= 71 Main_x), 120589#(<= 74 Main_x), 120588#(<= 73 Main_x), 120591#(<= 76 Main_x), 120590#(<= 75 Main_x), 120593#(<= 78 Main_x), 120592#(<= 77 Main_x), 120595#(<= 80 Main_x), 120594#(<= 79 Main_x), 120597#(<= 82 Main_x), 120596#(<= 81 Main_x), 120599#(<= 84 Main_x), 120598#(<= 83 Main_x), 120600#(<= 85 Main_x), 120513#true, 120515#(<= 0 Main_x), 120514#false, 120517#(<= 2 Main_x), 120516#(<= 1 Main_x), 120519#(<= 4 Main_x), 120518#(<= 3 Main_x), 120521#(<= 6 Main_x), 120520#(<= 5 Main_x), 120523#(<= 8 Main_x), 120522#(<= 7 Main_x), 120525#(<= 10 Main_x), 120524#(<= 9 Main_x), 120527#(<= 12 Main_x), 120526#(<= 11 Main_x), 120529#(<= 14 Main_x), 120528#(<= 13 Main_x), 120531#(<= 16 Main_x), 120530#(<= 15 Main_x), 120533#(<= 18 Main_x), 120532#(<= 17 Main_x), 120535#(<= 20 Main_x), 120534#(<= 19 Main_x), 120537#(<= 22 Main_x), 120536#(<= 21 Main_x), 120539#(<= 24 Main_x), 120538#(<= 23 Main_x), 120541#(<= 26 Main_x), 120540#(<= 25 Main_x), 120543#(<= 28 Main_x), 120542#(<= 27 Main_x), 120545#(<= 30 Main_x), 120544#(<= 29 Main_x), 120547#(<= 32 Main_x), 120546#(<= 31 Main_x), 120549#(<= 34 Main_x), 120548#(<= 33 Main_x), 120551#(<= 36 Main_x), 120550#(<= 35 Main_x), 120553#(<= 38 Main_x), 120552#(<= 37 Main_x), 120555#(<= 40 Main_x), 120554#(<= 39 Main_x), 120557#(<= 42 Main_x), 120556#(<= 41 Main_x), 120559#(<= 44 Main_x), 120558#(<= 43 Main_x), 120561#(<= 46 Main_x), 120560#(<= 45 Main_x), 120563#(<= 48 Main_x), 120562#(<= 47 Main_x), 120565#(<= 50 Main_x), 120564#(<= 49 Main_x), 120567#(<= 52 Main_x), 120566#(<= 51 Main_x), 120569#(<= 54 Main_x), 120568#(<= 53 Main_x), 120571#(<= 56 Main_x), 120570#(<= 55 Main_x), 120573#(<= 58 Main_x), 120572#(<= 57 Main_x), 120575#(<= 60 Main_x), 120574#(<= 59 Main_x)] [2018-07-23 13:57:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3655 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:50,633 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:57:50,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:57:50,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:57:50,634 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-07-23 13:57:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:50,866 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-07-23 13:57:50,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:57:50,866 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-23 13:57:50,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:50,867 INFO L225 Difference]: With dead ends: 179 [2018-07-23 13:57:50,867 INFO L226 Difference]: Without dead ends: 176 [2018-07-23 13:57:50,867 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:57:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-23 13:57:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-23 13:57:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-23 13:57:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2018-07-23 13:57:51,002 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 174 [2018-07-23 13:57:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:51,002 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2018-07-23 13:57:51,002 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:57:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2018-07-23 13:57:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-23 13:57:51,003 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:51,003 INFO L357 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1] [2018-07-23 13:57:51,003 INFO L414 AbstractCegarLoop]: === Iteration 256 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1366141343, now seen corresponding path program 253 times [2018-07-23 13:57:51,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:51,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:51,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:57:51,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:51,435 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:57:51,436 INFO L185 omatonBuilderFactory]: Interpolants [121345#(and (<= 32 Main_y) (<= Main_y 32)), 121344#(and (<= Main_y 31) (<= 31 Main_y)), 121347#(and (<= Main_y 34) (<= 34 Main_y)), 121346#(and (<= 33 Main_y) (<= Main_y 33)), 121349#(and (<= 36 Main_y) (<= Main_y 36)), 121348#(and (<= 35 Main_y) (<= Main_y 35)), 121351#(and (<= Main_y 38) (<= 38 Main_y)), 121350#(and (<= Main_y 37) (<= 37 Main_y)), 121353#(and (<= 40 Main_y) (<= Main_y 40)), 121352#(and (<= 39 Main_y) (<= Main_y 39)), 121355#(and (<= 42 Main_y) (<= Main_y 42)), 121354#(and (<= Main_y 41) (<= 41 Main_y)), 121357#(and (<= 44 Main_y) (<= Main_y 44)), 121356#(and (<= 43 Main_y) (<= Main_y 43)), 121359#(and (<= 46 Main_y) (<= Main_y 46)), 121358#(and (<= Main_y 45) (<= 45 Main_y)), 121361#(and (<= 48 Main_y) (<= Main_y 48)), 121360#(and (<= 47 Main_y) (<= Main_y 47)), 121363#(and (<= 50 Main_y) (<= Main_y 50)), 121362#(and (<= 49 Main_y) (<= Main_y 49)), 121365#(and (<= 52 Main_y) (<= Main_y 52)), 121364#(and (<= 51 Main_y) (<= Main_y 51)), 121367#(and (<= 54 Main_y) (<= Main_y 54)), 121366#(and (<= 53 Main_y) (<= Main_y 53)), 121369#(and (<= Main_y 56) (<= 56 Main_y)), 121368#(and (<= 55 Main_y) (<= Main_y 55)), 121371#(and (<= Main_y 58) (<= 58 Main_y)), 121370#(and (<= Main_y 57) (<= 57 Main_y)), 121373#(and (<= Main_y 60) (<= 60 Main_y)), 121372#(and (<= Main_y 59) (<= 59 Main_y)), 121375#(and (<= 62 Main_y) (<= Main_y 62)), 121374#(and (<= Main_y 61) (<= 61 Main_y)), 121377#(and (<= 64 Main_y) (<= Main_y 64)), 121376#(and (<= 63 Main_y) (<= Main_y 63)), 121379#(and (<= Main_y 66) (<= 66 Main_y)), 121378#(and (<= Main_y 65) (<= 65 Main_y)), 121381#(and (<= 68 Main_y) (<= Main_y 68)), 121380#(and (<= 67 Main_y) (<= Main_y 67)), 121383#(and (<= 70 Main_y) (<= Main_y 70)), 121382#(and (<= Main_y 69) (<= 69 Main_y)), 121385#(and (<= 72 Main_y) (<= Main_y 72)), 121384#(and (<= Main_y 71) (<= 71 Main_y)), 121387#(and (<= 74 Main_y) (<= Main_y 74)), 121386#(and (<= 73 Main_y) (<= Main_y 73)), 121389#(and (<= Main_y 76) (<= 76 Main_y)), 121388#(and (<= Main_y 75) (<= 75 Main_y)), 121391#(and (<= Main_y 78) (<= 78 Main_y)), 121390#(and (<= Main_y 77) (<= 77 Main_y)), 121393#(and (<= Main_y 80) (<= 80 Main_y)), 121392#(and (<= 79 Main_y) (<= Main_y 79)), 121395#(and (<= Main_y 82) (<= 82 Main_y)), 121394#(and (<= 81 Main_y) (<= Main_y 81)), 121397#(and (<= Main_y 84) (<= 84 Main_y)), 121396#(and (<= Main_y 83) (<= 83 Main_y)), 121398#(and (<= Main_y 85) (<= 85 Main_y)), 121311#true, 121313#(and (<= 0 Main_y) (<= Main_y 0)), 121312#false, 121315#(and (<= Main_y 2) (<= 2 Main_y)), 121314#(and (<= 1 Main_y) (<= Main_y 1)), 121317#(and (<= Main_y 4) (<= 4 Main_y)), 121316#(and (<= Main_y 3) (<= 3 Main_y)), 121319#(and (<= Main_y 6) (<= 6 Main_y)), 121318#(and (<= Main_y 5) (<= 5 Main_y)), 121321#(and (<= 8 Main_y) (<= Main_y 8)), 121320#(and (<= 7 Main_y) (<= Main_y 7)), 121323#(and (<= 10 Main_y) (<= Main_y 10)), 121322#(and (<= Main_y 9) (<= 9 Main_y)), 121325#(and (<= 12 Main_y) (<= Main_y 12)), 121324#(and (<= 11 Main_y) (<= Main_y 11)), 121327#(and (<= 14 Main_y) (<= Main_y 14)), 121326#(and (<= 13 Main_y) (<= Main_y 13)), 121329#(and (<= 16 Main_y) (<= Main_y 16)), 121328#(and (<= Main_y 15) (<= 15 Main_y)), 121331#(and (<= Main_y 18) (<= 18 Main_y)), 121330#(and (<= Main_y 17) (<= 17 Main_y)), 121333#(and (<= 20 Main_y) (<= Main_y 20)), 121332#(and (<= Main_y 19) (<= 19 Main_y)), 121335#(and (<= Main_y 22) (<= 22 Main_y)), 121334#(and (<= 21 Main_y) (<= Main_y 21)), 121337#(and (<= Main_y 24) (<= 24 Main_y)), 121336#(and (<= 23 Main_y) (<= Main_y 23)), 121339#(and (<= Main_y 26) (<= 26 Main_y)), 121338#(and (<= 25 Main_y) (<= Main_y 25)), 121341#(and (<= 28 Main_y) (<= Main_y 28)), 121340#(and (<= 27 Main_y) (<= Main_y 27)), 121343#(and (<= 30 Main_y) (<= Main_y 30)), 121342#(and (<= 29 Main_y) (<= Main_y 29))] [2018-07-23 13:57:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:51,437 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:57:51,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:57:51,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:57:51,437 INFO L87 Difference]: Start difference. First operand 176 states and 177 transitions. Second operand 88 states. [2018-07-23 13:57:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:52,550 INFO L93 Difference]: Finished difference Result 266 states and 268 transitions. [2018-07-23 13:57:52,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:57:52,550 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 175 [2018-07-23 13:57:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:52,551 INFO L225 Difference]: With dead ends: 266 [2018-07-23 13:57:52,551 INFO L226 Difference]: Without dead ends: 263 [2018-07-23 13:57:52,551 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:57:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-23 13:57:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 178. [2018-07-23 13:57:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-23 13:57:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-07-23 13:57:52,699 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 175 [2018-07-23 13:57:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:52,699 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-07-23 13:57:52,699 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:57:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-07-23 13:57:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 13:57:52,700 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:52,700 INFO L357 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2018-07-23 13:57:52,701 INFO L414 AbstractCegarLoop]: === Iteration 257 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash 599229805, now seen corresponding path program 254 times [2018-07-23 13:57:52,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3741 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:52,992 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:52,992 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:57:52,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:52,992 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:57:52,992 INFO L185 omatonBuilderFactory]: Interpolants [122369#(<= Main_x 80), 122368#(<= Main_x 79), 122371#(<= Main_x 82), 122370#(<= Main_x 81), 122373#(<= Main_x 84), 122372#(<= Main_x 83), 122375#(<= (+ Main_x 1) 0), 122374#(<= Main_x 85), 122287#true, 122289#(<= Main_x 0), 122288#false, 122291#(<= Main_x 2), 122290#(<= Main_x 1), 122293#(<= Main_x 4), 122292#(<= Main_x 3), 122295#(<= Main_x 6), 122294#(<= Main_x 5), 122297#(<= Main_x 8), 122296#(<= Main_x 7), 122299#(<= Main_x 10), 122298#(<= Main_x 9), 122301#(<= Main_x 12), 122300#(<= Main_x 11), 122303#(<= Main_x 14), 122302#(<= Main_x 13), 122305#(<= Main_x 16), 122304#(<= Main_x 15), 122307#(<= Main_x 18), 122306#(<= Main_x 17), 122309#(<= Main_x 20), 122308#(<= Main_x 19), 122311#(<= Main_x 22), 122310#(<= Main_x 21), 122313#(<= Main_x 24), 122312#(<= Main_x 23), 122315#(<= Main_x 26), 122314#(<= Main_x 25), 122317#(<= Main_x 28), 122316#(<= Main_x 27), 122319#(<= Main_x 30), 122318#(<= Main_x 29), 122321#(<= Main_x 32), 122320#(<= Main_x 31), 122323#(<= Main_x 34), 122322#(<= Main_x 33), 122325#(<= Main_x 36), 122324#(<= Main_x 35), 122327#(<= Main_x 38), 122326#(<= Main_x 37), 122329#(<= Main_x 40), 122328#(<= Main_x 39), 122331#(<= Main_x 42), 122330#(<= Main_x 41), 122333#(<= Main_x 44), 122332#(<= Main_x 43), 122335#(<= Main_x 46), 122334#(<= Main_x 45), 122337#(<= Main_x 48), 122336#(<= Main_x 47), 122339#(<= Main_x 50), 122338#(<= Main_x 49), 122341#(<= Main_x 52), 122340#(<= Main_x 51), 122343#(<= Main_x 54), 122342#(<= Main_x 53), 122345#(<= Main_x 56), 122344#(<= Main_x 55), 122347#(<= Main_x 58), 122346#(<= Main_x 57), 122349#(<= Main_x 60), 122348#(<= Main_x 59), 122351#(<= Main_x 62), 122350#(<= Main_x 61), 122353#(<= Main_x 64), 122352#(<= Main_x 63), 122355#(<= Main_x 66), 122354#(<= Main_x 65), 122357#(<= Main_x 68), 122356#(<= Main_x 67), 122359#(<= Main_x 70), 122358#(<= Main_x 69), 122361#(<= Main_x 72), 122360#(<= Main_x 71), 122363#(<= Main_x 74), 122362#(<= Main_x 73), 122365#(<= Main_x 76), 122364#(<= Main_x 75), 122367#(<= Main_x 78), 122366#(<= Main_x 77)] [2018-07-23 13:57:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3741 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:52,993 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:57:52,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:57:52,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:57:52,994 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 89 states. [2018-07-23 13:57:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:53,414 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-07-23 13:57:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:57:53,414 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-23 13:57:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:53,415 INFO L225 Difference]: With dead ends: 267 [2018-07-23 13:57:53,415 INFO L226 Difference]: Without dead ends: 177 [2018-07-23 13:57:53,416 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:57:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-23 13:57:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-23 13:57:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 13:57:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-07-23 13:57:53,556 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 176 [2018-07-23 13:57:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:53,556 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-07-23 13:57:53,556 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:57:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-07-23 13:57:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 13:57:53,557 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:53,557 INFO L357 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2018-07-23 13:57:53,557 INFO L414 AbstractCegarLoop]: === Iteration 258 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash -830371961, now seen corresponding path program 255 times [2018-07-23 13:57:53,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3741 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:53,949 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:53,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:57:53,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:53,949 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:57:53,949 INFO L185 omatonBuilderFactory]: Interpolants [123265#false, 123264#true, 123267#(<= 1 Main_x), 123266#(<= 0 Main_x), 123269#(<= 3 Main_x), 123268#(<= 2 Main_x), 123271#(<= 5 Main_x), 123270#(<= 4 Main_x), 123273#(<= 7 Main_x), 123272#(<= 6 Main_x), 123275#(<= 9 Main_x), 123274#(<= 8 Main_x), 123277#(<= 11 Main_x), 123276#(<= 10 Main_x), 123279#(<= 13 Main_x), 123278#(<= 12 Main_x), 123281#(<= 15 Main_x), 123280#(<= 14 Main_x), 123283#(<= 17 Main_x), 123282#(<= 16 Main_x), 123285#(<= 19 Main_x), 123284#(<= 18 Main_x), 123287#(<= 21 Main_x), 123286#(<= 20 Main_x), 123289#(<= 23 Main_x), 123288#(<= 22 Main_x), 123291#(<= 25 Main_x), 123290#(<= 24 Main_x), 123293#(<= 27 Main_x), 123292#(<= 26 Main_x), 123295#(<= 29 Main_x), 123294#(<= 28 Main_x), 123297#(<= 31 Main_x), 123296#(<= 30 Main_x), 123299#(<= 33 Main_x), 123298#(<= 32 Main_x), 123301#(<= 35 Main_x), 123300#(<= 34 Main_x), 123303#(<= 37 Main_x), 123302#(<= 36 Main_x), 123305#(<= 39 Main_x), 123304#(<= 38 Main_x), 123307#(<= 41 Main_x), 123306#(<= 40 Main_x), 123309#(<= 43 Main_x), 123308#(<= 42 Main_x), 123311#(<= 45 Main_x), 123310#(<= 44 Main_x), 123313#(<= 47 Main_x), 123312#(<= 46 Main_x), 123315#(<= 49 Main_x), 123314#(<= 48 Main_x), 123317#(<= 51 Main_x), 123316#(<= 50 Main_x), 123319#(<= 53 Main_x), 123318#(<= 52 Main_x), 123321#(<= 55 Main_x), 123320#(<= 54 Main_x), 123323#(<= 57 Main_x), 123322#(<= 56 Main_x), 123325#(<= 59 Main_x), 123324#(<= 58 Main_x), 123327#(<= 61 Main_x), 123326#(<= 60 Main_x), 123329#(<= 63 Main_x), 123328#(<= 62 Main_x), 123331#(<= 65 Main_x), 123330#(<= 64 Main_x), 123333#(<= 67 Main_x), 123332#(<= 66 Main_x), 123335#(<= 69 Main_x), 123334#(<= 68 Main_x), 123337#(<= 71 Main_x), 123336#(<= 70 Main_x), 123339#(<= 73 Main_x), 123338#(<= 72 Main_x), 123341#(<= 75 Main_x), 123340#(<= 74 Main_x), 123343#(<= 77 Main_x), 123342#(<= 76 Main_x), 123345#(<= 79 Main_x), 123344#(<= 78 Main_x), 123347#(<= 81 Main_x), 123346#(<= 80 Main_x), 123349#(<= 83 Main_x), 123348#(<= 82 Main_x), 123351#(<= 85 Main_x), 123350#(<= 84 Main_x), 123352#(<= 86 Main_x)] [2018-07-23 13:57:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3741 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:53,950 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:57:53,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:57:53,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:57:53,951 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-07-23 13:57:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:54,150 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-07-23 13:57:54,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:57:54,150 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-23 13:57:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:54,151 INFO L225 Difference]: With dead ends: 181 [2018-07-23 13:57:54,151 INFO L226 Difference]: Without dead ends: 178 [2018-07-23 13:57:54,152 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:57:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-23 13:57:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-23 13:57:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-23 13:57:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-07-23 13:57:54,392 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-07-23 13:57:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:54,393 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-07-23 13:57:54,393 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:57:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-07-23 13:57:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-23 13:57:54,394 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:54,394 INFO L357 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1] [2018-07-23 13:57:54,394 INFO L414 AbstractCegarLoop]: === Iteration 259 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:54,394 INFO L82 PathProgramCache]: Analyzing trace with hash 28211463, now seen corresponding path program 256 times [2018-07-23 13:57:54,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:54,950 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:54,950 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:57:54,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:54,951 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:57:54,951 INFO L185 omatonBuilderFactory]: Interpolants [124071#true, 124073#(and (<= 0 Main_y) (<= Main_y 0)), 124072#false, 124075#(and (<= Main_y 2) (<= 2 Main_y)), 124074#(and (<= 1 Main_y) (<= Main_y 1)), 124077#(and (<= Main_y 4) (<= 4 Main_y)), 124076#(and (<= Main_y 3) (<= 3 Main_y)), 124079#(and (<= Main_y 6) (<= 6 Main_y)), 124078#(and (<= Main_y 5) (<= 5 Main_y)), 124081#(and (<= 8 Main_y) (<= Main_y 8)), 124080#(and (<= 7 Main_y) (<= Main_y 7)), 124083#(and (<= 10 Main_y) (<= Main_y 10)), 124082#(and (<= Main_y 9) (<= 9 Main_y)), 124085#(and (<= 12 Main_y) (<= Main_y 12)), 124084#(and (<= 11 Main_y) (<= Main_y 11)), 124087#(and (<= 14 Main_y) (<= Main_y 14)), 124086#(and (<= 13 Main_y) (<= Main_y 13)), 124089#(and (<= 16 Main_y) (<= Main_y 16)), 124088#(and (<= Main_y 15) (<= 15 Main_y)), 124091#(and (<= Main_y 18) (<= 18 Main_y)), 124090#(and (<= Main_y 17) (<= 17 Main_y)), 124093#(and (<= 20 Main_y) (<= Main_y 20)), 124092#(and (<= Main_y 19) (<= 19 Main_y)), 124095#(and (<= Main_y 22) (<= 22 Main_y)), 124094#(and (<= 21 Main_y) (<= Main_y 21)), 124097#(and (<= Main_y 24) (<= 24 Main_y)), 124096#(and (<= 23 Main_y) (<= Main_y 23)), 124099#(and (<= Main_y 26) (<= 26 Main_y)), 124098#(and (<= 25 Main_y) (<= Main_y 25)), 124101#(and (<= 28 Main_y) (<= Main_y 28)), 124100#(and (<= 27 Main_y) (<= Main_y 27)), 124103#(and (<= 30 Main_y) (<= Main_y 30)), 124102#(and (<= 29 Main_y) (<= Main_y 29)), 124105#(and (<= 32 Main_y) (<= Main_y 32)), 124104#(and (<= Main_y 31) (<= 31 Main_y)), 124107#(and (<= Main_y 34) (<= 34 Main_y)), 124106#(and (<= 33 Main_y) (<= Main_y 33)), 124109#(and (<= 36 Main_y) (<= Main_y 36)), 124108#(and (<= 35 Main_y) (<= Main_y 35)), 124111#(and (<= Main_y 38) (<= 38 Main_y)), 124110#(and (<= Main_y 37) (<= 37 Main_y)), 124113#(and (<= 40 Main_y) (<= Main_y 40)), 124112#(and (<= 39 Main_y) (<= Main_y 39)), 124115#(and (<= 42 Main_y) (<= Main_y 42)), 124114#(and (<= Main_y 41) (<= 41 Main_y)), 124117#(and (<= 44 Main_y) (<= Main_y 44)), 124116#(and (<= 43 Main_y) (<= Main_y 43)), 124119#(and (<= 46 Main_y) (<= Main_y 46)), 124118#(and (<= Main_y 45) (<= 45 Main_y)), 124121#(and (<= 48 Main_y) (<= Main_y 48)), 124120#(and (<= 47 Main_y) (<= Main_y 47)), 124123#(and (<= 50 Main_y) (<= Main_y 50)), 124122#(and (<= 49 Main_y) (<= Main_y 49)), 124125#(and (<= 52 Main_y) (<= Main_y 52)), 124124#(and (<= 51 Main_y) (<= Main_y 51)), 124127#(and (<= 54 Main_y) (<= Main_y 54)), 124126#(and (<= 53 Main_y) (<= Main_y 53)), 124129#(and (<= Main_y 56) (<= 56 Main_y)), 124128#(and (<= 55 Main_y) (<= Main_y 55)), 124131#(and (<= Main_y 58) (<= 58 Main_y)), 124130#(and (<= Main_y 57) (<= 57 Main_y)), 124133#(and (<= Main_y 60) (<= 60 Main_y)), 124132#(and (<= Main_y 59) (<= 59 Main_y)), 124135#(and (<= 62 Main_y) (<= Main_y 62)), 124134#(and (<= Main_y 61) (<= 61 Main_y)), 124137#(and (<= 64 Main_y) (<= Main_y 64)), 124136#(and (<= 63 Main_y) (<= Main_y 63)), 124139#(and (<= Main_y 66) (<= 66 Main_y)), 124138#(and (<= Main_y 65) (<= 65 Main_y)), 124141#(and (<= 68 Main_y) (<= Main_y 68)), 124140#(and (<= 67 Main_y) (<= Main_y 67)), 124143#(and (<= 70 Main_y) (<= Main_y 70)), 124142#(and (<= Main_y 69) (<= 69 Main_y)), 124145#(and (<= 72 Main_y) (<= Main_y 72)), 124144#(and (<= Main_y 71) (<= 71 Main_y)), 124147#(and (<= 74 Main_y) (<= Main_y 74)), 124146#(and (<= 73 Main_y) (<= Main_y 73)), 124149#(and (<= Main_y 76) (<= 76 Main_y)), 124148#(and (<= Main_y 75) (<= 75 Main_y)), 124151#(and (<= Main_y 78) (<= 78 Main_y)), 124150#(and (<= Main_y 77) (<= 77 Main_y)), 124153#(and (<= Main_y 80) (<= 80 Main_y)), 124152#(and (<= 79 Main_y) (<= Main_y 79)), 124155#(and (<= Main_y 82) (<= 82 Main_y)), 124154#(and (<= 81 Main_y) (<= Main_y 81)), 124157#(and (<= Main_y 84) (<= 84 Main_y)), 124156#(and (<= Main_y 83) (<= 83 Main_y)), 124159#(and (<= 86 Main_y) (<= Main_y 86)), 124158#(and (<= Main_y 85) (<= 85 Main_y))] [2018-07-23 13:57:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:54,951 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:57:54,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:57:54,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:57:54,952 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 89 states. [2018-07-23 13:57:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:56,089 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2018-07-23 13:57:56,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:57:56,089 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 177 [2018-07-23 13:57:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:56,089 INFO L225 Difference]: With dead ends: 269 [2018-07-23 13:57:56,090 INFO L226 Difference]: Without dead ends: 266 [2018-07-23 13:57:56,090 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:57:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-07-23 13:57:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 180. [2018-07-23 13:57:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-23 13:57:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-07-23 13:57:56,242 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 177 [2018-07-23 13:57:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:56,242 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-07-23 13:57:56,242 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:57:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-07-23 13:57:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 13:57:56,243 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:56,243 INFO L357 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2018-07-23 13:57:56,243 INFO L414 AbstractCegarLoop]: === Iteration 260 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash 874493831, now seen corresponding path program 257 times [2018-07-23 13:57:56,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:56,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:56,518 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:57:56,518 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:56,518 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:57:56,519 INFO L185 omatonBuilderFactory]: Interpolants [125059#false, 125058#true, 125061#(<= Main_x 1), 125060#(<= Main_x 0), 125063#(<= Main_x 3), 125062#(<= Main_x 2), 125065#(<= Main_x 5), 125064#(<= Main_x 4), 125067#(<= Main_x 7), 125066#(<= Main_x 6), 125069#(<= Main_x 9), 125068#(<= Main_x 8), 125071#(<= Main_x 11), 125070#(<= Main_x 10), 125073#(<= Main_x 13), 125072#(<= Main_x 12), 125075#(<= Main_x 15), 125074#(<= Main_x 14), 125077#(<= Main_x 17), 125076#(<= Main_x 16), 125079#(<= Main_x 19), 125078#(<= Main_x 18), 125081#(<= Main_x 21), 125080#(<= Main_x 20), 125083#(<= Main_x 23), 125082#(<= Main_x 22), 125085#(<= Main_x 25), 125084#(<= Main_x 24), 125087#(<= Main_x 27), 125086#(<= Main_x 26), 125089#(<= Main_x 29), 125088#(<= Main_x 28), 125091#(<= Main_x 31), 125090#(<= Main_x 30), 125093#(<= Main_x 33), 125092#(<= Main_x 32), 125095#(<= Main_x 35), 125094#(<= Main_x 34), 125097#(<= Main_x 37), 125096#(<= Main_x 36), 125099#(<= Main_x 39), 125098#(<= Main_x 38), 125101#(<= Main_x 41), 125100#(<= Main_x 40), 125103#(<= Main_x 43), 125102#(<= Main_x 42), 125105#(<= Main_x 45), 125104#(<= Main_x 44), 125107#(<= Main_x 47), 125106#(<= Main_x 46), 125109#(<= Main_x 49), 125108#(<= Main_x 48), 125111#(<= Main_x 51), 125110#(<= Main_x 50), 125113#(<= Main_x 53), 125112#(<= Main_x 52), 125115#(<= Main_x 55), 125114#(<= Main_x 54), 125117#(<= Main_x 57), 125116#(<= Main_x 56), 125119#(<= Main_x 59), 125118#(<= Main_x 58), 125121#(<= Main_x 61), 125120#(<= Main_x 60), 125123#(<= Main_x 63), 125122#(<= Main_x 62), 125125#(<= Main_x 65), 125124#(<= Main_x 64), 125127#(<= Main_x 67), 125126#(<= Main_x 66), 125129#(<= Main_x 69), 125128#(<= Main_x 68), 125131#(<= Main_x 71), 125130#(<= Main_x 70), 125133#(<= Main_x 73), 125132#(<= Main_x 72), 125135#(<= Main_x 75), 125134#(<= Main_x 74), 125137#(<= Main_x 77), 125136#(<= Main_x 76), 125139#(<= Main_x 79), 125138#(<= Main_x 78), 125141#(<= Main_x 81), 125140#(<= Main_x 80), 125143#(<= Main_x 83), 125142#(<= Main_x 82), 125145#(<= Main_x 85), 125144#(<= Main_x 84), 125147#(<= (+ Main_x 1) 0), 125146#(<= Main_x 86)] [2018-07-23 13:57:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:56,519 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:57:56,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:57:56,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:57:56,520 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 90 states. [2018-07-23 13:57:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:56,981 INFO L93 Difference]: Finished difference Result 270 states and 272 transitions. [2018-07-23 13:57:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:57:56,981 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-23 13:57:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:56,982 INFO L225 Difference]: With dead ends: 270 [2018-07-23 13:57:56,982 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 13:57:56,982 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:57:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 13:57:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-23 13:57:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 13:57:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-07-23 13:57:57,120 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 178 [2018-07-23 13:57:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:57,120 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-07-23 13:57:57,120 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:57:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-07-23 13:57:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 13:57:57,121 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:57,121 INFO L357 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2018-07-23 13:57:57,121 INFO L414 AbstractCegarLoop]: === Iteration 261 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash -493487955, now seen corresponding path program 258 times [2018-07-23 13:57:57,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:57,433 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:57,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:57:57,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:57,433 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:57:57,433 INFO L185 omatonBuilderFactory]: Interpolants [126081#(<= 33 Main_x), 126080#(<= 32 Main_x), 126083#(<= 35 Main_x), 126082#(<= 34 Main_x), 126085#(<= 37 Main_x), 126084#(<= 36 Main_x), 126087#(<= 39 Main_x), 126086#(<= 38 Main_x), 126089#(<= 41 Main_x), 126088#(<= 40 Main_x), 126091#(<= 43 Main_x), 126090#(<= 42 Main_x), 126093#(<= 45 Main_x), 126092#(<= 44 Main_x), 126095#(<= 47 Main_x), 126094#(<= 46 Main_x), 126097#(<= 49 Main_x), 126096#(<= 48 Main_x), 126099#(<= 51 Main_x), 126098#(<= 50 Main_x), 126101#(<= 53 Main_x), 126100#(<= 52 Main_x), 126103#(<= 55 Main_x), 126102#(<= 54 Main_x), 126105#(<= 57 Main_x), 126104#(<= 56 Main_x), 126107#(<= 59 Main_x), 126106#(<= 58 Main_x), 126109#(<= 61 Main_x), 126108#(<= 60 Main_x), 126111#(<= 63 Main_x), 126110#(<= 62 Main_x), 126113#(<= 65 Main_x), 126112#(<= 64 Main_x), 126115#(<= 67 Main_x), 126114#(<= 66 Main_x), 126117#(<= 69 Main_x), 126116#(<= 68 Main_x), 126119#(<= 71 Main_x), 126118#(<= 70 Main_x), 126121#(<= 73 Main_x), 126120#(<= 72 Main_x), 126123#(<= 75 Main_x), 126122#(<= 74 Main_x), 126125#(<= 77 Main_x), 126124#(<= 76 Main_x), 126127#(<= 79 Main_x), 126126#(<= 78 Main_x), 126129#(<= 81 Main_x), 126128#(<= 80 Main_x), 126131#(<= 83 Main_x), 126130#(<= 82 Main_x), 126133#(<= 85 Main_x), 126132#(<= 84 Main_x), 126135#(<= 87 Main_x), 126134#(<= 86 Main_x), 126047#false, 126046#true, 126049#(<= 1 Main_x), 126048#(<= 0 Main_x), 126051#(<= 3 Main_x), 126050#(<= 2 Main_x), 126053#(<= 5 Main_x), 126052#(<= 4 Main_x), 126055#(<= 7 Main_x), 126054#(<= 6 Main_x), 126057#(<= 9 Main_x), 126056#(<= 8 Main_x), 126059#(<= 11 Main_x), 126058#(<= 10 Main_x), 126061#(<= 13 Main_x), 126060#(<= 12 Main_x), 126063#(<= 15 Main_x), 126062#(<= 14 Main_x), 126065#(<= 17 Main_x), 126064#(<= 16 Main_x), 126067#(<= 19 Main_x), 126066#(<= 18 Main_x), 126069#(<= 21 Main_x), 126068#(<= 20 Main_x), 126071#(<= 23 Main_x), 126070#(<= 22 Main_x), 126073#(<= 25 Main_x), 126072#(<= 24 Main_x), 126075#(<= 27 Main_x), 126074#(<= 26 Main_x), 126077#(<= 29 Main_x), 126076#(<= 28 Main_x), 126079#(<= 31 Main_x), 126078#(<= 30 Main_x)] [2018-07-23 13:57:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3828 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:57,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:57:57,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:57:57,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:57:57,435 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-07-23 13:57:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:57,622 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-07-23 13:57:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:57:57,622 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-23 13:57:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:57,623 INFO L225 Difference]: With dead ends: 183 [2018-07-23 13:57:57,623 INFO L226 Difference]: Without dead ends: 180 [2018-07-23 13:57:57,623 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:57:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-23 13:57:57,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-23 13:57:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-23 13:57:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-07-23 13:57:57,766 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 178 [2018-07-23 13:57:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:57,766 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-07-23 13:57:57,767 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:57:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-07-23 13:57:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-23 13:57:57,767 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:57,767 INFO L357 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1] [2018-07-23 13:57:57,767 INFO L414 AbstractCegarLoop]: === Iteration 262 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1881681057, now seen corresponding path program 259 times [2018-07-23 13:57:57,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:58,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:58,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:57:58,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:58,251 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:57:58,251 INFO L185 omatonBuilderFactory]: Interpolants [126863#false, 126862#true, 126865#(and (<= 1 Main_y) (<= Main_y 1)), 126864#(and (<= 0 Main_y) (<= Main_y 0)), 126867#(and (<= Main_y 3) (<= 3 Main_y)), 126866#(and (<= Main_y 2) (<= 2 Main_y)), 126869#(and (<= Main_y 5) (<= 5 Main_y)), 126868#(and (<= Main_y 4) (<= 4 Main_y)), 126871#(and (<= 7 Main_y) (<= Main_y 7)), 126870#(and (<= Main_y 6) (<= 6 Main_y)), 126873#(and (<= Main_y 9) (<= 9 Main_y)), 126872#(and (<= 8 Main_y) (<= Main_y 8)), 126875#(and (<= 11 Main_y) (<= Main_y 11)), 126874#(and (<= 10 Main_y) (<= Main_y 10)), 126877#(and (<= 13 Main_y) (<= Main_y 13)), 126876#(and (<= 12 Main_y) (<= Main_y 12)), 126879#(and (<= Main_y 15) (<= 15 Main_y)), 126878#(and (<= 14 Main_y) (<= Main_y 14)), 126881#(and (<= Main_y 17) (<= 17 Main_y)), 126880#(and (<= 16 Main_y) (<= Main_y 16)), 126883#(and (<= Main_y 19) (<= 19 Main_y)), 126882#(and (<= Main_y 18) (<= 18 Main_y)), 126885#(and (<= 21 Main_y) (<= Main_y 21)), 126884#(and (<= 20 Main_y) (<= Main_y 20)), 126887#(and (<= 23 Main_y) (<= Main_y 23)), 126886#(and (<= Main_y 22) (<= 22 Main_y)), 126889#(and (<= 25 Main_y) (<= Main_y 25)), 126888#(and (<= Main_y 24) (<= 24 Main_y)), 126891#(and (<= 27 Main_y) (<= Main_y 27)), 126890#(and (<= Main_y 26) (<= 26 Main_y)), 126893#(and (<= 29 Main_y) (<= Main_y 29)), 126892#(and (<= 28 Main_y) (<= Main_y 28)), 126895#(and (<= Main_y 31) (<= 31 Main_y)), 126894#(and (<= 30 Main_y) (<= Main_y 30)), 126897#(and (<= 33 Main_y) (<= Main_y 33)), 126896#(and (<= 32 Main_y) (<= Main_y 32)), 126899#(and (<= 35 Main_y) (<= Main_y 35)), 126898#(and (<= Main_y 34) (<= 34 Main_y)), 126901#(and (<= Main_y 37) (<= 37 Main_y)), 126900#(and (<= 36 Main_y) (<= Main_y 36)), 126903#(and (<= 39 Main_y) (<= Main_y 39)), 126902#(and (<= Main_y 38) (<= 38 Main_y)), 126905#(and (<= Main_y 41) (<= 41 Main_y)), 126904#(and (<= 40 Main_y) (<= Main_y 40)), 126907#(and (<= 43 Main_y) (<= Main_y 43)), 126906#(and (<= 42 Main_y) (<= Main_y 42)), 126909#(and (<= Main_y 45) (<= 45 Main_y)), 126908#(and (<= 44 Main_y) (<= Main_y 44)), 126911#(and (<= 47 Main_y) (<= Main_y 47)), 126910#(and (<= 46 Main_y) (<= Main_y 46)), 126913#(and (<= 49 Main_y) (<= Main_y 49)), 126912#(and (<= 48 Main_y) (<= Main_y 48)), 126915#(and (<= 51 Main_y) (<= Main_y 51)), 126914#(and (<= 50 Main_y) (<= Main_y 50)), 126917#(and (<= 53 Main_y) (<= Main_y 53)), 126916#(and (<= 52 Main_y) (<= Main_y 52)), 126919#(and (<= 55 Main_y) (<= Main_y 55)), 126918#(and (<= 54 Main_y) (<= Main_y 54)), 126921#(and (<= Main_y 57) (<= 57 Main_y)), 126920#(and (<= Main_y 56) (<= 56 Main_y)), 126923#(and (<= Main_y 59) (<= 59 Main_y)), 126922#(and (<= Main_y 58) (<= 58 Main_y)), 126925#(and (<= Main_y 61) (<= 61 Main_y)), 126924#(and (<= Main_y 60) (<= 60 Main_y)), 126927#(and (<= 63 Main_y) (<= Main_y 63)), 126926#(and (<= 62 Main_y) (<= Main_y 62)), 126929#(and (<= Main_y 65) (<= 65 Main_y)), 126928#(and (<= 64 Main_y) (<= Main_y 64)), 126931#(and (<= 67 Main_y) (<= Main_y 67)), 126930#(and (<= Main_y 66) (<= 66 Main_y)), 126933#(and (<= Main_y 69) (<= 69 Main_y)), 126932#(and (<= 68 Main_y) (<= Main_y 68)), 126935#(and (<= Main_y 71) (<= 71 Main_y)), 126934#(and (<= 70 Main_y) (<= Main_y 70)), 126937#(and (<= 73 Main_y) (<= Main_y 73)), 126936#(and (<= 72 Main_y) (<= Main_y 72)), 126939#(and (<= Main_y 75) (<= 75 Main_y)), 126938#(and (<= 74 Main_y) (<= Main_y 74)), 126941#(and (<= Main_y 77) (<= 77 Main_y)), 126940#(and (<= Main_y 76) (<= 76 Main_y)), 126943#(and (<= 79 Main_y) (<= Main_y 79)), 126942#(and (<= Main_y 78) (<= 78 Main_y)), 126945#(and (<= 81 Main_y) (<= Main_y 81)), 126944#(and (<= Main_y 80) (<= 80 Main_y)), 126947#(and (<= Main_y 83) (<= 83 Main_y)), 126946#(and (<= Main_y 82) (<= 82 Main_y)), 126949#(and (<= Main_y 85) (<= 85 Main_y)), 126948#(and (<= Main_y 84) (<= 84 Main_y)), 126951#(and (<= Main_y 87) (<= 87 Main_y)), 126950#(and (<= 86 Main_y) (<= Main_y 86))] [2018-07-23 13:57:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:58,252 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:57:58,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:57:58,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:57:58,252 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 90 states. [2018-07-23 13:57:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:57:59,404 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-07-23 13:57:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:57:59,404 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 179 [2018-07-23 13:57:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:57:59,405 INFO L225 Difference]: With dead ends: 272 [2018-07-23 13:57:59,405 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 13:57:59,405 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:57:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 13:57:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 182. [2018-07-23 13:57:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-23 13:57:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-07-23 13:57:59,552 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 179 [2018-07-23 13:57:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:57:59,553 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-07-23 13:57:59,553 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:57:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-07-23 13:57:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 13:57:59,553 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:57:59,553 INFO L357 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2018-07-23 13:57:59,553 INFO L414 AbstractCegarLoop]: === Iteration 263 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:57:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1797490899, now seen corresponding path program 260 times [2018-07-23 13:57:59,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:57:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:57:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:59,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:57:59,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:57:59,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:57:59,847 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:57:59,848 INFO L185 omatonBuilderFactory]: Interpolants [127873#(<= Main_x 11), 127872#(<= Main_x 10), 127875#(<= Main_x 13), 127874#(<= Main_x 12), 127877#(<= Main_x 15), 127876#(<= Main_x 14), 127879#(<= Main_x 17), 127878#(<= Main_x 16), 127881#(<= Main_x 19), 127880#(<= Main_x 18), 127883#(<= Main_x 21), 127882#(<= Main_x 20), 127885#(<= Main_x 23), 127884#(<= Main_x 22), 127887#(<= Main_x 25), 127886#(<= Main_x 24), 127889#(<= Main_x 27), 127888#(<= Main_x 26), 127891#(<= Main_x 29), 127890#(<= Main_x 28), 127893#(<= Main_x 31), 127892#(<= Main_x 30), 127895#(<= Main_x 33), 127894#(<= Main_x 32), 127897#(<= Main_x 35), 127896#(<= Main_x 34), 127899#(<= Main_x 37), 127898#(<= Main_x 36), 127901#(<= Main_x 39), 127900#(<= Main_x 38), 127903#(<= Main_x 41), 127902#(<= Main_x 40), 127905#(<= Main_x 43), 127904#(<= Main_x 42), 127907#(<= Main_x 45), 127906#(<= Main_x 44), 127909#(<= Main_x 47), 127908#(<= Main_x 46), 127911#(<= Main_x 49), 127910#(<= Main_x 48), 127913#(<= Main_x 51), 127912#(<= Main_x 50), 127915#(<= Main_x 53), 127914#(<= Main_x 52), 127917#(<= Main_x 55), 127916#(<= Main_x 54), 127919#(<= Main_x 57), 127918#(<= Main_x 56), 127921#(<= Main_x 59), 127920#(<= Main_x 58), 127923#(<= Main_x 61), 127922#(<= Main_x 60), 127925#(<= Main_x 63), 127924#(<= Main_x 62), 127927#(<= Main_x 65), 127926#(<= Main_x 64), 127929#(<= Main_x 67), 127928#(<= Main_x 66), 127931#(<= Main_x 69), 127930#(<= Main_x 68), 127933#(<= Main_x 71), 127932#(<= Main_x 70), 127935#(<= Main_x 73), 127934#(<= Main_x 72), 127937#(<= Main_x 75), 127936#(<= Main_x 74), 127939#(<= Main_x 77), 127938#(<= Main_x 76), 127941#(<= Main_x 79), 127940#(<= Main_x 78), 127943#(<= Main_x 81), 127942#(<= Main_x 80), 127945#(<= Main_x 83), 127944#(<= Main_x 82), 127947#(<= Main_x 85), 127946#(<= Main_x 84), 127949#(<= Main_x 87), 127948#(<= Main_x 86), 127950#(<= (+ Main_x 1) 0), 127861#false, 127860#true, 127863#(<= Main_x 1), 127862#(<= Main_x 0), 127865#(<= Main_x 3), 127864#(<= Main_x 2), 127867#(<= Main_x 5), 127866#(<= Main_x 4), 127869#(<= Main_x 7), 127868#(<= Main_x 6), 127871#(<= Main_x 9), 127870#(<= Main_x 8)] [2018-07-23 13:57:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:57:59,848 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:57:59,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:57:59,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:57:59,849 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 91 states. [2018-07-23 13:58:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:00,270 INFO L93 Difference]: Finished difference Result 273 states and 275 transitions. [2018-07-23 13:58:00,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:58:00,270 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-23 13:58:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:00,270 INFO L225 Difference]: With dead ends: 273 [2018-07-23 13:58:00,270 INFO L226 Difference]: Without dead ends: 181 [2018-07-23 13:58:00,271 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:58:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-23 13:58:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-23 13:58:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 13:58:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-07-23 13:58:00,410 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 180 [2018-07-23 13:58:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-07-23 13:58:00,411 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:58:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-07-23 13:58:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 13:58:00,411 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:00,411 INFO L357 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2018-07-23 13:58:00,411 INFO L414 AbstractCegarLoop]: === Iteration 264 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1255253305, now seen corresponding path program 261 times [2018-07-23 13:58:00,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:00,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:00,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:58:00,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:00,744 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:58:00,745 INFO L185 omatonBuilderFactory]: Interpolants [128897#(<= 36 Main_x), 128896#(<= 35 Main_x), 128899#(<= 38 Main_x), 128898#(<= 37 Main_x), 128901#(<= 40 Main_x), 128900#(<= 39 Main_x), 128903#(<= 42 Main_x), 128902#(<= 41 Main_x), 128905#(<= 44 Main_x), 128904#(<= 43 Main_x), 128907#(<= 46 Main_x), 128906#(<= 45 Main_x), 128909#(<= 48 Main_x), 128908#(<= 47 Main_x), 128911#(<= 50 Main_x), 128910#(<= 49 Main_x), 128913#(<= 52 Main_x), 128912#(<= 51 Main_x), 128915#(<= 54 Main_x), 128914#(<= 53 Main_x), 128917#(<= 56 Main_x), 128916#(<= 55 Main_x), 128919#(<= 58 Main_x), 128918#(<= 57 Main_x), 128921#(<= 60 Main_x), 128920#(<= 59 Main_x), 128923#(<= 62 Main_x), 128922#(<= 61 Main_x), 128925#(<= 64 Main_x), 128924#(<= 63 Main_x), 128927#(<= 66 Main_x), 128926#(<= 65 Main_x), 128929#(<= 68 Main_x), 128928#(<= 67 Main_x), 128931#(<= 70 Main_x), 128930#(<= 69 Main_x), 128933#(<= 72 Main_x), 128932#(<= 71 Main_x), 128935#(<= 74 Main_x), 128934#(<= 73 Main_x), 128937#(<= 76 Main_x), 128936#(<= 75 Main_x), 128939#(<= 78 Main_x), 128938#(<= 77 Main_x), 128941#(<= 80 Main_x), 128940#(<= 79 Main_x), 128943#(<= 82 Main_x), 128942#(<= 81 Main_x), 128945#(<= 84 Main_x), 128944#(<= 83 Main_x), 128947#(<= 86 Main_x), 128946#(<= 85 Main_x), 128949#(<= 88 Main_x), 128948#(<= 87 Main_x), 128859#true, 128861#(<= 0 Main_x), 128860#false, 128863#(<= 2 Main_x), 128862#(<= 1 Main_x), 128865#(<= 4 Main_x), 128864#(<= 3 Main_x), 128867#(<= 6 Main_x), 128866#(<= 5 Main_x), 128869#(<= 8 Main_x), 128868#(<= 7 Main_x), 128871#(<= 10 Main_x), 128870#(<= 9 Main_x), 128873#(<= 12 Main_x), 128872#(<= 11 Main_x), 128875#(<= 14 Main_x), 128874#(<= 13 Main_x), 128877#(<= 16 Main_x), 128876#(<= 15 Main_x), 128879#(<= 18 Main_x), 128878#(<= 17 Main_x), 128881#(<= 20 Main_x), 128880#(<= 19 Main_x), 128883#(<= 22 Main_x), 128882#(<= 21 Main_x), 128885#(<= 24 Main_x), 128884#(<= 23 Main_x), 128887#(<= 26 Main_x), 128886#(<= 25 Main_x), 128889#(<= 28 Main_x), 128888#(<= 27 Main_x), 128891#(<= 30 Main_x), 128890#(<= 29 Main_x), 128893#(<= 32 Main_x), 128892#(<= 31 Main_x), 128895#(<= 34 Main_x), 128894#(<= 33 Main_x)] [2018-07-23 13:58:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:00,745 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:58:00,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:58:00,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:58:00,746 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-07-23 13:58:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:00,969 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-07-23 13:58:00,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:58:00,969 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-23 13:58:00,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:00,970 INFO L225 Difference]: With dead ends: 185 [2018-07-23 13:58:00,970 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 13:58:00,971 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:58:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 13:58:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-23 13:58:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-23 13:58:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 183 transitions. [2018-07-23 13:58:01,119 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 183 transitions. Word has length 180 [2018-07-23 13:58:01,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:01,119 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 183 transitions. [2018-07-23 13:58:01,119 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:58:01,119 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 183 transitions. [2018-07-23 13:58:01,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-23 13:58:01,119 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:01,120 INFO L357 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1] [2018-07-23 13:58:01,120 INFO L414 AbstractCegarLoop]: === Iteration 265 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:01,120 INFO L82 PathProgramCache]: Analyzing trace with hash -258208313, now seen corresponding path program 262 times [2018-07-23 13:58:01,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:01,608 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:01,608 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:58:01,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:01,609 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:58:01,609 INFO L185 omatonBuilderFactory]: Interpolants [129685#false, 129684#true, 129687#(and (<= 1 Main_y) (<= Main_y 1)), 129686#(and (<= 0 Main_y) (<= Main_y 0)), 129689#(and (<= Main_y 3) (<= 3 Main_y)), 129688#(and (<= Main_y 2) (<= 2 Main_y)), 129691#(and (<= Main_y 5) (<= 5 Main_y)), 129690#(and (<= Main_y 4) (<= 4 Main_y)), 129693#(and (<= 7 Main_y) (<= Main_y 7)), 129692#(and (<= Main_y 6) (<= 6 Main_y)), 129695#(and (<= Main_y 9) (<= 9 Main_y)), 129694#(and (<= 8 Main_y) (<= Main_y 8)), 129697#(and (<= 11 Main_y) (<= Main_y 11)), 129696#(and (<= 10 Main_y) (<= Main_y 10)), 129699#(and (<= 13 Main_y) (<= Main_y 13)), 129698#(and (<= 12 Main_y) (<= Main_y 12)), 129701#(and (<= Main_y 15) (<= 15 Main_y)), 129700#(and (<= 14 Main_y) (<= Main_y 14)), 129703#(and (<= Main_y 17) (<= 17 Main_y)), 129702#(and (<= 16 Main_y) (<= Main_y 16)), 129705#(and (<= Main_y 19) (<= 19 Main_y)), 129704#(and (<= Main_y 18) (<= 18 Main_y)), 129707#(and (<= 21 Main_y) (<= Main_y 21)), 129706#(and (<= 20 Main_y) (<= Main_y 20)), 129709#(and (<= 23 Main_y) (<= Main_y 23)), 129708#(and (<= Main_y 22) (<= 22 Main_y)), 129711#(and (<= 25 Main_y) (<= Main_y 25)), 129710#(and (<= Main_y 24) (<= 24 Main_y)), 129713#(and (<= 27 Main_y) (<= Main_y 27)), 129712#(and (<= Main_y 26) (<= 26 Main_y)), 129715#(and (<= 29 Main_y) (<= Main_y 29)), 129714#(and (<= 28 Main_y) (<= Main_y 28)), 129717#(and (<= Main_y 31) (<= 31 Main_y)), 129716#(and (<= 30 Main_y) (<= Main_y 30)), 129719#(and (<= 33 Main_y) (<= Main_y 33)), 129718#(and (<= 32 Main_y) (<= Main_y 32)), 129721#(and (<= 35 Main_y) (<= Main_y 35)), 129720#(and (<= Main_y 34) (<= 34 Main_y)), 129723#(and (<= Main_y 37) (<= 37 Main_y)), 129722#(and (<= 36 Main_y) (<= Main_y 36)), 129725#(and (<= 39 Main_y) (<= Main_y 39)), 129724#(and (<= Main_y 38) (<= 38 Main_y)), 129727#(and (<= Main_y 41) (<= 41 Main_y)), 129726#(and (<= 40 Main_y) (<= Main_y 40)), 129729#(and (<= 43 Main_y) (<= Main_y 43)), 129728#(and (<= 42 Main_y) (<= Main_y 42)), 129731#(and (<= Main_y 45) (<= 45 Main_y)), 129730#(and (<= 44 Main_y) (<= Main_y 44)), 129733#(and (<= 47 Main_y) (<= Main_y 47)), 129732#(and (<= 46 Main_y) (<= Main_y 46)), 129735#(and (<= 49 Main_y) (<= Main_y 49)), 129734#(and (<= 48 Main_y) (<= Main_y 48)), 129737#(and (<= 51 Main_y) (<= Main_y 51)), 129736#(and (<= 50 Main_y) (<= Main_y 50)), 129739#(and (<= 53 Main_y) (<= Main_y 53)), 129738#(and (<= 52 Main_y) (<= Main_y 52)), 129741#(and (<= 55 Main_y) (<= Main_y 55)), 129740#(and (<= 54 Main_y) (<= Main_y 54)), 129743#(and (<= Main_y 57) (<= 57 Main_y)), 129742#(and (<= Main_y 56) (<= 56 Main_y)), 129745#(and (<= Main_y 59) (<= 59 Main_y)), 129744#(and (<= Main_y 58) (<= 58 Main_y)), 129747#(and (<= Main_y 61) (<= 61 Main_y)), 129746#(and (<= Main_y 60) (<= 60 Main_y)), 129749#(and (<= 63 Main_y) (<= Main_y 63)), 129748#(and (<= 62 Main_y) (<= Main_y 62)), 129751#(and (<= Main_y 65) (<= 65 Main_y)), 129750#(and (<= 64 Main_y) (<= Main_y 64)), 129753#(and (<= 67 Main_y) (<= Main_y 67)), 129752#(and (<= Main_y 66) (<= 66 Main_y)), 129755#(and (<= Main_y 69) (<= 69 Main_y)), 129754#(and (<= 68 Main_y) (<= Main_y 68)), 129757#(and (<= Main_y 71) (<= 71 Main_y)), 129756#(and (<= 70 Main_y) (<= Main_y 70)), 129759#(and (<= 73 Main_y) (<= Main_y 73)), 129758#(and (<= 72 Main_y) (<= Main_y 72)), 129761#(and (<= Main_y 75) (<= 75 Main_y)), 129760#(and (<= 74 Main_y) (<= Main_y 74)), 129763#(and (<= Main_y 77) (<= 77 Main_y)), 129762#(and (<= Main_y 76) (<= 76 Main_y)), 129765#(and (<= 79 Main_y) (<= Main_y 79)), 129764#(and (<= Main_y 78) (<= 78 Main_y)), 129767#(and (<= 81 Main_y) (<= Main_y 81)), 129766#(and (<= Main_y 80) (<= 80 Main_y)), 129769#(and (<= Main_y 83) (<= 83 Main_y)), 129768#(and (<= Main_y 82) (<= 82 Main_y)), 129771#(and (<= Main_y 85) (<= 85 Main_y)), 129770#(and (<= Main_y 84) (<= 84 Main_y)), 129773#(and (<= Main_y 87) (<= 87 Main_y)), 129772#(and (<= 86 Main_y) (<= Main_y 86)), 129774#(and (<= Main_y 88) (<= 88 Main_y))] [2018-07-23 13:58:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:01,610 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:58:01,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:58:01,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:58:01,610 INFO L87 Difference]: Start difference. First operand 182 states and 183 transitions. Second operand 91 states. [2018-07-23 13:58:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:02,775 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2018-07-23 13:58:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:58:02,776 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 181 [2018-07-23 13:58:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:02,776 INFO L225 Difference]: With dead ends: 275 [2018-07-23 13:58:02,776 INFO L226 Difference]: Without dead ends: 272 [2018-07-23 13:58:02,776 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:58:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-07-23 13:58:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 184. [2018-07-23 13:58:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-23 13:58:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2018-07-23 13:58:02,930 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 181 [2018-07-23 13:58:02,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:02,931 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2018-07-23 13:58:02,931 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:58:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2018-07-23 13:58:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-23 13:58:02,931 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:02,931 INFO L357 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2018-07-23 13:58:02,931 INFO L414 AbstractCegarLoop]: === Iteration 266 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash 585415367, now seen corresponding path program 263 times [2018-07-23 13:58:02,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:03,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:03,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:58:03,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:03,233 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:58:03,233 INFO L185 omatonBuilderFactory]: Interpolants [130693#true, 130695#(<= Main_x 0), 130694#false, 130697#(<= Main_x 2), 130696#(<= Main_x 1), 130699#(<= Main_x 4), 130698#(<= Main_x 3), 130701#(<= Main_x 6), 130700#(<= Main_x 5), 130703#(<= Main_x 8), 130702#(<= Main_x 7), 130705#(<= Main_x 10), 130704#(<= Main_x 9), 130707#(<= Main_x 12), 130706#(<= Main_x 11), 130709#(<= Main_x 14), 130708#(<= Main_x 13), 130711#(<= Main_x 16), 130710#(<= Main_x 15), 130713#(<= Main_x 18), 130712#(<= Main_x 17), 130715#(<= Main_x 20), 130714#(<= Main_x 19), 130717#(<= Main_x 22), 130716#(<= Main_x 21), 130719#(<= Main_x 24), 130718#(<= Main_x 23), 130721#(<= Main_x 26), 130720#(<= Main_x 25), 130723#(<= Main_x 28), 130722#(<= Main_x 27), 130725#(<= Main_x 30), 130724#(<= Main_x 29), 130727#(<= Main_x 32), 130726#(<= Main_x 31), 130729#(<= Main_x 34), 130728#(<= Main_x 33), 130731#(<= Main_x 36), 130730#(<= Main_x 35), 130733#(<= Main_x 38), 130732#(<= Main_x 37), 130735#(<= Main_x 40), 130734#(<= Main_x 39), 130737#(<= Main_x 42), 130736#(<= Main_x 41), 130739#(<= Main_x 44), 130738#(<= Main_x 43), 130741#(<= Main_x 46), 130740#(<= Main_x 45), 130743#(<= Main_x 48), 130742#(<= Main_x 47), 130745#(<= Main_x 50), 130744#(<= Main_x 49), 130747#(<= Main_x 52), 130746#(<= Main_x 51), 130749#(<= Main_x 54), 130748#(<= Main_x 53), 130751#(<= Main_x 56), 130750#(<= Main_x 55), 130753#(<= Main_x 58), 130752#(<= Main_x 57), 130755#(<= Main_x 60), 130754#(<= Main_x 59), 130757#(<= Main_x 62), 130756#(<= Main_x 61), 130759#(<= Main_x 64), 130758#(<= Main_x 63), 130761#(<= Main_x 66), 130760#(<= Main_x 65), 130763#(<= Main_x 68), 130762#(<= Main_x 67), 130765#(<= Main_x 70), 130764#(<= Main_x 69), 130767#(<= Main_x 72), 130766#(<= Main_x 71), 130769#(<= Main_x 74), 130768#(<= Main_x 73), 130771#(<= Main_x 76), 130770#(<= Main_x 75), 130773#(<= Main_x 78), 130772#(<= Main_x 77), 130775#(<= Main_x 80), 130774#(<= Main_x 79), 130777#(<= Main_x 82), 130776#(<= Main_x 81), 130779#(<= Main_x 84), 130778#(<= Main_x 83), 130781#(<= Main_x 86), 130780#(<= Main_x 85), 130783#(<= Main_x 88), 130782#(<= Main_x 87), 130784#(<= (+ Main_x 1) 0)] [2018-07-23 13:58:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:03,233 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:58:03,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:58:03,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:58:03,234 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 92 states. [2018-07-23 13:58:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:03,717 INFO L93 Difference]: Finished difference Result 276 states and 278 transitions. [2018-07-23 13:58:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:58:03,717 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-23 13:58:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:03,717 INFO L225 Difference]: With dead ends: 276 [2018-07-23 13:58:03,717 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 13:58:03,718 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:58:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 13:58:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-23 13:58:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 13:58:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-07-23 13:58:03,874 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 182 [2018-07-23 13:58:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:03,874 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-07-23 13:58:03,874 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:58:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-07-23 13:58:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-23 13:58:03,875 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:03,875 INFO L357 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2018-07-23 13:58:03,875 INFO L414 AbstractCegarLoop]: === Iteration 267 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:03,875 INFO L82 PathProgramCache]: Analyzing trace with hash 214911597, now seen corresponding path program 264 times [2018-07-23 13:58:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:04,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:04,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:58:04,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:04,258 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:58:04,258 INFO L185 omatonBuilderFactory]: Interpolants [131714#(<= 9 Main_x), 131715#(<= 10 Main_x), 131712#(<= 7 Main_x), 131713#(<= 8 Main_x), 131718#(<= 13 Main_x), 131719#(<= 14 Main_x), 131716#(<= 11 Main_x), 131717#(<= 12 Main_x), 131722#(<= 17 Main_x), 131723#(<= 18 Main_x), 131720#(<= 15 Main_x), 131721#(<= 16 Main_x), 131726#(<= 21 Main_x), 131727#(<= 22 Main_x), 131724#(<= 19 Main_x), 131725#(<= 20 Main_x), 131730#(<= 25 Main_x), 131731#(<= 26 Main_x), 131728#(<= 23 Main_x), 131729#(<= 24 Main_x), 131734#(<= 29 Main_x), 131735#(<= 30 Main_x), 131732#(<= 27 Main_x), 131733#(<= 28 Main_x), 131738#(<= 33 Main_x), 131739#(<= 34 Main_x), 131736#(<= 31 Main_x), 131737#(<= 32 Main_x), 131742#(<= 37 Main_x), 131743#(<= 38 Main_x), 131740#(<= 35 Main_x), 131741#(<= 36 Main_x), 131746#(<= 41 Main_x), 131747#(<= 42 Main_x), 131744#(<= 39 Main_x), 131745#(<= 40 Main_x), 131750#(<= 45 Main_x), 131751#(<= 46 Main_x), 131748#(<= 43 Main_x), 131749#(<= 44 Main_x), 131754#(<= 49 Main_x), 131755#(<= 50 Main_x), 131752#(<= 47 Main_x), 131753#(<= 48 Main_x), 131758#(<= 53 Main_x), 131759#(<= 54 Main_x), 131756#(<= 51 Main_x), 131757#(<= 52 Main_x), 131762#(<= 57 Main_x), 131763#(<= 58 Main_x), 131760#(<= 55 Main_x), 131761#(<= 56 Main_x), 131766#(<= 61 Main_x), 131767#(<= 62 Main_x), 131764#(<= 59 Main_x), 131765#(<= 60 Main_x), 131770#(<= 65 Main_x), 131771#(<= 66 Main_x), 131768#(<= 63 Main_x), 131769#(<= 64 Main_x), 131774#(<= 69 Main_x), 131775#(<= 70 Main_x), 131772#(<= 67 Main_x), 131773#(<= 68 Main_x), 131778#(<= 73 Main_x), 131779#(<= 74 Main_x), 131776#(<= 71 Main_x), 131777#(<= 72 Main_x), 131782#(<= 77 Main_x), 131783#(<= 78 Main_x), 131780#(<= 75 Main_x), 131781#(<= 76 Main_x), 131786#(<= 81 Main_x), 131787#(<= 82 Main_x), 131784#(<= 79 Main_x), 131785#(<= 80 Main_x), 131790#(<= 85 Main_x), 131791#(<= 86 Main_x), 131788#(<= 83 Main_x), 131789#(<= 84 Main_x), 131794#(<= 89 Main_x), 131792#(<= 87 Main_x), 131793#(<= 88 Main_x), 131703#true, 131706#(<= 1 Main_x), 131707#(<= 2 Main_x), 131704#false, 131705#(<= 0 Main_x), 131710#(<= 5 Main_x), 131711#(<= 6 Main_x), 131708#(<= 3 Main_x), 131709#(<= 4 Main_x)] [2018-07-23 13:58:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 4005 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:04,258 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:58:04,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:58:04,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:58:04,259 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-07-23 13:58:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:04,446 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-07-23 13:58:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:58:04,447 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-23 13:58:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:04,447 INFO L225 Difference]: With dead ends: 187 [2018-07-23 13:58:04,447 INFO L226 Difference]: Without dead ends: 184 [2018-07-23 13:58:04,448 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:58:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-23 13:58:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-23 13:58:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-23 13:58:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-07-23 13:58:04,594 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 182 [2018-07-23 13:58:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:04,594 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-07-23 13:58:04,594 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:58:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-07-23 13:58:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-23 13:58:04,595 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:04,595 INFO L357 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1] [2018-07-23 13:58:04,595 INFO L414 AbstractCegarLoop]: === Iteration 268 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1927736607, now seen corresponding path program 265 times [2018-07-23 13:58:04,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:05,081 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:05,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:58:05,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:05,081 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:58:05,081 INFO L185 omatonBuilderFactory]: Interpolants [132610#(and (<= Main_y 71) (<= 71 Main_y)), 132611#(and (<= 72 Main_y) (<= Main_y 72)), 132608#(and (<= Main_y 69) (<= 69 Main_y)), 132609#(and (<= 70 Main_y) (<= Main_y 70)), 132614#(and (<= Main_y 75) (<= 75 Main_y)), 132615#(and (<= Main_y 76) (<= 76 Main_y)), 132612#(and (<= 73 Main_y) (<= Main_y 73)), 132613#(and (<= 74 Main_y) (<= Main_y 74)), 132618#(and (<= 79 Main_y) (<= Main_y 79)), 132619#(and (<= Main_y 80) (<= 80 Main_y)), 132616#(and (<= Main_y 77) (<= 77 Main_y)), 132617#(and (<= Main_y 78) (<= 78 Main_y)), 132622#(and (<= Main_y 83) (<= 83 Main_y)), 132623#(and (<= Main_y 84) (<= 84 Main_y)), 132620#(and (<= 81 Main_y) (<= Main_y 81)), 132621#(and (<= Main_y 82) (<= 82 Main_y)), 132626#(and (<= Main_y 87) (<= 87 Main_y)), 132627#(and (<= Main_y 88) (<= 88 Main_y)), 132624#(and (<= Main_y 85) (<= 85 Main_y)), 132625#(and (<= 86 Main_y) (<= Main_y 86)), 132628#(and (<= Main_y 89) (<= 89 Main_y)), 132538#false, 132539#(and (<= 0 Main_y) (<= Main_y 0)), 132537#true, 132542#(and (<= Main_y 3) (<= 3 Main_y)), 132543#(and (<= Main_y 4) (<= 4 Main_y)), 132540#(and (<= 1 Main_y) (<= Main_y 1)), 132541#(and (<= Main_y 2) (<= 2 Main_y)), 132546#(and (<= 7 Main_y) (<= Main_y 7)), 132547#(and (<= 8 Main_y) (<= Main_y 8)), 132544#(and (<= Main_y 5) (<= 5 Main_y)), 132545#(and (<= Main_y 6) (<= 6 Main_y)), 132550#(and (<= 11 Main_y) (<= Main_y 11)), 132551#(and (<= 12 Main_y) (<= Main_y 12)), 132548#(and (<= Main_y 9) (<= 9 Main_y)), 132549#(and (<= 10 Main_y) (<= Main_y 10)), 132554#(and (<= Main_y 15) (<= 15 Main_y)), 132555#(and (<= 16 Main_y) (<= Main_y 16)), 132552#(and (<= 13 Main_y) (<= Main_y 13)), 132553#(and (<= 14 Main_y) (<= Main_y 14)), 132558#(and (<= Main_y 19) (<= 19 Main_y)), 132559#(and (<= 20 Main_y) (<= Main_y 20)), 132556#(and (<= Main_y 17) (<= 17 Main_y)), 132557#(and (<= Main_y 18) (<= 18 Main_y)), 132562#(and (<= 23 Main_y) (<= Main_y 23)), 132563#(and (<= Main_y 24) (<= 24 Main_y)), 132560#(and (<= 21 Main_y) (<= Main_y 21)), 132561#(and (<= Main_y 22) (<= 22 Main_y)), 132566#(and (<= 27 Main_y) (<= Main_y 27)), 132567#(and (<= 28 Main_y) (<= Main_y 28)), 132564#(and (<= 25 Main_y) (<= Main_y 25)), 132565#(and (<= Main_y 26) (<= 26 Main_y)), 132570#(and (<= Main_y 31) (<= 31 Main_y)), 132571#(and (<= 32 Main_y) (<= Main_y 32)), 132568#(and (<= 29 Main_y) (<= Main_y 29)), 132569#(and (<= 30 Main_y) (<= Main_y 30)), 132574#(and (<= 35 Main_y) (<= Main_y 35)), 132575#(and (<= 36 Main_y) (<= Main_y 36)), 132572#(and (<= 33 Main_y) (<= Main_y 33)), 132573#(and (<= Main_y 34) (<= 34 Main_y)), 132578#(and (<= 39 Main_y) (<= Main_y 39)), 132579#(and (<= 40 Main_y) (<= Main_y 40)), 132576#(and (<= Main_y 37) (<= 37 Main_y)), 132577#(and (<= Main_y 38) (<= 38 Main_y)), 132582#(and (<= 43 Main_y) (<= Main_y 43)), 132583#(and (<= 44 Main_y) (<= Main_y 44)), 132580#(and (<= Main_y 41) (<= 41 Main_y)), 132581#(and (<= 42 Main_y) (<= Main_y 42)), 132586#(and (<= 47 Main_y) (<= Main_y 47)), 132587#(and (<= 48 Main_y) (<= Main_y 48)), 132584#(and (<= Main_y 45) (<= 45 Main_y)), 132585#(and (<= 46 Main_y) (<= Main_y 46)), 132590#(and (<= 51 Main_y) (<= Main_y 51)), 132591#(and (<= 52 Main_y) (<= Main_y 52)), 132588#(and (<= 49 Main_y) (<= Main_y 49)), 132589#(and (<= 50 Main_y) (<= Main_y 50)), 132594#(and (<= 55 Main_y) (<= Main_y 55)), 132595#(and (<= Main_y 56) (<= 56 Main_y)), 132592#(and (<= 53 Main_y) (<= Main_y 53)), 132593#(and (<= 54 Main_y) (<= Main_y 54)), 132598#(and (<= Main_y 59) (<= 59 Main_y)), 132599#(and (<= Main_y 60) (<= 60 Main_y)), 132596#(and (<= Main_y 57) (<= 57 Main_y)), 132597#(and (<= Main_y 58) (<= 58 Main_y)), 132602#(and (<= 63 Main_y) (<= Main_y 63)), 132603#(and (<= 64 Main_y) (<= Main_y 64)), 132600#(and (<= Main_y 61) (<= 61 Main_y)), 132601#(and (<= 62 Main_y) (<= Main_y 62)), 132606#(and (<= 67 Main_y) (<= Main_y 67)), 132607#(and (<= 68 Main_y) (<= Main_y 68)), 132604#(and (<= Main_y 65) (<= 65 Main_y)), 132605#(and (<= Main_y 66) (<= 66 Main_y))] [2018-07-23 13:58:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:05,082 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:58:05,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:58:05,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:58:05,083 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 92 states. [2018-07-23 13:58:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:06,266 INFO L93 Difference]: Finished difference Result 278 states and 280 transitions. [2018-07-23 13:58:06,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:58:06,266 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 183 [2018-07-23 13:58:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:06,267 INFO L225 Difference]: With dead ends: 278 [2018-07-23 13:58:06,267 INFO L226 Difference]: Without dead ends: 275 [2018-07-23 13:58:06,267 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:58:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-23 13:58:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2018-07-23 13:58:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-23 13:58:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-07-23 13:58:06,417 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 183 [2018-07-23 13:58:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:06,417 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-07-23 13:58:06,417 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:58:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-07-23 13:58:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 13:58:06,417 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:06,417 INFO L357 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2018-07-23 13:58:06,418 INFO L414 AbstractCegarLoop]: === Iteration 269 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:06,418 INFO L82 PathProgramCache]: Analyzing trace with hash 369645805, now seen corresponding path program 266 times [2018-07-23 13:58:06,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:06,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:06,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:58:06,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:06,783 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:58:06,783 INFO L185 omatonBuilderFactory]: Interpolants [133634#(<= Main_x 75), 133635#(<= Main_x 76), 133632#(<= Main_x 73), 133633#(<= Main_x 74), 133638#(<= Main_x 79), 133639#(<= Main_x 80), 133636#(<= Main_x 77), 133637#(<= Main_x 78), 133642#(<= Main_x 83), 133643#(<= Main_x 84), 133640#(<= Main_x 81), 133641#(<= Main_x 82), 133646#(<= Main_x 87), 133647#(<= Main_x 88), 133644#(<= Main_x 85), 133645#(<= Main_x 86), 133648#(<= Main_x 89), 133649#(<= (+ Main_x 1) 0), 133558#false, 133559#(<= Main_x 0), 133557#true, 133562#(<= Main_x 3), 133563#(<= Main_x 4), 133560#(<= Main_x 1), 133561#(<= Main_x 2), 133566#(<= Main_x 7), 133567#(<= Main_x 8), 133564#(<= Main_x 5), 133565#(<= Main_x 6), 133570#(<= Main_x 11), 133571#(<= Main_x 12), 133568#(<= Main_x 9), 133569#(<= Main_x 10), 133574#(<= Main_x 15), 133575#(<= Main_x 16), 133572#(<= Main_x 13), 133573#(<= Main_x 14), 133578#(<= Main_x 19), 133579#(<= Main_x 20), 133576#(<= Main_x 17), 133577#(<= Main_x 18), 133582#(<= Main_x 23), 133583#(<= Main_x 24), 133580#(<= Main_x 21), 133581#(<= Main_x 22), 133586#(<= Main_x 27), 133587#(<= Main_x 28), 133584#(<= Main_x 25), 133585#(<= Main_x 26), 133590#(<= Main_x 31), 133591#(<= Main_x 32), 133588#(<= Main_x 29), 133589#(<= Main_x 30), 133594#(<= Main_x 35), 133595#(<= Main_x 36), 133592#(<= Main_x 33), 133593#(<= Main_x 34), 133598#(<= Main_x 39), 133599#(<= Main_x 40), 133596#(<= Main_x 37), 133597#(<= Main_x 38), 133602#(<= Main_x 43), 133603#(<= Main_x 44), 133600#(<= Main_x 41), 133601#(<= Main_x 42), 133606#(<= Main_x 47), 133607#(<= Main_x 48), 133604#(<= Main_x 45), 133605#(<= Main_x 46), 133610#(<= Main_x 51), 133611#(<= Main_x 52), 133608#(<= Main_x 49), 133609#(<= Main_x 50), 133614#(<= Main_x 55), 133615#(<= Main_x 56), 133612#(<= Main_x 53), 133613#(<= Main_x 54), 133618#(<= Main_x 59), 133619#(<= Main_x 60), 133616#(<= Main_x 57), 133617#(<= Main_x 58), 133622#(<= Main_x 63), 133623#(<= Main_x 64), 133620#(<= Main_x 61), 133621#(<= Main_x 62), 133626#(<= Main_x 67), 133627#(<= Main_x 68), 133624#(<= Main_x 65), 133625#(<= Main_x 66), 133630#(<= Main_x 71), 133631#(<= Main_x 72), 133628#(<= Main_x 69), 133629#(<= Main_x 70)] [2018-07-23 13:58:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:06,784 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:58:06,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:58:06,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:58:06,785 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 93 states. [2018-07-23 13:58:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:07,277 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2018-07-23 13:58:07,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:58:07,277 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-23 13:58:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:07,277 INFO L225 Difference]: With dead ends: 279 [2018-07-23 13:58:07,277 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 13:58:07,278 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:58:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 13:58:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 13:58:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 13:58:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-07-23 13:58:07,445 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 184 [2018-07-23 13:58:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:07,445 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-07-23 13:58:07,445 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:58:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-07-23 13:58:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 13:58:07,446 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:07,446 INFO L357 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2018-07-23 13:58:07,446 INFO L414 AbstractCegarLoop]: === Iteration 270 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1768930823, now seen corresponding path program 267 times [2018-07-23 13:58:07,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:07,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:07,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:58:07,858 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:07,858 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:58:07,858 INFO L185 omatonBuilderFactory]: Interpolants [134658#(<= 78 Main_x), 134659#(<= 79 Main_x), 134656#(<= 76 Main_x), 134657#(<= 77 Main_x), 134662#(<= 82 Main_x), 134663#(<= 83 Main_x), 134660#(<= 80 Main_x), 134661#(<= 81 Main_x), 134666#(<= 86 Main_x), 134667#(<= 87 Main_x), 134664#(<= 84 Main_x), 134665#(<= 85 Main_x), 134670#(<= 90 Main_x), 134668#(<= 88 Main_x), 134669#(<= 89 Main_x), 134578#true, 134579#false, 134582#(<= 2 Main_x), 134583#(<= 3 Main_x), 134580#(<= 0 Main_x), 134581#(<= 1 Main_x), 134586#(<= 6 Main_x), 134587#(<= 7 Main_x), 134584#(<= 4 Main_x), 134585#(<= 5 Main_x), 134590#(<= 10 Main_x), 134591#(<= 11 Main_x), 134588#(<= 8 Main_x), 134589#(<= 9 Main_x), 134594#(<= 14 Main_x), 134595#(<= 15 Main_x), 134592#(<= 12 Main_x), 134593#(<= 13 Main_x), 134598#(<= 18 Main_x), 134599#(<= 19 Main_x), 134596#(<= 16 Main_x), 134597#(<= 17 Main_x), 134602#(<= 22 Main_x), 134603#(<= 23 Main_x), 134600#(<= 20 Main_x), 134601#(<= 21 Main_x), 134606#(<= 26 Main_x), 134607#(<= 27 Main_x), 134604#(<= 24 Main_x), 134605#(<= 25 Main_x), 134610#(<= 30 Main_x), 134611#(<= 31 Main_x), 134608#(<= 28 Main_x), 134609#(<= 29 Main_x), 134614#(<= 34 Main_x), 134615#(<= 35 Main_x), 134612#(<= 32 Main_x), 134613#(<= 33 Main_x), 134618#(<= 38 Main_x), 134619#(<= 39 Main_x), 134616#(<= 36 Main_x), 134617#(<= 37 Main_x), 134622#(<= 42 Main_x), 134623#(<= 43 Main_x), 134620#(<= 40 Main_x), 134621#(<= 41 Main_x), 134626#(<= 46 Main_x), 134627#(<= 47 Main_x), 134624#(<= 44 Main_x), 134625#(<= 45 Main_x), 134630#(<= 50 Main_x), 134631#(<= 51 Main_x), 134628#(<= 48 Main_x), 134629#(<= 49 Main_x), 134634#(<= 54 Main_x), 134635#(<= 55 Main_x), 134632#(<= 52 Main_x), 134633#(<= 53 Main_x), 134638#(<= 58 Main_x), 134639#(<= 59 Main_x), 134636#(<= 56 Main_x), 134637#(<= 57 Main_x), 134642#(<= 62 Main_x), 134643#(<= 63 Main_x), 134640#(<= 60 Main_x), 134641#(<= 61 Main_x), 134646#(<= 66 Main_x), 134647#(<= 67 Main_x), 134644#(<= 64 Main_x), 134645#(<= 65 Main_x), 134650#(<= 70 Main_x), 134651#(<= 71 Main_x), 134648#(<= 68 Main_x), 134649#(<= 69 Main_x), 134654#(<= 74 Main_x), 134655#(<= 75 Main_x), 134652#(<= 72 Main_x), 134653#(<= 73 Main_x)] [2018-07-23 13:58:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:07,859 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:58:07,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:58:07,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:58:07,860 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-07-23 13:58:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:08,105 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-07-23 13:58:08,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:58:08,105 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-23 13:58:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:08,106 INFO L225 Difference]: With dead ends: 189 [2018-07-23 13:58:08,106 INFO L226 Difference]: Without dead ends: 186 [2018-07-23 13:58:08,106 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:58:08,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-23 13:58:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-23 13:58:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-23 13:58:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-07-23 13:58:08,273 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 184 [2018-07-23 13:58:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:08,273 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-07-23 13:58:08,273 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:58:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-07-23 13:58:08,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-23 13:58:08,274 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:08,274 INFO L357 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1] [2018-07-23 13:58:08,274 INFO L414 AbstractCegarLoop]: === Iteration 271 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash -997780857, now seen corresponding path program 268 times [2018-07-23 13:58:08,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:08,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:08,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:58:08,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:08,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:58:08,856 INFO L185 omatonBuilderFactory]: Interpolants [135426#(and (<= Main_y 3) (<= 3 Main_y)), 135427#(and (<= Main_y 4) (<= 4 Main_y)), 135424#(and (<= 1 Main_y) (<= Main_y 1)), 135425#(and (<= Main_y 2) (<= 2 Main_y)), 135430#(and (<= 7 Main_y) (<= Main_y 7)), 135431#(and (<= 8 Main_y) (<= Main_y 8)), 135428#(and (<= Main_y 5) (<= 5 Main_y)), 135429#(and (<= Main_y 6) (<= 6 Main_y)), 135434#(and (<= 11 Main_y) (<= Main_y 11)), 135435#(and (<= 12 Main_y) (<= Main_y 12)), 135432#(and (<= Main_y 9) (<= 9 Main_y)), 135433#(and (<= 10 Main_y) (<= Main_y 10)), 135438#(and (<= Main_y 15) (<= 15 Main_y)), 135439#(and (<= 16 Main_y) (<= Main_y 16)), 135436#(and (<= 13 Main_y) (<= Main_y 13)), 135437#(and (<= 14 Main_y) (<= Main_y 14)), 135442#(and (<= Main_y 19) (<= 19 Main_y)), 135443#(and (<= 20 Main_y) (<= Main_y 20)), 135440#(and (<= Main_y 17) (<= 17 Main_y)), 135441#(and (<= Main_y 18) (<= 18 Main_y)), 135446#(and (<= 23 Main_y) (<= Main_y 23)), 135447#(and (<= Main_y 24) (<= 24 Main_y)), 135444#(and (<= 21 Main_y) (<= Main_y 21)), 135445#(and (<= Main_y 22) (<= 22 Main_y)), 135450#(and (<= 27 Main_y) (<= Main_y 27)), 135451#(and (<= 28 Main_y) (<= Main_y 28)), 135448#(and (<= 25 Main_y) (<= Main_y 25)), 135449#(and (<= Main_y 26) (<= 26 Main_y)), 135454#(and (<= Main_y 31) (<= 31 Main_y)), 135455#(and (<= 32 Main_y) (<= Main_y 32)), 135452#(and (<= 29 Main_y) (<= Main_y 29)), 135453#(and (<= 30 Main_y) (<= Main_y 30)), 135458#(and (<= 35 Main_y) (<= Main_y 35)), 135459#(and (<= 36 Main_y) (<= Main_y 36)), 135456#(and (<= 33 Main_y) (<= Main_y 33)), 135457#(and (<= Main_y 34) (<= 34 Main_y)), 135462#(and (<= 39 Main_y) (<= Main_y 39)), 135463#(and (<= 40 Main_y) (<= Main_y 40)), 135460#(and (<= Main_y 37) (<= 37 Main_y)), 135461#(and (<= Main_y 38) (<= 38 Main_y)), 135466#(and (<= 43 Main_y) (<= Main_y 43)), 135467#(and (<= 44 Main_y) (<= Main_y 44)), 135464#(and (<= Main_y 41) (<= 41 Main_y)), 135465#(and (<= 42 Main_y) (<= Main_y 42)), 135470#(and (<= 47 Main_y) (<= Main_y 47)), 135471#(and (<= 48 Main_y) (<= Main_y 48)), 135468#(and (<= Main_y 45) (<= 45 Main_y)), 135469#(and (<= 46 Main_y) (<= Main_y 46)), 135474#(and (<= 51 Main_y) (<= Main_y 51)), 135475#(and (<= 52 Main_y) (<= Main_y 52)), 135472#(and (<= 49 Main_y) (<= Main_y 49)), 135473#(and (<= 50 Main_y) (<= Main_y 50)), 135478#(and (<= 55 Main_y) (<= Main_y 55)), 135479#(and (<= Main_y 56) (<= 56 Main_y)), 135476#(and (<= 53 Main_y) (<= Main_y 53)), 135477#(and (<= 54 Main_y) (<= Main_y 54)), 135482#(and (<= Main_y 59) (<= 59 Main_y)), 135483#(and (<= Main_y 60) (<= 60 Main_y)), 135480#(and (<= Main_y 57) (<= 57 Main_y)), 135481#(and (<= Main_y 58) (<= 58 Main_y)), 135486#(and (<= 63 Main_y) (<= Main_y 63)), 135487#(and (<= 64 Main_y) (<= Main_y 64)), 135484#(and (<= Main_y 61) (<= 61 Main_y)), 135485#(and (<= 62 Main_y) (<= Main_y 62)), 135490#(and (<= 67 Main_y) (<= Main_y 67)), 135491#(and (<= 68 Main_y) (<= Main_y 68)), 135488#(and (<= Main_y 65) (<= 65 Main_y)), 135489#(and (<= Main_y 66) (<= 66 Main_y)), 135494#(and (<= Main_y 71) (<= 71 Main_y)), 135495#(and (<= 72 Main_y) (<= Main_y 72)), 135492#(and (<= Main_y 69) (<= 69 Main_y)), 135493#(and (<= 70 Main_y) (<= Main_y 70)), 135498#(and (<= Main_y 75) (<= 75 Main_y)), 135499#(and (<= Main_y 76) (<= 76 Main_y)), 135496#(and (<= 73 Main_y) (<= Main_y 73)), 135497#(and (<= 74 Main_y) (<= Main_y 74)), 135502#(and (<= 79 Main_y) (<= Main_y 79)), 135503#(and (<= Main_y 80) (<= 80 Main_y)), 135500#(and (<= Main_y 77) (<= 77 Main_y)), 135501#(and (<= Main_y 78) (<= 78 Main_y)), 135506#(and (<= Main_y 83) (<= 83 Main_y)), 135507#(and (<= Main_y 84) (<= 84 Main_y)), 135504#(and (<= 81 Main_y) (<= Main_y 81)), 135505#(and (<= Main_y 82) (<= 82 Main_y)), 135510#(and (<= Main_y 87) (<= 87 Main_y)), 135511#(and (<= Main_y 88) (<= 88 Main_y)), 135508#(and (<= Main_y 85) (<= 85 Main_y)), 135509#(and (<= 86 Main_y) (<= Main_y 86)), 135512#(and (<= Main_y 89) (<= 89 Main_y)), 135513#(and (<= Main_y 90) (<= 90 Main_y)), 135422#false, 135423#(and (<= 0 Main_y) (<= Main_y 0)), 135421#true] [2018-07-23 13:58:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:08,857 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:58:08,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:58:08,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:58:08,857 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 93 states. [2018-07-23 13:58:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:10,120 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-07-23 13:58:10,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:58:10,121 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 185 [2018-07-23 13:58:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:10,121 INFO L225 Difference]: With dead ends: 281 [2018-07-23 13:58:10,121 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 13:58:10,121 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:58:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 13:58:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 188. [2018-07-23 13:58:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-23 13:58:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-07-23 13:58:10,295 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 185 [2018-07-23 13:58:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:10,295 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-07-23 13:58:10,295 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:58:10,295 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-07-23 13:58:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-23 13:58:10,296 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:10,296 INFO L357 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2018-07-23 13:58:10,296 INFO L414 AbstractCegarLoop]: === Iteration 272 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash -866497017, now seen corresponding path program 269 times [2018-07-23 13:58:10,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:10,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:10,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:58:10,733 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:10,733 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:58:10,733 INFO L185 omatonBuilderFactory]: Interpolants [136454#(<= Main_x 0), 136455#(<= Main_x 1), 136452#true, 136453#false, 136458#(<= Main_x 4), 136459#(<= Main_x 5), 136456#(<= Main_x 2), 136457#(<= Main_x 3), 136462#(<= Main_x 8), 136463#(<= Main_x 9), 136460#(<= Main_x 6), 136461#(<= Main_x 7), 136466#(<= Main_x 12), 136467#(<= Main_x 13), 136464#(<= Main_x 10), 136465#(<= Main_x 11), 136470#(<= Main_x 16), 136471#(<= Main_x 17), 136468#(<= Main_x 14), 136469#(<= Main_x 15), 136474#(<= Main_x 20), 136475#(<= Main_x 21), 136472#(<= Main_x 18), 136473#(<= Main_x 19), 136478#(<= Main_x 24), 136479#(<= Main_x 25), 136476#(<= Main_x 22), 136477#(<= Main_x 23), 136482#(<= Main_x 28), 136483#(<= Main_x 29), 136480#(<= Main_x 26), 136481#(<= Main_x 27), 136486#(<= Main_x 32), 136487#(<= Main_x 33), 136484#(<= Main_x 30), 136485#(<= Main_x 31), 136490#(<= Main_x 36), 136491#(<= Main_x 37), 136488#(<= Main_x 34), 136489#(<= Main_x 35), 136494#(<= Main_x 40), 136495#(<= Main_x 41), 136492#(<= Main_x 38), 136493#(<= Main_x 39), 136498#(<= Main_x 44), 136499#(<= Main_x 45), 136496#(<= Main_x 42), 136497#(<= Main_x 43), 136502#(<= Main_x 48), 136503#(<= Main_x 49), 136500#(<= Main_x 46), 136501#(<= Main_x 47), 136506#(<= Main_x 52), 136507#(<= Main_x 53), 136504#(<= Main_x 50), 136505#(<= Main_x 51), 136510#(<= Main_x 56), 136511#(<= Main_x 57), 136508#(<= Main_x 54), 136509#(<= Main_x 55), 136514#(<= Main_x 60), 136515#(<= Main_x 61), 136512#(<= Main_x 58), 136513#(<= Main_x 59), 136518#(<= Main_x 64), 136519#(<= Main_x 65), 136516#(<= Main_x 62), 136517#(<= Main_x 63), 136522#(<= Main_x 68), 136523#(<= Main_x 69), 136520#(<= Main_x 66), 136521#(<= Main_x 67), 136526#(<= Main_x 72), 136527#(<= Main_x 73), 136524#(<= Main_x 70), 136525#(<= Main_x 71), 136530#(<= Main_x 76), 136531#(<= Main_x 77), 136528#(<= Main_x 74), 136529#(<= Main_x 75), 136534#(<= Main_x 80), 136535#(<= Main_x 81), 136532#(<= Main_x 78), 136533#(<= Main_x 79), 136538#(<= Main_x 84), 136539#(<= Main_x 85), 136536#(<= Main_x 82), 136537#(<= Main_x 83), 136542#(<= Main_x 88), 136543#(<= Main_x 89), 136540#(<= Main_x 86), 136541#(<= Main_x 87), 136544#(<= Main_x 90), 136545#(<= (+ Main_x 1) 0)] [2018-07-23 13:58:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:10,734 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:58:10,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:58:10,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:58:10,735 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 94 states. [2018-07-23 13:58:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:11,331 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-07-23 13:58:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:58:11,331 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-23 13:58:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:11,332 INFO L225 Difference]: With dead ends: 282 [2018-07-23 13:58:11,332 INFO L226 Difference]: Without dead ends: 187 [2018-07-23 13:58:11,333 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:58:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-23 13:58:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-23 13:58:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-23 13:58:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-07-23 13:58:11,502 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 186 [2018-07-23 13:58:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-07-23 13:58:11,502 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:58:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-07-23 13:58:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-23 13:58:11,503 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:11,503 INFO L357 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2018-07-23 13:58:11,503 INFO L414 AbstractCegarLoop]: === Iteration 273 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:11,503 INFO L82 PathProgramCache]: Analyzing trace with hash -438334419, now seen corresponding path program 270 times [2018-07-23 13:58:11,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:11,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:11,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:58:11,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:11,902 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:58:11,902 INFO L185 omatonBuilderFactory]: Interpolants [137486#(<= 0 Main_x), 137487#(<= 1 Main_x), 137484#true, 137485#false, 137490#(<= 4 Main_x), 137491#(<= 5 Main_x), 137488#(<= 2 Main_x), 137489#(<= 3 Main_x), 137494#(<= 8 Main_x), 137495#(<= 9 Main_x), 137492#(<= 6 Main_x), 137493#(<= 7 Main_x), 137498#(<= 12 Main_x), 137499#(<= 13 Main_x), 137496#(<= 10 Main_x), 137497#(<= 11 Main_x), 137502#(<= 16 Main_x), 137503#(<= 17 Main_x), 137500#(<= 14 Main_x), 137501#(<= 15 Main_x), 137506#(<= 20 Main_x), 137507#(<= 21 Main_x), 137504#(<= 18 Main_x), 137505#(<= 19 Main_x), 137510#(<= 24 Main_x), 137511#(<= 25 Main_x), 137508#(<= 22 Main_x), 137509#(<= 23 Main_x), 137514#(<= 28 Main_x), 137515#(<= 29 Main_x), 137512#(<= 26 Main_x), 137513#(<= 27 Main_x), 137518#(<= 32 Main_x), 137519#(<= 33 Main_x), 137516#(<= 30 Main_x), 137517#(<= 31 Main_x), 137522#(<= 36 Main_x), 137523#(<= 37 Main_x), 137520#(<= 34 Main_x), 137521#(<= 35 Main_x), 137526#(<= 40 Main_x), 137527#(<= 41 Main_x), 137524#(<= 38 Main_x), 137525#(<= 39 Main_x), 137530#(<= 44 Main_x), 137531#(<= 45 Main_x), 137528#(<= 42 Main_x), 137529#(<= 43 Main_x), 137534#(<= 48 Main_x), 137535#(<= 49 Main_x), 137532#(<= 46 Main_x), 137533#(<= 47 Main_x), 137538#(<= 52 Main_x), 137539#(<= 53 Main_x), 137536#(<= 50 Main_x), 137537#(<= 51 Main_x), 137542#(<= 56 Main_x), 137543#(<= 57 Main_x), 137540#(<= 54 Main_x), 137541#(<= 55 Main_x), 137546#(<= 60 Main_x), 137547#(<= 61 Main_x), 137544#(<= 58 Main_x), 137545#(<= 59 Main_x), 137550#(<= 64 Main_x), 137551#(<= 65 Main_x), 137548#(<= 62 Main_x), 137549#(<= 63 Main_x), 137554#(<= 68 Main_x), 137555#(<= 69 Main_x), 137552#(<= 66 Main_x), 137553#(<= 67 Main_x), 137558#(<= 72 Main_x), 137559#(<= 73 Main_x), 137556#(<= 70 Main_x), 137557#(<= 71 Main_x), 137562#(<= 76 Main_x), 137563#(<= 77 Main_x), 137560#(<= 74 Main_x), 137561#(<= 75 Main_x), 137566#(<= 80 Main_x), 137567#(<= 81 Main_x), 137564#(<= 78 Main_x), 137565#(<= 79 Main_x), 137570#(<= 84 Main_x), 137571#(<= 85 Main_x), 137568#(<= 82 Main_x), 137569#(<= 83 Main_x), 137574#(<= 88 Main_x), 137575#(<= 89 Main_x), 137572#(<= 86 Main_x), 137573#(<= 87 Main_x), 137576#(<= 90 Main_x), 137577#(<= 91 Main_x)] [2018-07-23 13:58:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:11,903 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:58:11,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:58:11,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:58:11,904 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-07-23 13:58:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:12,122 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-07-23 13:58:12,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:58:12,123 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-23 13:58:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:12,123 INFO L225 Difference]: With dead ends: 191 [2018-07-23 13:58:12,123 INFO L226 Difference]: Without dead ends: 188 [2018-07-23 13:58:12,124 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:58:12,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-23 13:58:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-23 13:58:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-23 13:58:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 189 transitions. [2018-07-23 13:58:12,293 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 189 transitions. Word has length 186 [2018-07-23 13:58:12,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:12,293 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 189 transitions. [2018-07-23 13:58:12,294 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:58:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 189 transitions. [2018-07-23 13:58:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-23 13:58:12,294 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:12,294 INFO L357 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1] [2018-07-23 13:58:12,294 INFO L414 AbstractCegarLoop]: === Iteration 274 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash -703526623, now seen corresponding path program 271 times [2018-07-23 13:58:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:12,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:12,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:58:12,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:12,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:58:12,855 INFO L185 omatonBuilderFactory]: Interpolants [138370#(and (<= 32 Main_y) (<= Main_y 32)), 138371#(and (<= 33 Main_y) (<= Main_y 33)), 138368#(and (<= 30 Main_y) (<= Main_y 30)), 138369#(and (<= Main_y 31) (<= 31 Main_y)), 138374#(and (<= 36 Main_y) (<= Main_y 36)), 138375#(and (<= Main_y 37) (<= 37 Main_y)), 138372#(and (<= Main_y 34) (<= 34 Main_y)), 138373#(and (<= 35 Main_y) (<= Main_y 35)), 138378#(and (<= 40 Main_y) (<= Main_y 40)), 138379#(and (<= Main_y 41) (<= 41 Main_y)), 138376#(and (<= Main_y 38) (<= 38 Main_y)), 138377#(and (<= 39 Main_y) (<= Main_y 39)), 138382#(and (<= 44 Main_y) (<= Main_y 44)), 138383#(and (<= Main_y 45) (<= 45 Main_y)), 138380#(and (<= 42 Main_y) (<= Main_y 42)), 138381#(and (<= 43 Main_y) (<= Main_y 43)), 138386#(and (<= 48 Main_y) (<= Main_y 48)), 138387#(and (<= 49 Main_y) (<= Main_y 49)), 138384#(and (<= 46 Main_y) (<= Main_y 46)), 138385#(and (<= 47 Main_y) (<= Main_y 47)), 138390#(and (<= 52 Main_y) (<= Main_y 52)), 138391#(and (<= 53 Main_y) (<= Main_y 53)), 138388#(and (<= 50 Main_y) (<= Main_y 50)), 138389#(and (<= 51 Main_y) (<= Main_y 51)), 138394#(and (<= Main_y 56) (<= 56 Main_y)), 138395#(and (<= Main_y 57) (<= 57 Main_y)), 138392#(and (<= 54 Main_y) (<= Main_y 54)), 138393#(and (<= 55 Main_y) (<= Main_y 55)), 138398#(and (<= Main_y 60) (<= 60 Main_y)), 138399#(and (<= Main_y 61) (<= 61 Main_y)), 138396#(and (<= Main_y 58) (<= 58 Main_y)), 138397#(and (<= Main_y 59) (<= 59 Main_y)), 138402#(and (<= 64 Main_y) (<= Main_y 64)), 138403#(and (<= Main_y 65) (<= 65 Main_y)), 138400#(and (<= 62 Main_y) (<= Main_y 62)), 138401#(and (<= 63 Main_y) (<= Main_y 63)), 138406#(and (<= 68 Main_y) (<= Main_y 68)), 138407#(and (<= Main_y 69) (<= 69 Main_y)), 138404#(and (<= Main_y 66) (<= 66 Main_y)), 138405#(and (<= 67 Main_y) (<= Main_y 67)), 138410#(and (<= 72 Main_y) (<= Main_y 72)), 138411#(and (<= 73 Main_y) (<= Main_y 73)), 138408#(and (<= 70 Main_y) (<= Main_y 70)), 138409#(and (<= Main_y 71) (<= 71 Main_y)), 138414#(and (<= Main_y 76) (<= 76 Main_y)), 138415#(and (<= Main_y 77) (<= 77 Main_y)), 138412#(and (<= 74 Main_y) (<= Main_y 74)), 138413#(and (<= Main_y 75) (<= 75 Main_y)), 138418#(and (<= Main_y 80) (<= 80 Main_y)), 138419#(and (<= 81 Main_y) (<= Main_y 81)), 138416#(and (<= Main_y 78) (<= 78 Main_y)), 138417#(and (<= 79 Main_y) (<= Main_y 79)), 138422#(and (<= Main_y 84) (<= 84 Main_y)), 138423#(and (<= Main_y 85) (<= 85 Main_y)), 138420#(and (<= Main_y 82) (<= 82 Main_y)), 138421#(and (<= Main_y 83) (<= 83 Main_y)), 138426#(and (<= Main_y 88) (<= 88 Main_y)), 138427#(and (<= Main_y 89) (<= 89 Main_y)), 138424#(and (<= 86 Main_y) (<= Main_y 86)), 138425#(and (<= Main_y 87) (<= 87 Main_y)), 138428#(and (<= Main_y 90) (<= 90 Main_y)), 138429#(and (<= Main_y 91) (<= 91 Main_y)), 138338#(and (<= 0 Main_y) (<= Main_y 0)), 138339#(and (<= 1 Main_y) (<= Main_y 1)), 138336#true, 138337#false, 138342#(and (<= Main_y 4) (<= 4 Main_y)), 138343#(and (<= Main_y 5) (<= 5 Main_y)), 138340#(and (<= Main_y 2) (<= 2 Main_y)), 138341#(and (<= Main_y 3) (<= 3 Main_y)), 138346#(and (<= 8 Main_y) (<= Main_y 8)), 138347#(and (<= Main_y 9) (<= 9 Main_y)), 138344#(and (<= Main_y 6) (<= 6 Main_y)), 138345#(and (<= 7 Main_y) (<= Main_y 7)), 138350#(and (<= 12 Main_y) (<= Main_y 12)), 138351#(and (<= 13 Main_y) (<= Main_y 13)), 138348#(and (<= 10 Main_y) (<= Main_y 10)), 138349#(and (<= 11 Main_y) (<= Main_y 11)), 138354#(and (<= 16 Main_y) (<= Main_y 16)), 138355#(and (<= Main_y 17) (<= 17 Main_y)), 138352#(and (<= 14 Main_y) (<= Main_y 14)), 138353#(and (<= Main_y 15) (<= 15 Main_y)), 138358#(and (<= 20 Main_y) (<= Main_y 20)), 138359#(and (<= 21 Main_y) (<= Main_y 21)), 138356#(and (<= Main_y 18) (<= 18 Main_y)), 138357#(and (<= Main_y 19) (<= 19 Main_y)), 138362#(and (<= Main_y 24) (<= 24 Main_y)), 138363#(and (<= 25 Main_y) (<= Main_y 25)), 138360#(and (<= Main_y 22) (<= 22 Main_y)), 138361#(and (<= 23 Main_y) (<= Main_y 23)), 138366#(and (<= 28 Main_y) (<= Main_y 28)), 138367#(and (<= 29 Main_y) (<= Main_y 29)), 138364#(and (<= Main_y 26) (<= 26 Main_y)), 138365#(and (<= 27 Main_y) (<= Main_y 27))] [2018-07-23 13:58:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:12,856 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:58:12,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:58:12,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:58:12,856 INFO L87 Difference]: Start difference. First operand 188 states and 189 transitions. Second operand 94 states. [2018-07-23 13:58:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:14,141 INFO L93 Difference]: Finished difference Result 284 states and 286 transitions. [2018-07-23 13:58:14,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:58:14,141 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 187 [2018-07-23 13:58:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:14,142 INFO L225 Difference]: With dead ends: 284 [2018-07-23 13:58:14,142 INFO L226 Difference]: Without dead ends: 281 [2018-07-23 13:58:14,142 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:58:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-23 13:58:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 190. [2018-07-23 13:58:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-23 13:58:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2018-07-23 13:58:14,330 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 187 [2018-07-23 13:58:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:14,330 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 192 transitions. [2018-07-23 13:58:14,331 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:58:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 192 transitions. [2018-07-23 13:58:14,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 13:58:14,331 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:14,331 INFO L357 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2018-07-23 13:58:14,331 INFO L414 AbstractCegarLoop]: === Iteration 275 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -334550355, now seen corresponding path program 272 times [2018-07-23 13:58:14,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:14,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4278 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:14,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:14,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:58:14,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:14,659 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:58:14,659 INFO L185 omatonBuilderFactory]: Interpolants [139394#(<= Main_x 14), 139395#(<= Main_x 15), 139392#(<= Main_x 12), 139393#(<= Main_x 13), 139398#(<= Main_x 18), 139399#(<= Main_x 19), 139396#(<= Main_x 16), 139397#(<= Main_x 17), 139402#(<= Main_x 22), 139403#(<= Main_x 23), 139400#(<= Main_x 20), 139401#(<= Main_x 21), 139406#(<= Main_x 26), 139407#(<= Main_x 27), 139404#(<= Main_x 24), 139405#(<= Main_x 25), 139410#(<= Main_x 30), 139411#(<= Main_x 31), 139408#(<= Main_x 28), 139409#(<= Main_x 29), 139414#(<= Main_x 34), 139415#(<= Main_x 35), 139412#(<= Main_x 32), 139413#(<= Main_x 33), 139418#(<= Main_x 38), 139419#(<= Main_x 39), 139416#(<= Main_x 36), 139417#(<= Main_x 37), 139422#(<= Main_x 42), 139423#(<= Main_x 43), 139420#(<= Main_x 40), 139421#(<= Main_x 41), 139426#(<= Main_x 46), 139427#(<= Main_x 47), 139424#(<= Main_x 44), 139425#(<= Main_x 45), 139430#(<= Main_x 50), 139431#(<= Main_x 51), 139428#(<= Main_x 48), 139429#(<= Main_x 49), 139434#(<= Main_x 54), 139435#(<= Main_x 55), 139432#(<= Main_x 52), 139433#(<= Main_x 53), 139438#(<= Main_x 58), 139439#(<= Main_x 59), 139436#(<= Main_x 56), 139437#(<= Main_x 57), 139442#(<= Main_x 62), 139443#(<= Main_x 63), 139440#(<= Main_x 60), 139441#(<= Main_x 61), 139446#(<= Main_x 66), 139447#(<= Main_x 67), 139444#(<= Main_x 64), 139445#(<= Main_x 65), 139450#(<= Main_x 70), 139451#(<= Main_x 71), 139448#(<= Main_x 68), 139449#(<= Main_x 69), 139454#(<= Main_x 74), 139455#(<= Main_x 75), 139452#(<= Main_x 72), 139453#(<= Main_x 73), 139458#(<= Main_x 78), 139459#(<= Main_x 79), 139456#(<= Main_x 76), 139457#(<= Main_x 77), 139462#(<= Main_x 82), 139463#(<= Main_x 83), 139460#(<= Main_x 80), 139461#(<= Main_x 81), 139466#(<= Main_x 86), 139467#(<= Main_x 87), 139464#(<= Main_x 84), 139465#(<= Main_x 85), 139470#(<= Main_x 90), 139471#(<= Main_x 91), 139468#(<= Main_x 88), 139469#(<= Main_x 89), 139472#(<= (+ Main_x 1) 0), 139378#true, 139379#false, 139382#(<= Main_x 2), 139383#(<= Main_x 3), 139380#(<= Main_x 0), 139381#(<= Main_x 1), 139386#(<= Main_x 6), 139387#(<= Main_x 7), 139384#(<= Main_x 4), 139385#(<= Main_x 5), 139390#(<= Main_x 10), 139391#(<= Main_x 11), 139388#(<= Main_x 8), 139389#(<= Main_x 9)] [2018-07-23 13:58:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4278 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:14,659 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:58:14,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:58:14,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:58:14,660 INFO L87 Difference]: Start difference. First operand 190 states and 192 transitions. Second operand 95 states. [2018-07-23 13:58:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:15,122 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2018-07-23 13:58:15,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:58:15,122 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-23 13:58:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:15,123 INFO L225 Difference]: With dead ends: 285 [2018-07-23 13:58:15,123 INFO L226 Difference]: Without dead ends: 189 [2018-07-23 13:58:15,123 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:58:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-23 13:58:15,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-23 13:58:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 13:58:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-07-23 13:58:15,277 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 188 [2018-07-23 13:58:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:15,277 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-07-23 13:58:15,277 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:58:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-07-23 13:58:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 13:58:15,278 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:15,278 INFO L357 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2018-07-23 13:58:15,278 INFO L414 AbstractCegarLoop]: === Iteration 276 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:15,278 INFO L82 PathProgramCache]: Analyzing trace with hash 53588295, now seen corresponding path program 273 times [2018-07-23 13:58:15,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4278 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:15,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:15,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:58:15,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:15,630 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:58:15,630 INFO L185 omatonBuilderFactory]: Interpolants [140422#false, 140423#(<= 0 Main_x), 140421#true, 140426#(<= 3 Main_x), 140427#(<= 4 Main_x), 140424#(<= 1 Main_x), 140425#(<= 2 Main_x), 140430#(<= 7 Main_x), 140431#(<= 8 Main_x), 140428#(<= 5 Main_x), 140429#(<= 6 Main_x), 140434#(<= 11 Main_x), 140435#(<= 12 Main_x), 140432#(<= 9 Main_x), 140433#(<= 10 Main_x), 140438#(<= 15 Main_x), 140439#(<= 16 Main_x), 140436#(<= 13 Main_x), 140437#(<= 14 Main_x), 140442#(<= 19 Main_x), 140443#(<= 20 Main_x), 140440#(<= 17 Main_x), 140441#(<= 18 Main_x), 140446#(<= 23 Main_x), 140447#(<= 24 Main_x), 140444#(<= 21 Main_x), 140445#(<= 22 Main_x), 140450#(<= 27 Main_x), 140451#(<= 28 Main_x), 140448#(<= 25 Main_x), 140449#(<= 26 Main_x), 140454#(<= 31 Main_x), 140455#(<= 32 Main_x), 140452#(<= 29 Main_x), 140453#(<= 30 Main_x), 140458#(<= 35 Main_x), 140459#(<= 36 Main_x), 140456#(<= 33 Main_x), 140457#(<= 34 Main_x), 140462#(<= 39 Main_x), 140463#(<= 40 Main_x), 140460#(<= 37 Main_x), 140461#(<= 38 Main_x), 140466#(<= 43 Main_x), 140467#(<= 44 Main_x), 140464#(<= 41 Main_x), 140465#(<= 42 Main_x), 140470#(<= 47 Main_x), 140471#(<= 48 Main_x), 140468#(<= 45 Main_x), 140469#(<= 46 Main_x), 140474#(<= 51 Main_x), 140475#(<= 52 Main_x), 140472#(<= 49 Main_x), 140473#(<= 50 Main_x), 140478#(<= 55 Main_x), 140479#(<= 56 Main_x), 140476#(<= 53 Main_x), 140477#(<= 54 Main_x), 140482#(<= 59 Main_x), 140483#(<= 60 Main_x), 140480#(<= 57 Main_x), 140481#(<= 58 Main_x), 140486#(<= 63 Main_x), 140487#(<= 64 Main_x), 140484#(<= 61 Main_x), 140485#(<= 62 Main_x), 140490#(<= 67 Main_x), 140491#(<= 68 Main_x), 140488#(<= 65 Main_x), 140489#(<= 66 Main_x), 140494#(<= 71 Main_x), 140495#(<= 72 Main_x), 140492#(<= 69 Main_x), 140493#(<= 70 Main_x), 140498#(<= 75 Main_x), 140499#(<= 76 Main_x), 140496#(<= 73 Main_x), 140497#(<= 74 Main_x), 140502#(<= 79 Main_x), 140503#(<= 80 Main_x), 140500#(<= 77 Main_x), 140501#(<= 78 Main_x), 140506#(<= 83 Main_x), 140507#(<= 84 Main_x), 140504#(<= 81 Main_x), 140505#(<= 82 Main_x), 140510#(<= 87 Main_x), 140511#(<= 88 Main_x), 140508#(<= 85 Main_x), 140509#(<= 86 Main_x), 140514#(<= 91 Main_x), 140515#(<= 92 Main_x), 140512#(<= 89 Main_x), 140513#(<= 90 Main_x)] [2018-07-23 13:58:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4278 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:15,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:58:15,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:58:15,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:58:15,631 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-07-23 13:58:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:15,830 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-07-23 13:58:15,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:58:15,831 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-23 13:58:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:15,831 INFO L225 Difference]: With dead ends: 193 [2018-07-23 13:58:15,831 INFO L226 Difference]: Without dead ends: 190 [2018-07-23 13:58:15,831 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:58:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-23 13:58:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-23 13:58:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-23 13:58:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-07-23 13:58:15,991 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 188 [2018-07-23 13:58:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-07-23 13:58:15,992 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:58:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-07-23 13:58:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-23 13:58:15,992 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:15,992 INFO L357 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1] [2018-07-23 13:58:15,992 INFO L414 AbstractCegarLoop]: === Iteration 277 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1661175623, now seen corresponding path program 274 times [2018-07-23 13:58:15,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:16,515 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:16,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:58:16,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:16,515 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:58:16,516 INFO L185 omatonBuilderFactory]: Interpolants [141314#(and (<= 30 Main_y) (<= Main_y 30)), 141315#(and (<= Main_y 31) (<= 31 Main_y)), 141312#(and (<= 28 Main_y) (<= Main_y 28)), 141313#(and (<= 29 Main_y) (<= Main_y 29)), 141318#(and (<= Main_y 34) (<= 34 Main_y)), 141319#(and (<= 35 Main_y) (<= Main_y 35)), 141316#(and (<= 32 Main_y) (<= Main_y 32)), 141317#(and (<= 33 Main_y) (<= Main_y 33)), 141322#(and (<= Main_y 38) (<= 38 Main_y)), 141323#(and (<= 39 Main_y) (<= Main_y 39)), 141320#(and (<= 36 Main_y) (<= Main_y 36)), 141321#(and (<= Main_y 37) (<= 37 Main_y)), 141326#(and (<= 42 Main_y) (<= Main_y 42)), 141327#(and (<= 43 Main_y) (<= Main_y 43)), 141324#(and (<= 40 Main_y) (<= Main_y 40)), 141325#(and (<= Main_y 41) (<= 41 Main_y)), 141330#(and (<= 46 Main_y) (<= Main_y 46)), 141331#(and (<= 47 Main_y) (<= Main_y 47)), 141328#(and (<= 44 Main_y) (<= Main_y 44)), 141329#(and (<= Main_y 45) (<= 45 Main_y)), 141334#(and (<= 50 Main_y) (<= Main_y 50)), 141335#(and (<= 51 Main_y) (<= Main_y 51)), 141332#(and (<= 48 Main_y) (<= Main_y 48)), 141333#(and (<= 49 Main_y) (<= Main_y 49)), 141338#(and (<= 54 Main_y) (<= Main_y 54)), 141339#(and (<= 55 Main_y) (<= Main_y 55)), 141336#(and (<= 52 Main_y) (<= Main_y 52)), 141337#(and (<= 53 Main_y) (<= Main_y 53)), 141342#(and (<= Main_y 58) (<= 58 Main_y)), 141343#(and (<= Main_y 59) (<= 59 Main_y)), 141340#(and (<= Main_y 56) (<= 56 Main_y)), 141341#(and (<= Main_y 57) (<= 57 Main_y)), 141346#(and (<= 62 Main_y) (<= Main_y 62)), 141347#(and (<= 63 Main_y) (<= Main_y 63)), 141344#(and (<= Main_y 60) (<= 60 Main_y)), 141345#(and (<= Main_y 61) (<= 61 Main_y)), 141350#(and (<= Main_y 66) (<= 66 Main_y)), 141351#(and (<= 67 Main_y) (<= Main_y 67)), 141348#(and (<= 64 Main_y) (<= Main_y 64)), 141349#(and (<= Main_y 65) (<= 65 Main_y)), 141354#(and (<= 70 Main_y) (<= Main_y 70)), 141355#(and (<= Main_y 71) (<= 71 Main_y)), 141352#(and (<= 68 Main_y) (<= Main_y 68)), 141353#(and (<= Main_y 69) (<= 69 Main_y)), 141358#(and (<= 74 Main_y) (<= Main_y 74)), 141359#(and (<= Main_y 75) (<= 75 Main_y)), 141356#(and (<= 72 Main_y) (<= Main_y 72)), 141357#(and (<= 73 Main_y) (<= Main_y 73)), 141362#(and (<= Main_y 78) (<= 78 Main_y)), 141363#(and (<= 79 Main_y) (<= Main_y 79)), 141360#(and (<= Main_y 76) (<= 76 Main_y)), 141361#(and (<= Main_y 77) (<= 77 Main_y)), 141366#(and (<= Main_y 82) (<= 82 Main_y)), 141367#(and (<= Main_y 83) (<= 83 Main_y)), 141364#(and (<= Main_y 80) (<= 80 Main_y)), 141365#(and (<= 81 Main_y) (<= Main_y 81)), 141370#(and (<= 86 Main_y) (<= Main_y 86)), 141371#(and (<= Main_y 87) (<= 87 Main_y)), 141368#(and (<= Main_y 84) (<= 84 Main_y)), 141369#(and (<= Main_y 85) (<= 85 Main_y)), 141374#(and (<= Main_y 90) (<= 90 Main_y)), 141375#(and (<= Main_y 91) (<= 91 Main_y)), 141372#(and (<= Main_y 88) (<= 88 Main_y)), 141373#(and (<= Main_y 89) (<= 89 Main_y)), 141376#(and (<= 92 Main_y) (<= Main_y 92)), 141282#true, 141283#false, 141286#(and (<= Main_y 2) (<= 2 Main_y)), 141287#(and (<= Main_y 3) (<= 3 Main_y)), 141284#(and (<= 0 Main_y) (<= Main_y 0)), 141285#(and (<= 1 Main_y) (<= Main_y 1)), 141290#(and (<= Main_y 6) (<= 6 Main_y)), 141291#(and (<= 7 Main_y) (<= Main_y 7)), 141288#(and (<= Main_y 4) (<= 4 Main_y)), 141289#(and (<= Main_y 5) (<= 5 Main_y)), 141294#(and (<= 10 Main_y) (<= Main_y 10)), 141295#(and (<= 11 Main_y) (<= Main_y 11)), 141292#(and (<= 8 Main_y) (<= Main_y 8)), 141293#(and (<= Main_y 9) (<= 9 Main_y)), 141298#(and (<= 14 Main_y) (<= Main_y 14)), 141299#(and (<= Main_y 15) (<= 15 Main_y)), 141296#(and (<= 12 Main_y) (<= Main_y 12)), 141297#(and (<= 13 Main_y) (<= Main_y 13)), 141302#(and (<= Main_y 18) (<= 18 Main_y)), 141303#(and (<= Main_y 19) (<= 19 Main_y)), 141300#(and (<= 16 Main_y) (<= Main_y 16)), 141301#(and (<= Main_y 17) (<= 17 Main_y)), 141306#(and (<= Main_y 22) (<= 22 Main_y)), 141307#(and (<= 23 Main_y) (<= Main_y 23)), 141304#(and (<= 20 Main_y) (<= Main_y 20)), 141305#(and (<= 21 Main_y) (<= Main_y 21)), 141310#(and (<= Main_y 26) (<= 26 Main_y)), 141311#(and (<= 27 Main_y) (<= Main_y 27)), 141308#(and (<= Main_y 24) (<= 24 Main_y)), 141309#(and (<= 25 Main_y) (<= Main_y 25))] [2018-07-23 13:58:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:16,516 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:58:16,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:58:16,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:58:16,517 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 95 states. [2018-07-23 13:58:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:17,839 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-07-23 13:58:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:58:17,839 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 189 [2018-07-23 13:58:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:17,839 INFO L225 Difference]: With dead ends: 287 [2018-07-23 13:58:17,839 INFO L226 Difference]: Without dead ends: 284 [2018-07-23 13:58:17,840 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:58:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-07-23 13:58:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 192. [2018-07-23 13:58:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-23 13:58:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-07-23 13:58:18,023 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 189 [2018-07-23 13:58:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:18,023 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-07-23 13:58:18,023 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:58:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-07-23 13:58:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 13:58:18,023 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:18,023 INFO L357 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2018-07-23 13:58:18,024 INFO L414 AbstractCegarLoop]: === Iteration 278 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash -43224761, now seen corresponding path program 275 times [2018-07-23 13:58:18,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:18,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:18,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:58:18,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:18,448 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:58:18,448 INFO L185 omatonBuilderFactory]: Interpolants [142338#(<= Main_x 1), 142339#(<= Main_x 2), 142336#false, 142337#(<= Main_x 0), 142342#(<= Main_x 5), 142343#(<= Main_x 6), 142340#(<= Main_x 3), 142341#(<= Main_x 4), 142346#(<= Main_x 9), 142347#(<= Main_x 10), 142344#(<= Main_x 7), 142345#(<= Main_x 8), 142350#(<= Main_x 13), 142351#(<= Main_x 14), 142348#(<= Main_x 11), 142349#(<= Main_x 12), 142354#(<= Main_x 17), 142355#(<= Main_x 18), 142352#(<= Main_x 15), 142353#(<= Main_x 16), 142358#(<= Main_x 21), 142359#(<= Main_x 22), 142356#(<= Main_x 19), 142357#(<= Main_x 20), 142362#(<= Main_x 25), 142363#(<= Main_x 26), 142360#(<= Main_x 23), 142361#(<= Main_x 24), 142366#(<= Main_x 29), 142367#(<= Main_x 30), 142364#(<= Main_x 27), 142365#(<= Main_x 28), 142370#(<= Main_x 33), 142371#(<= Main_x 34), 142368#(<= Main_x 31), 142369#(<= Main_x 32), 142374#(<= Main_x 37), 142375#(<= Main_x 38), 142372#(<= Main_x 35), 142373#(<= Main_x 36), 142378#(<= Main_x 41), 142379#(<= Main_x 42), 142376#(<= Main_x 39), 142377#(<= Main_x 40), 142382#(<= Main_x 45), 142383#(<= Main_x 46), 142380#(<= Main_x 43), 142381#(<= Main_x 44), 142386#(<= Main_x 49), 142387#(<= Main_x 50), 142384#(<= Main_x 47), 142385#(<= Main_x 48), 142390#(<= Main_x 53), 142391#(<= Main_x 54), 142388#(<= Main_x 51), 142389#(<= Main_x 52), 142394#(<= Main_x 57), 142395#(<= Main_x 58), 142392#(<= Main_x 55), 142393#(<= Main_x 56), 142398#(<= Main_x 61), 142399#(<= Main_x 62), 142396#(<= Main_x 59), 142397#(<= Main_x 60), 142402#(<= Main_x 65), 142403#(<= Main_x 66), 142400#(<= Main_x 63), 142401#(<= Main_x 64), 142406#(<= Main_x 69), 142407#(<= Main_x 70), 142404#(<= Main_x 67), 142405#(<= Main_x 68), 142410#(<= Main_x 73), 142411#(<= Main_x 74), 142408#(<= Main_x 71), 142409#(<= Main_x 72), 142414#(<= Main_x 77), 142415#(<= Main_x 78), 142412#(<= Main_x 75), 142413#(<= Main_x 76), 142418#(<= Main_x 81), 142419#(<= Main_x 82), 142416#(<= Main_x 79), 142417#(<= Main_x 80), 142422#(<= Main_x 85), 142423#(<= Main_x 86), 142420#(<= Main_x 83), 142421#(<= Main_x 84), 142426#(<= Main_x 89), 142427#(<= Main_x 90), 142424#(<= Main_x 87), 142425#(<= Main_x 88), 142430#(<= (+ Main_x 1) 0), 142428#(<= Main_x 91), 142429#(<= Main_x 92), 142335#true] [2018-07-23 13:58:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:18,449 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:58:18,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:58:18,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:58:18,450 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 96 states. [2018-07-23 13:58:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:19,058 INFO L93 Difference]: Finished difference Result 288 states and 290 transitions. [2018-07-23 13:58:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:58:19,058 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-23 13:58:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:19,058 INFO L225 Difference]: With dead ends: 288 [2018-07-23 13:58:19,058 INFO L226 Difference]: Without dead ends: 191 [2018-07-23 13:58:19,059 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:58:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-23 13:58:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-23 13:58:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-23 13:58:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-07-23 13:58:19,219 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 190 [2018-07-23 13:58:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:19,219 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-07-23 13:58:19,219 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:58:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-07-23 13:58:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 13:58:19,220 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:19,220 INFO L357 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2018-07-23 13:58:19,220 INFO L414 AbstractCegarLoop]: === Iteration 279 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash -895828499, now seen corresponding path program 276 times [2018-07-23 13:58:19,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:19,617 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:19,617 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:58:19,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:19,617 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:58:19,618 INFO L185 omatonBuilderFactory]: Interpolants [143390#false, 143391#(<= 0 Main_x), 143389#true, 143394#(<= 3 Main_x), 143395#(<= 4 Main_x), 143392#(<= 1 Main_x), 143393#(<= 2 Main_x), 143398#(<= 7 Main_x), 143399#(<= 8 Main_x), 143396#(<= 5 Main_x), 143397#(<= 6 Main_x), 143402#(<= 11 Main_x), 143403#(<= 12 Main_x), 143400#(<= 9 Main_x), 143401#(<= 10 Main_x), 143406#(<= 15 Main_x), 143407#(<= 16 Main_x), 143404#(<= 13 Main_x), 143405#(<= 14 Main_x), 143410#(<= 19 Main_x), 143411#(<= 20 Main_x), 143408#(<= 17 Main_x), 143409#(<= 18 Main_x), 143414#(<= 23 Main_x), 143415#(<= 24 Main_x), 143412#(<= 21 Main_x), 143413#(<= 22 Main_x), 143418#(<= 27 Main_x), 143419#(<= 28 Main_x), 143416#(<= 25 Main_x), 143417#(<= 26 Main_x), 143422#(<= 31 Main_x), 143423#(<= 32 Main_x), 143420#(<= 29 Main_x), 143421#(<= 30 Main_x), 143426#(<= 35 Main_x), 143427#(<= 36 Main_x), 143424#(<= 33 Main_x), 143425#(<= 34 Main_x), 143430#(<= 39 Main_x), 143431#(<= 40 Main_x), 143428#(<= 37 Main_x), 143429#(<= 38 Main_x), 143434#(<= 43 Main_x), 143435#(<= 44 Main_x), 143432#(<= 41 Main_x), 143433#(<= 42 Main_x), 143438#(<= 47 Main_x), 143439#(<= 48 Main_x), 143436#(<= 45 Main_x), 143437#(<= 46 Main_x), 143442#(<= 51 Main_x), 143443#(<= 52 Main_x), 143440#(<= 49 Main_x), 143441#(<= 50 Main_x), 143446#(<= 55 Main_x), 143447#(<= 56 Main_x), 143444#(<= 53 Main_x), 143445#(<= 54 Main_x), 143450#(<= 59 Main_x), 143451#(<= 60 Main_x), 143448#(<= 57 Main_x), 143449#(<= 58 Main_x), 143454#(<= 63 Main_x), 143455#(<= 64 Main_x), 143452#(<= 61 Main_x), 143453#(<= 62 Main_x), 143458#(<= 67 Main_x), 143459#(<= 68 Main_x), 143456#(<= 65 Main_x), 143457#(<= 66 Main_x), 143462#(<= 71 Main_x), 143463#(<= 72 Main_x), 143460#(<= 69 Main_x), 143461#(<= 70 Main_x), 143466#(<= 75 Main_x), 143467#(<= 76 Main_x), 143464#(<= 73 Main_x), 143465#(<= 74 Main_x), 143470#(<= 79 Main_x), 143471#(<= 80 Main_x), 143468#(<= 77 Main_x), 143469#(<= 78 Main_x), 143474#(<= 83 Main_x), 143475#(<= 84 Main_x), 143472#(<= 81 Main_x), 143473#(<= 82 Main_x), 143478#(<= 87 Main_x), 143479#(<= 88 Main_x), 143476#(<= 85 Main_x), 143477#(<= 86 Main_x), 143482#(<= 91 Main_x), 143483#(<= 92 Main_x), 143480#(<= 89 Main_x), 143481#(<= 90 Main_x), 143484#(<= 93 Main_x)] [2018-07-23 13:58:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 4371 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:19,618 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:58:19,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:58:19,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:58:19,619 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-07-23 13:58:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:19,851 INFO L93 Difference]: Finished difference Result 195 states and 196 transitions. [2018-07-23 13:58:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:58:19,851 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-23 13:58:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:19,851 INFO L225 Difference]: With dead ends: 195 [2018-07-23 13:58:19,851 INFO L226 Difference]: Without dead ends: 192 [2018-07-23 13:58:19,852 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:58:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-23 13:58:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-23 13:58:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-23 13:58:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-07-23 13:58:20,030 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 190 [2018-07-23 13:58:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:20,030 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-07-23 13:58:20,030 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:58:20,030 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-07-23 13:58:20,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-23 13:58:20,031 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:20,031 INFO L357 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1] [2018-07-23 13:58:20,031 INFO L414 AbstractCegarLoop]: === Iteration 280 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2000941215, now seen corresponding path program 277 times [2018-07-23 13:58:20,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:20,657 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:20,657 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:58:20,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:20,658 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:58:20,658 INFO L185 omatonBuilderFactory]: Interpolants [144259#true, 144262#(and (<= 1 Main_y) (<= Main_y 1)), 144263#(and (<= Main_y 2) (<= 2 Main_y)), 144260#false, 144261#(and (<= 0 Main_y) (<= Main_y 0)), 144266#(and (<= Main_y 5) (<= 5 Main_y)), 144267#(and (<= Main_y 6) (<= 6 Main_y)), 144264#(and (<= Main_y 3) (<= 3 Main_y)), 144265#(and (<= Main_y 4) (<= 4 Main_y)), 144270#(and (<= Main_y 9) (<= 9 Main_y)), 144271#(and (<= 10 Main_y) (<= Main_y 10)), 144268#(and (<= 7 Main_y) (<= Main_y 7)), 144269#(and (<= 8 Main_y) (<= Main_y 8)), 144274#(and (<= 13 Main_y) (<= Main_y 13)), 144275#(and (<= 14 Main_y) (<= Main_y 14)), 144272#(and (<= 11 Main_y) (<= Main_y 11)), 144273#(and (<= 12 Main_y) (<= Main_y 12)), 144278#(and (<= Main_y 17) (<= 17 Main_y)), 144279#(and (<= Main_y 18) (<= 18 Main_y)), 144276#(and (<= Main_y 15) (<= 15 Main_y)), 144277#(and (<= 16 Main_y) (<= Main_y 16)), 144282#(and (<= 21 Main_y) (<= Main_y 21)), 144283#(and (<= Main_y 22) (<= 22 Main_y)), 144280#(and (<= Main_y 19) (<= 19 Main_y)), 144281#(and (<= 20 Main_y) (<= Main_y 20)), 144286#(and (<= 25 Main_y) (<= Main_y 25)), 144287#(and (<= Main_y 26) (<= 26 Main_y)), 144284#(and (<= 23 Main_y) (<= Main_y 23)), 144285#(and (<= Main_y 24) (<= 24 Main_y)), 144290#(and (<= 29 Main_y) (<= Main_y 29)), 144291#(and (<= 30 Main_y) (<= Main_y 30)), 144288#(and (<= 27 Main_y) (<= Main_y 27)), 144289#(and (<= 28 Main_y) (<= Main_y 28)), 144294#(and (<= 33 Main_y) (<= Main_y 33)), 144295#(and (<= Main_y 34) (<= 34 Main_y)), 144292#(and (<= Main_y 31) (<= 31 Main_y)), 144293#(and (<= 32 Main_y) (<= Main_y 32)), 144298#(and (<= Main_y 37) (<= 37 Main_y)), 144299#(and (<= Main_y 38) (<= 38 Main_y)), 144296#(and (<= 35 Main_y) (<= Main_y 35)), 144297#(and (<= 36 Main_y) (<= Main_y 36)), 144302#(and (<= Main_y 41) (<= 41 Main_y)), 144303#(and (<= 42 Main_y) (<= Main_y 42)), 144300#(and (<= 39 Main_y) (<= Main_y 39)), 144301#(and (<= 40 Main_y) (<= Main_y 40)), 144306#(and (<= Main_y 45) (<= 45 Main_y)), 144307#(and (<= 46 Main_y) (<= Main_y 46)), 144304#(and (<= 43 Main_y) (<= Main_y 43)), 144305#(and (<= 44 Main_y) (<= Main_y 44)), 144310#(and (<= 49 Main_y) (<= Main_y 49)), 144311#(and (<= 50 Main_y) (<= Main_y 50)), 144308#(and (<= 47 Main_y) (<= Main_y 47)), 144309#(and (<= 48 Main_y) (<= Main_y 48)), 144314#(and (<= 53 Main_y) (<= Main_y 53)), 144315#(and (<= 54 Main_y) (<= Main_y 54)), 144312#(and (<= 51 Main_y) (<= Main_y 51)), 144313#(and (<= 52 Main_y) (<= Main_y 52)), 144318#(and (<= Main_y 57) (<= 57 Main_y)), 144319#(and (<= Main_y 58) (<= 58 Main_y)), 144316#(and (<= 55 Main_y) (<= Main_y 55)), 144317#(and (<= Main_y 56) (<= 56 Main_y)), 144322#(and (<= Main_y 61) (<= 61 Main_y)), 144323#(and (<= 62 Main_y) (<= Main_y 62)), 144320#(and (<= Main_y 59) (<= 59 Main_y)), 144321#(and (<= Main_y 60) (<= 60 Main_y)), 144326#(and (<= Main_y 65) (<= 65 Main_y)), 144327#(and (<= Main_y 66) (<= 66 Main_y)), 144324#(and (<= 63 Main_y) (<= Main_y 63)), 144325#(and (<= 64 Main_y) (<= Main_y 64)), 144330#(and (<= Main_y 69) (<= 69 Main_y)), 144331#(and (<= 70 Main_y) (<= Main_y 70)), 144328#(and (<= 67 Main_y) (<= Main_y 67)), 144329#(and (<= 68 Main_y) (<= Main_y 68)), 144334#(and (<= 73 Main_y) (<= Main_y 73)), 144335#(and (<= 74 Main_y) (<= Main_y 74)), 144332#(and (<= Main_y 71) (<= 71 Main_y)), 144333#(and (<= 72 Main_y) (<= Main_y 72)), 144338#(and (<= Main_y 77) (<= 77 Main_y)), 144339#(and (<= Main_y 78) (<= 78 Main_y)), 144336#(and (<= Main_y 75) (<= 75 Main_y)), 144337#(and (<= Main_y 76) (<= 76 Main_y)), 144342#(and (<= 81 Main_y) (<= Main_y 81)), 144343#(and (<= Main_y 82) (<= 82 Main_y)), 144340#(and (<= 79 Main_y) (<= Main_y 79)), 144341#(and (<= Main_y 80) (<= 80 Main_y)), 144346#(and (<= Main_y 85) (<= 85 Main_y)), 144347#(and (<= 86 Main_y) (<= Main_y 86)), 144344#(and (<= Main_y 83) (<= 83 Main_y)), 144345#(and (<= Main_y 84) (<= 84 Main_y)), 144350#(and (<= Main_y 89) (<= 89 Main_y)), 144351#(and (<= Main_y 90) (<= 90 Main_y)), 144348#(and (<= Main_y 87) (<= 87 Main_y)), 144349#(and (<= Main_y 88) (<= 88 Main_y)), 144354#(and (<= 93 Main_y) (<= Main_y 93)), 144352#(and (<= Main_y 91) (<= 91 Main_y)), 144353#(and (<= 92 Main_y) (<= Main_y 92))] [2018-07-23 13:58:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:20,659 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:58:20,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:58:20,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:58:20,660 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 96 states. [2018-07-23 13:58:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:21,998 INFO L93 Difference]: Finished difference Result 290 states and 292 transitions. [2018-07-23 13:58:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:58:21,999 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 191 [2018-07-23 13:58:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:21,999 INFO L225 Difference]: With dead ends: 290 [2018-07-23 13:58:21,999 INFO L226 Difference]: Without dead ends: 287 [2018-07-23 13:58:22,000 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:58:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-23 13:58:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 194. [2018-07-23 13:58:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 13:58:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2018-07-23 13:58:22,174 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 191 [2018-07-23 13:58:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:22,174 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2018-07-23 13:58:22,174 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:58:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2018-07-23 13:58:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 13:58:22,175 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:22,175 INFO L357 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2018-07-23 13:58:22,175 INFO L414 AbstractCegarLoop]: === Iteration 281 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1899697043, now seen corresponding path program 278 times [2018-07-23 13:58:22,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 4465 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:22,529 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:22,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:58:22,530 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:22,530 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:58:22,530 INFO L185 omatonBuilderFactory]: Interpolants [145410#(<= Main_x 85), 145411#(<= Main_x 86), 145408#(<= Main_x 83), 145409#(<= Main_x 84), 145414#(<= Main_x 89), 145415#(<= Main_x 90), 145412#(<= Main_x 87), 145413#(<= Main_x 88), 145418#(<= Main_x 93), 145419#(<= (+ Main_x 1) 0), 145416#(<= Main_x 91), 145417#(<= Main_x 92), 145323#true, 145326#(<= Main_x 1), 145327#(<= Main_x 2), 145324#false, 145325#(<= Main_x 0), 145330#(<= Main_x 5), 145331#(<= Main_x 6), 145328#(<= Main_x 3), 145329#(<= Main_x 4), 145334#(<= Main_x 9), 145335#(<= Main_x 10), 145332#(<= Main_x 7), 145333#(<= Main_x 8), 145338#(<= Main_x 13), 145339#(<= Main_x 14), 145336#(<= Main_x 11), 145337#(<= Main_x 12), 145342#(<= Main_x 17), 145343#(<= Main_x 18), 145340#(<= Main_x 15), 145341#(<= Main_x 16), 145346#(<= Main_x 21), 145347#(<= Main_x 22), 145344#(<= Main_x 19), 145345#(<= Main_x 20), 145350#(<= Main_x 25), 145351#(<= Main_x 26), 145348#(<= Main_x 23), 145349#(<= Main_x 24), 145354#(<= Main_x 29), 145355#(<= Main_x 30), 145352#(<= Main_x 27), 145353#(<= Main_x 28), 145358#(<= Main_x 33), 145359#(<= Main_x 34), 145356#(<= Main_x 31), 145357#(<= Main_x 32), 145362#(<= Main_x 37), 145363#(<= Main_x 38), 145360#(<= Main_x 35), 145361#(<= Main_x 36), 145366#(<= Main_x 41), 145367#(<= Main_x 42), 145364#(<= Main_x 39), 145365#(<= Main_x 40), 145370#(<= Main_x 45), 145371#(<= Main_x 46), 145368#(<= Main_x 43), 145369#(<= Main_x 44), 145374#(<= Main_x 49), 145375#(<= Main_x 50), 145372#(<= Main_x 47), 145373#(<= Main_x 48), 145378#(<= Main_x 53), 145379#(<= Main_x 54), 145376#(<= Main_x 51), 145377#(<= Main_x 52), 145382#(<= Main_x 57), 145383#(<= Main_x 58), 145380#(<= Main_x 55), 145381#(<= Main_x 56), 145386#(<= Main_x 61), 145387#(<= Main_x 62), 145384#(<= Main_x 59), 145385#(<= Main_x 60), 145390#(<= Main_x 65), 145391#(<= Main_x 66), 145388#(<= Main_x 63), 145389#(<= Main_x 64), 145394#(<= Main_x 69), 145395#(<= Main_x 70), 145392#(<= Main_x 67), 145393#(<= Main_x 68), 145398#(<= Main_x 73), 145399#(<= Main_x 74), 145396#(<= Main_x 71), 145397#(<= Main_x 72), 145402#(<= Main_x 77), 145403#(<= Main_x 78), 145400#(<= Main_x 75), 145401#(<= Main_x 76), 145406#(<= Main_x 81), 145407#(<= Main_x 82), 145404#(<= Main_x 79), 145405#(<= Main_x 80)] [2018-07-23 13:58:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 4465 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:22,531 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:58:22,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:58:22,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:58:22,532 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand 97 states. [2018-07-23 13:58:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:23,021 INFO L93 Difference]: Finished difference Result 291 states and 293 transitions. [2018-07-23 13:58:23,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:58:23,022 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-23 13:58:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:23,022 INFO L225 Difference]: With dead ends: 291 [2018-07-23 13:58:23,022 INFO L226 Difference]: Without dead ends: 193 [2018-07-23 13:58:23,023 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:58:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-23 13:58:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-23 13:58:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 13:58:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-07-23 13:58:23,183 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 192 [2018-07-23 13:58:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:23,183 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-07-23 13:58:23,183 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:58:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-07-23 13:58:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 13:58:23,184 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:23,184 INFO L357 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2018-07-23 13:58:23,184 INFO L414 AbstractCegarLoop]: === Iteration 282 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1734358151, now seen corresponding path program 279 times [2018-07-23 13:58:23,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 4465 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:23,562 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:23,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:58:23,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:23,562 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:58:23,562 INFO L185 omatonBuilderFactory]: Interpolants [146434#(<= 44 Main_x), 146435#(<= 45 Main_x), 146432#(<= 42 Main_x), 146433#(<= 43 Main_x), 146438#(<= 48 Main_x), 146439#(<= 49 Main_x), 146436#(<= 46 Main_x), 146437#(<= 47 Main_x), 146442#(<= 52 Main_x), 146443#(<= 53 Main_x), 146440#(<= 50 Main_x), 146441#(<= 51 Main_x), 146446#(<= 56 Main_x), 146447#(<= 57 Main_x), 146444#(<= 54 Main_x), 146445#(<= 55 Main_x), 146450#(<= 60 Main_x), 146451#(<= 61 Main_x), 146448#(<= 58 Main_x), 146449#(<= 59 Main_x), 146454#(<= 64 Main_x), 146455#(<= 65 Main_x), 146452#(<= 62 Main_x), 146453#(<= 63 Main_x), 146458#(<= 68 Main_x), 146459#(<= 69 Main_x), 146456#(<= 66 Main_x), 146457#(<= 67 Main_x), 146462#(<= 72 Main_x), 146463#(<= 73 Main_x), 146460#(<= 70 Main_x), 146461#(<= 71 Main_x), 146466#(<= 76 Main_x), 146467#(<= 77 Main_x), 146464#(<= 74 Main_x), 146465#(<= 75 Main_x), 146470#(<= 80 Main_x), 146471#(<= 81 Main_x), 146468#(<= 78 Main_x), 146469#(<= 79 Main_x), 146474#(<= 84 Main_x), 146475#(<= 85 Main_x), 146472#(<= 82 Main_x), 146473#(<= 83 Main_x), 146478#(<= 88 Main_x), 146479#(<= 89 Main_x), 146476#(<= 86 Main_x), 146477#(<= 87 Main_x), 146482#(<= 92 Main_x), 146483#(<= 93 Main_x), 146480#(<= 90 Main_x), 146481#(<= 91 Main_x), 146484#(<= 94 Main_x), 146390#(<= 0 Main_x), 146391#(<= 1 Main_x), 146388#true, 146389#false, 146394#(<= 4 Main_x), 146395#(<= 5 Main_x), 146392#(<= 2 Main_x), 146393#(<= 3 Main_x), 146398#(<= 8 Main_x), 146399#(<= 9 Main_x), 146396#(<= 6 Main_x), 146397#(<= 7 Main_x), 146402#(<= 12 Main_x), 146403#(<= 13 Main_x), 146400#(<= 10 Main_x), 146401#(<= 11 Main_x), 146406#(<= 16 Main_x), 146407#(<= 17 Main_x), 146404#(<= 14 Main_x), 146405#(<= 15 Main_x), 146410#(<= 20 Main_x), 146411#(<= 21 Main_x), 146408#(<= 18 Main_x), 146409#(<= 19 Main_x), 146414#(<= 24 Main_x), 146415#(<= 25 Main_x), 146412#(<= 22 Main_x), 146413#(<= 23 Main_x), 146418#(<= 28 Main_x), 146419#(<= 29 Main_x), 146416#(<= 26 Main_x), 146417#(<= 27 Main_x), 146422#(<= 32 Main_x), 146423#(<= 33 Main_x), 146420#(<= 30 Main_x), 146421#(<= 31 Main_x), 146426#(<= 36 Main_x), 146427#(<= 37 Main_x), 146424#(<= 34 Main_x), 146425#(<= 35 Main_x), 146430#(<= 40 Main_x), 146431#(<= 41 Main_x), 146428#(<= 38 Main_x), 146429#(<= 39 Main_x)] [2018-07-23 13:58:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 4465 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:23,563 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:58:23,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:58:23,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:58:23,563 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-07-23 13:58:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:23,798 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-07-23 13:58:23,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:58:23,798 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-23 13:58:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:23,798 INFO L225 Difference]: With dead ends: 197 [2018-07-23 13:58:23,798 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 13:58:23,799 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:58:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 13:58:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-23 13:58:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-23 13:58:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2018-07-23 13:58:23,966 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 195 transitions. Word has length 192 [2018-07-23 13:58:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:23,966 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 195 transitions. [2018-07-23 13:58:23,966 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:58:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 195 transitions. [2018-07-23 13:58:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-23 13:58:23,967 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:23,967 INFO L357 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1] [2018-07-23 13:58:23,967 INFO L414 AbstractCegarLoop]: === Iteration 283 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:23,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2069533689, now seen corresponding path program 280 times [2018-07-23 13:58:23,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:24,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:24,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:58:24,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:24,535 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:58:24,536 INFO L185 omatonBuilderFactory]: Interpolants [147267#true, 147270#(and (<= 1 Main_y) (<= Main_y 1)), 147271#(and (<= Main_y 2) (<= 2 Main_y)), 147268#false, 147269#(and (<= 0 Main_y) (<= Main_y 0)), 147274#(and (<= Main_y 5) (<= 5 Main_y)), 147275#(and (<= Main_y 6) (<= 6 Main_y)), 147272#(and (<= Main_y 3) (<= 3 Main_y)), 147273#(and (<= Main_y 4) (<= 4 Main_y)), 147278#(and (<= Main_y 9) (<= 9 Main_y)), 147279#(and (<= 10 Main_y) (<= Main_y 10)), 147276#(and (<= 7 Main_y) (<= Main_y 7)), 147277#(and (<= 8 Main_y) (<= Main_y 8)), 147282#(and (<= 13 Main_y) (<= Main_y 13)), 147283#(and (<= 14 Main_y) (<= Main_y 14)), 147280#(and (<= 11 Main_y) (<= Main_y 11)), 147281#(and (<= 12 Main_y) (<= Main_y 12)), 147286#(and (<= Main_y 17) (<= 17 Main_y)), 147287#(and (<= Main_y 18) (<= 18 Main_y)), 147284#(and (<= Main_y 15) (<= 15 Main_y)), 147285#(and (<= 16 Main_y) (<= Main_y 16)), 147290#(and (<= 21 Main_y) (<= Main_y 21)), 147291#(and (<= Main_y 22) (<= 22 Main_y)), 147288#(and (<= Main_y 19) (<= 19 Main_y)), 147289#(and (<= 20 Main_y) (<= Main_y 20)), 147294#(and (<= 25 Main_y) (<= Main_y 25)), 147295#(and (<= Main_y 26) (<= 26 Main_y)), 147292#(and (<= 23 Main_y) (<= Main_y 23)), 147293#(and (<= Main_y 24) (<= 24 Main_y)), 147298#(and (<= 29 Main_y) (<= Main_y 29)), 147299#(and (<= 30 Main_y) (<= Main_y 30)), 147296#(and (<= 27 Main_y) (<= Main_y 27)), 147297#(and (<= 28 Main_y) (<= Main_y 28)), 147302#(and (<= 33 Main_y) (<= Main_y 33)), 147303#(and (<= Main_y 34) (<= 34 Main_y)), 147300#(and (<= Main_y 31) (<= 31 Main_y)), 147301#(and (<= 32 Main_y) (<= Main_y 32)), 147306#(and (<= Main_y 37) (<= 37 Main_y)), 147307#(and (<= Main_y 38) (<= 38 Main_y)), 147304#(and (<= 35 Main_y) (<= Main_y 35)), 147305#(and (<= 36 Main_y) (<= Main_y 36)), 147310#(and (<= Main_y 41) (<= 41 Main_y)), 147311#(and (<= 42 Main_y) (<= Main_y 42)), 147308#(and (<= 39 Main_y) (<= Main_y 39)), 147309#(and (<= 40 Main_y) (<= Main_y 40)), 147314#(and (<= Main_y 45) (<= 45 Main_y)), 147315#(and (<= 46 Main_y) (<= Main_y 46)), 147312#(and (<= 43 Main_y) (<= Main_y 43)), 147313#(and (<= 44 Main_y) (<= Main_y 44)), 147318#(and (<= 49 Main_y) (<= Main_y 49)), 147319#(and (<= 50 Main_y) (<= Main_y 50)), 147316#(and (<= 47 Main_y) (<= Main_y 47)), 147317#(and (<= 48 Main_y) (<= Main_y 48)), 147322#(and (<= 53 Main_y) (<= Main_y 53)), 147323#(and (<= 54 Main_y) (<= Main_y 54)), 147320#(and (<= 51 Main_y) (<= Main_y 51)), 147321#(and (<= 52 Main_y) (<= Main_y 52)), 147326#(and (<= Main_y 57) (<= 57 Main_y)), 147327#(and (<= Main_y 58) (<= 58 Main_y)), 147324#(and (<= 55 Main_y) (<= Main_y 55)), 147325#(and (<= Main_y 56) (<= 56 Main_y)), 147330#(and (<= Main_y 61) (<= 61 Main_y)), 147331#(and (<= 62 Main_y) (<= Main_y 62)), 147328#(and (<= Main_y 59) (<= 59 Main_y)), 147329#(and (<= Main_y 60) (<= 60 Main_y)), 147334#(and (<= Main_y 65) (<= 65 Main_y)), 147335#(and (<= Main_y 66) (<= 66 Main_y)), 147332#(and (<= 63 Main_y) (<= Main_y 63)), 147333#(and (<= 64 Main_y) (<= Main_y 64)), 147338#(and (<= Main_y 69) (<= 69 Main_y)), 147339#(and (<= 70 Main_y) (<= Main_y 70)), 147336#(and (<= 67 Main_y) (<= Main_y 67)), 147337#(and (<= 68 Main_y) (<= Main_y 68)), 147342#(and (<= 73 Main_y) (<= Main_y 73)), 147343#(and (<= 74 Main_y) (<= Main_y 74)), 147340#(and (<= Main_y 71) (<= 71 Main_y)), 147341#(and (<= 72 Main_y) (<= Main_y 72)), 147346#(and (<= Main_y 77) (<= 77 Main_y)), 147347#(and (<= Main_y 78) (<= 78 Main_y)), 147344#(and (<= Main_y 75) (<= 75 Main_y)), 147345#(and (<= Main_y 76) (<= 76 Main_y)), 147350#(and (<= 81 Main_y) (<= Main_y 81)), 147351#(and (<= Main_y 82) (<= 82 Main_y)), 147348#(and (<= 79 Main_y) (<= Main_y 79)), 147349#(and (<= Main_y 80) (<= 80 Main_y)), 147354#(and (<= Main_y 85) (<= 85 Main_y)), 147355#(and (<= 86 Main_y) (<= Main_y 86)), 147352#(and (<= Main_y 83) (<= 83 Main_y)), 147353#(and (<= Main_y 84) (<= 84 Main_y)), 147358#(and (<= Main_y 89) (<= 89 Main_y)), 147359#(and (<= Main_y 90) (<= 90 Main_y)), 147356#(and (<= Main_y 87) (<= 87 Main_y)), 147357#(and (<= Main_y 88) (<= 88 Main_y)), 147362#(and (<= 93 Main_y) (<= Main_y 93)), 147363#(and (<= 94 Main_y) (<= Main_y 94)), 147360#(and (<= Main_y 91) (<= 91 Main_y)), 147361#(and (<= 92 Main_y) (<= Main_y 92))] [2018-07-23 13:58:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:24,536 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:58:24,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:58:24,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:58:24,537 INFO L87 Difference]: Start difference. First operand 194 states and 195 transitions. Second operand 97 states. [2018-07-23 13:58:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:25,887 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-07-23 13:58:25,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:58:25,887 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 193 [2018-07-23 13:58:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:25,887 INFO L225 Difference]: With dead ends: 293 [2018-07-23 13:58:25,887 INFO L226 Difference]: Without dead ends: 290 [2018-07-23 13:58:25,888 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:58:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-23 13:58:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 196. [2018-07-23 13:58:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-23 13:58:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-07-23 13:58:26,093 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 193 [2018-07-23 13:58:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:26,093 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-07-23 13:58:26,093 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:58:26,093 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-07-23 13:58:26,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-23 13:58:26,094 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:26,094 INFO L357 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2018-07-23 13:58:26,094 INFO L414 AbstractCegarLoop]: === Iteration 284 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash 268903559, now seen corresponding path program 281 times [2018-07-23 13:58:26,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:26,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:26,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:26,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:58:26,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:26,538 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:58:26,538 INFO L185 omatonBuilderFactory]: Interpolants [148342#true, 148343#false, 148346#(<= Main_x 2), 148347#(<= Main_x 3), 148344#(<= Main_x 0), 148345#(<= Main_x 1), 148350#(<= Main_x 6), 148351#(<= Main_x 7), 148348#(<= Main_x 4), 148349#(<= Main_x 5), 148354#(<= Main_x 10), 148355#(<= Main_x 11), 148352#(<= Main_x 8), 148353#(<= Main_x 9), 148358#(<= Main_x 14), 148359#(<= Main_x 15), 148356#(<= Main_x 12), 148357#(<= Main_x 13), 148362#(<= Main_x 18), 148363#(<= Main_x 19), 148360#(<= Main_x 16), 148361#(<= Main_x 17), 148366#(<= Main_x 22), 148367#(<= Main_x 23), 148364#(<= Main_x 20), 148365#(<= Main_x 21), 148370#(<= Main_x 26), 148371#(<= Main_x 27), 148368#(<= Main_x 24), 148369#(<= Main_x 25), 148374#(<= Main_x 30), 148375#(<= Main_x 31), 148372#(<= Main_x 28), 148373#(<= Main_x 29), 148378#(<= Main_x 34), 148379#(<= Main_x 35), 148376#(<= Main_x 32), 148377#(<= Main_x 33), 148382#(<= Main_x 38), 148383#(<= Main_x 39), 148380#(<= Main_x 36), 148381#(<= Main_x 37), 148386#(<= Main_x 42), 148387#(<= Main_x 43), 148384#(<= Main_x 40), 148385#(<= Main_x 41), 148390#(<= Main_x 46), 148391#(<= Main_x 47), 148388#(<= Main_x 44), 148389#(<= Main_x 45), 148394#(<= Main_x 50), 148395#(<= Main_x 51), 148392#(<= Main_x 48), 148393#(<= Main_x 49), 148398#(<= Main_x 54), 148399#(<= Main_x 55), 148396#(<= Main_x 52), 148397#(<= Main_x 53), 148402#(<= Main_x 58), 148403#(<= Main_x 59), 148400#(<= Main_x 56), 148401#(<= Main_x 57), 148406#(<= Main_x 62), 148407#(<= Main_x 63), 148404#(<= Main_x 60), 148405#(<= Main_x 61), 148410#(<= Main_x 66), 148411#(<= Main_x 67), 148408#(<= Main_x 64), 148409#(<= Main_x 65), 148414#(<= Main_x 70), 148415#(<= Main_x 71), 148412#(<= Main_x 68), 148413#(<= Main_x 69), 148418#(<= Main_x 74), 148419#(<= Main_x 75), 148416#(<= Main_x 72), 148417#(<= Main_x 73), 148422#(<= Main_x 78), 148423#(<= Main_x 79), 148420#(<= Main_x 76), 148421#(<= Main_x 77), 148426#(<= Main_x 82), 148427#(<= Main_x 83), 148424#(<= Main_x 80), 148425#(<= Main_x 81), 148430#(<= Main_x 86), 148431#(<= Main_x 87), 148428#(<= Main_x 84), 148429#(<= Main_x 85), 148434#(<= Main_x 90), 148435#(<= Main_x 91), 148432#(<= Main_x 88), 148433#(<= Main_x 89), 148438#(<= Main_x 94), 148439#(<= (+ Main_x 1) 0), 148436#(<= Main_x 92), 148437#(<= Main_x 93)] [2018-07-23 13:58:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:26,538 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:58:26,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:58:26,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:58:26,539 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 98 states. [2018-07-23 13:58:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:27,058 INFO L93 Difference]: Finished difference Result 294 states and 296 transitions. [2018-07-23 13:58:27,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:58:27,058 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-23 13:58:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:27,059 INFO L225 Difference]: With dead ends: 294 [2018-07-23 13:58:27,059 INFO L226 Difference]: Without dead ends: 195 [2018-07-23 13:58:27,060 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:58:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-23 13:58:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-23 13:58:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-23 13:58:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-07-23 13:58:27,224 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 194 [2018-07-23 13:58:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:27,225 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-07-23 13:58:27,225 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:58:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-07-23 13:58:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-23 13:58:27,225 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:27,225 INFO L357 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2018-07-23 13:58:27,225 INFO L414 AbstractCegarLoop]: === Iteration 285 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1255464877, now seen corresponding path program 282 times [2018-07-23 13:58:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:27,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:27,654 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:58:27,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:27,654 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:58:27,654 INFO L185 omatonBuilderFactory]: Interpolants [149506#(<= 86 Main_x), 149507#(<= 87 Main_x), 149504#(<= 84 Main_x), 149505#(<= 85 Main_x), 149510#(<= 90 Main_x), 149511#(<= 91 Main_x), 149508#(<= 88 Main_x), 149509#(<= 89 Main_x), 149514#(<= 94 Main_x), 149515#(<= 95 Main_x), 149512#(<= 92 Main_x), 149513#(<= 93 Main_x), 149418#true, 149419#false, 149422#(<= 2 Main_x), 149423#(<= 3 Main_x), 149420#(<= 0 Main_x), 149421#(<= 1 Main_x), 149426#(<= 6 Main_x), 149427#(<= 7 Main_x), 149424#(<= 4 Main_x), 149425#(<= 5 Main_x), 149430#(<= 10 Main_x), 149431#(<= 11 Main_x), 149428#(<= 8 Main_x), 149429#(<= 9 Main_x), 149434#(<= 14 Main_x), 149435#(<= 15 Main_x), 149432#(<= 12 Main_x), 149433#(<= 13 Main_x), 149438#(<= 18 Main_x), 149439#(<= 19 Main_x), 149436#(<= 16 Main_x), 149437#(<= 17 Main_x), 149442#(<= 22 Main_x), 149443#(<= 23 Main_x), 149440#(<= 20 Main_x), 149441#(<= 21 Main_x), 149446#(<= 26 Main_x), 149447#(<= 27 Main_x), 149444#(<= 24 Main_x), 149445#(<= 25 Main_x), 149450#(<= 30 Main_x), 149451#(<= 31 Main_x), 149448#(<= 28 Main_x), 149449#(<= 29 Main_x), 149454#(<= 34 Main_x), 149455#(<= 35 Main_x), 149452#(<= 32 Main_x), 149453#(<= 33 Main_x), 149458#(<= 38 Main_x), 149459#(<= 39 Main_x), 149456#(<= 36 Main_x), 149457#(<= 37 Main_x), 149462#(<= 42 Main_x), 149463#(<= 43 Main_x), 149460#(<= 40 Main_x), 149461#(<= 41 Main_x), 149466#(<= 46 Main_x), 149467#(<= 47 Main_x), 149464#(<= 44 Main_x), 149465#(<= 45 Main_x), 149470#(<= 50 Main_x), 149471#(<= 51 Main_x), 149468#(<= 48 Main_x), 149469#(<= 49 Main_x), 149474#(<= 54 Main_x), 149475#(<= 55 Main_x), 149472#(<= 52 Main_x), 149473#(<= 53 Main_x), 149478#(<= 58 Main_x), 149479#(<= 59 Main_x), 149476#(<= 56 Main_x), 149477#(<= 57 Main_x), 149482#(<= 62 Main_x), 149483#(<= 63 Main_x), 149480#(<= 60 Main_x), 149481#(<= 61 Main_x), 149486#(<= 66 Main_x), 149487#(<= 67 Main_x), 149484#(<= 64 Main_x), 149485#(<= 65 Main_x), 149490#(<= 70 Main_x), 149491#(<= 71 Main_x), 149488#(<= 68 Main_x), 149489#(<= 69 Main_x), 149494#(<= 74 Main_x), 149495#(<= 75 Main_x), 149492#(<= 72 Main_x), 149493#(<= 73 Main_x), 149498#(<= 78 Main_x), 149499#(<= 79 Main_x), 149496#(<= 76 Main_x), 149497#(<= 77 Main_x), 149502#(<= 82 Main_x), 149503#(<= 83 Main_x), 149500#(<= 80 Main_x), 149501#(<= 81 Main_x)] [2018-07-23 13:58:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:27,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:58:27,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:58:27,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:58:27,655 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-07-23 13:58:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:27,881 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-07-23 13:58:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:58:27,882 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-23 13:58:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:27,882 INFO L225 Difference]: With dead ends: 199 [2018-07-23 13:58:27,882 INFO L226 Difference]: Without dead ends: 196 [2018-07-23 13:58:27,883 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:58:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-23 13:58:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-07-23 13:58:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-23 13:58:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 197 transitions. [2018-07-23 13:58:28,049 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 197 transitions. Word has length 194 [2018-07-23 13:58:28,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:28,049 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 197 transitions. [2018-07-23 13:58:28,049 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:58:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 197 transitions. [2018-07-23 13:58:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-23 13:58:28,049 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:28,049 INFO L357 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1] [2018-07-23 13:58:28,050 INFO L414 AbstractCegarLoop]: === Iteration 286 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash 264644001, now seen corresponding path program 283 times [2018-07-23 13:58:28,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:28,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:28,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:58:28,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:28,609 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:58:28,609 INFO L185 omatonBuilderFactory]: Interpolants [150306#true, 150307#false, 150310#(and (<= Main_y 2) (<= 2 Main_y)), 150311#(and (<= Main_y 3) (<= 3 Main_y)), 150308#(and (<= 0 Main_y) (<= Main_y 0)), 150309#(and (<= 1 Main_y) (<= Main_y 1)), 150314#(and (<= Main_y 6) (<= 6 Main_y)), 150315#(and (<= 7 Main_y) (<= Main_y 7)), 150312#(and (<= Main_y 4) (<= 4 Main_y)), 150313#(and (<= Main_y 5) (<= 5 Main_y)), 150318#(and (<= 10 Main_y) (<= Main_y 10)), 150319#(and (<= 11 Main_y) (<= Main_y 11)), 150316#(and (<= 8 Main_y) (<= Main_y 8)), 150317#(and (<= Main_y 9) (<= 9 Main_y)), 150322#(and (<= 14 Main_y) (<= Main_y 14)), 150323#(and (<= Main_y 15) (<= 15 Main_y)), 150320#(and (<= 12 Main_y) (<= Main_y 12)), 150321#(and (<= 13 Main_y) (<= Main_y 13)), 150326#(and (<= Main_y 18) (<= 18 Main_y)), 150327#(and (<= Main_y 19) (<= 19 Main_y)), 150324#(and (<= 16 Main_y) (<= Main_y 16)), 150325#(and (<= Main_y 17) (<= 17 Main_y)), 150330#(and (<= Main_y 22) (<= 22 Main_y)), 150331#(and (<= 23 Main_y) (<= Main_y 23)), 150328#(and (<= 20 Main_y) (<= Main_y 20)), 150329#(and (<= 21 Main_y) (<= Main_y 21)), 150334#(and (<= Main_y 26) (<= 26 Main_y)), 150335#(and (<= 27 Main_y) (<= Main_y 27)), 150332#(and (<= Main_y 24) (<= 24 Main_y)), 150333#(and (<= 25 Main_y) (<= Main_y 25)), 150338#(and (<= 30 Main_y) (<= Main_y 30)), 150339#(and (<= Main_y 31) (<= 31 Main_y)), 150336#(and (<= 28 Main_y) (<= Main_y 28)), 150337#(and (<= 29 Main_y) (<= Main_y 29)), 150342#(and (<= Main_y 34) (<= 34 Main_y)), 150343#(and (<= 35 Main_y) (<= Main_y 35)), 150340#(and (<= 32 Main_y) (<= Main_y 32)), 150341#(and (<= 33 Main_y) (<= Main_y 33)), 150346#(and (<= Main_y 38) (<= 38 Main_y)), 150347#(and (<= 39 Main_y) (<= Main_y 39)), 150344#(and (<= 36 Main_y) (<= Main_y 36)), 150345#(and (<= Main_y 37) (<= 37 Main_y)), 150350#(and (<= 42 Main_y) (<= Main_y 42)), 150351#(and (<= 43 Main_y) (<= Main_y 43)), 150348#(and (<= 40 Main_y) (<= Main_y 40)), 150349#(and (<= Main_y 41) (<= 41 Main_y)), 150354#(and (<= 46 Main_y) (<= Main_y 46)), 150355#(and (<= 47 Main_y) (<= Main_y 47)), 150352#(and (<= 44 Main_y) (<= Main_y 44)), 150353#(and (<= Main_y 45) (<= 45 Main_y)), 150358#(and (<= 50 Main_y) (<= Main_y 50)), 150359#(and (<= 51 Main_y) (<= Main_y 51)), 150356#(and (<= 48 Main_y) (<= Main_y 48)), 150357#(and (<= 49 Main_y) (<= Main_y 49)), 150362#(and (<= 54 Main_y) (<= Main_y 54)), 150363#(and (<= 55 Main_y) (<= Main_y 55)), 150360#(and (<= 52 Main_y) (<= Main_y 52)), 150361#(and (<= 53 Main_y) (<= Main_y 53)), 150366#(and (<= Main_y 58) (<= 58 Main_y)), 150367#(and (<= Main_y 59) (<= 59 Main_y)), 150364#(and (<= Main_y 56) (<= 56 Main_y)), 150365#(and (<= Main_y 57) (<= 57 Main_y)), 150370#(and (<= 62 Main_y) (<= Main_y 62)), 150371#(and (<= 63 Main_y) (<= Main_y 63)), 150368#(and (<= Main_y 60) (<= 60 Main_y)), 150369#(and (<= Main_y 61) (<= 61 Main_y)), 150374#(and (<= Main_y 66) (<= 66 Main_y)), 150375#(and (<= 67 Main_y) (<= Main_y 67)), 150372#(and (<= 64 Main_y) (<= Main_y 64)), 150373#(and (<= Main_y 65) (<= 65 Main_y)), 150378#(and (<= 70 Main_y) (<= Main_y 70)), 150379#(and (<= Main_y 71) (<= 71 Main_y)), 150376#(and (<= 68 Main_y) (<= Main_y 68)), 150377#(and (<= Main_y 69) (<= 69 Main_y)), 150382#(and (<= 74 Main_y) (<= Main_y 74)), 150383#(and (<= Main_y 75) (<= 75 Main_y)), 150380#(and (<= 72 Main_y) (<= Main_y 72)), 150381#(and (<= 73 Main_y) (<= Main_y 73)), 150386#(and (<= Main_y 78) (<= 78 Main_y)), 150387#(and (<= 79 Main_y) (<= Main_y 79)), 150384#(and (<= Main_y 76) (<= 76 Main_y)), 150385#(and (<= Main_y 77) (<= 77 Main_y)), 150390#(and (<= Main_y 82) (<= 82 Main_y)), 150391#(and (<= Main_y 83) (<= 83 Main_y)), 150388#(and (<= Main_y 80) (<= 80 Main_y)), 150389#(and (<= 81 Main_y) (<= Main_y 81)), 150394#(and (<= 86 Main_y) (<= Main_y 86)), 150395#(and (<= Main_y 87) (<= 87 Main_y)), 150392#(and (<= Main_y 84) (<= 84 Main_y)), 150393#(and (<= Main_y 85) (<= 85 Main_y)), 150398#(and (<= Main_y 90) (<= 90 Main_y)), 150399#(and (<= Main_y 91) (<= 91 Main_y)), 150396#(and (<= Main_y 88) (<= 88 Main_y)), 150397#(and (<= Main_y 89) (<= 89 Main_y)), 150402#(and (<= 94 Main_y) (<= Main_y 94)), 150403#(and (<= Main_y 95) (<= 95 Main_y)), 150400#(and (<= 92 Main_y) (<= Main_y 92)), 150401#(and (<= 93 Main_y) (<= Main_y 93))] [2018-07-23 13:58:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:28,610 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:58:28,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:58:28,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:58:28,611 INFO L87 Difference]: Start difference. First operand 196 states and 197 transitions. Second operand 98 states. [2018-07-23 13:58:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:30,036 INFO L93 Difference]: Finished difference Result 296 states and 298 transitions. [2018-07-23 13:58:30,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:58:30,036 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 195 [2018-07-23 13:58:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:30,037 INFO L225 Difference]: With dead ends: 296 [2018-07-23 13:58:30,037 INFO L226 Difference]: Without dead ends: 293 [2018-07-23 13:58:30,037 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:58:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-23 13:58:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 198. [2018-07-23 13:58:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-23 13:58:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2018-07-23 13:58:30,210 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 195 [2018-07-23 13:58:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:30,210 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2018-07-23 13:58:30,210 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:58:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2018-07-23 13:58:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 13:58:30,211 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:30,211 INFO L357 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2018-07-23 13:58:30,211 INFO L414 AbstractCegarLoop]: === Iteration 287 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -386032083, now seen corresponding path program 284 times [2018-07-23 13:58:30,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:30,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:30,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:58:30,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:30,583 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:58:30,583 INFO L185 omatonBuilderFactory]: Interpolants [151394#(<= Main_x 0), 151395#(<= Main_x 1), 151392#true, 151393#false, 151398#(<= Main_x 4), 151399#(<= Main_x 5), 151396#(<= Main_x 2), 151397#(<= Main_x 3), 151402#(<= Main_x 8), 151403#(<= Main_x 9), 151400#(<= Main_x 6), 151401#(<= Main_x 7), 151406#(<= Main_x 12), 151407#(<= Main_x 13), 151404#(<= Main_x 10), 151405#(<= Main_x 11), 151410#(<= Main_x 16), 151411#(<= Main_x 17), 151408#(<= Main_x 14), 151409#(<= Main_x 15), 151414#(<= Main_x 20), 151415#(<= Main_x 21), 151412#(<= Main_x 18), 151413#(<= Main_x 19), 151418#(<= Main_x 24), 151419#(<= Main_x 25), 151416#(<= Main_x 22), 151417#(<= Main_x 23), 151422#(<= Main_x 28), 151423#(<= Main_x 29), 151420#(<= Main_x 26), 151421#(<= Main_x 27), 151426#(<= Main_x 32), 151427#(<= Main_x 33), 151424#(<= Main_x 30), 151425#(<= Main_x 31), 151430#(<= Main_x 36), 151431#(<= Main_x 37), 151428#(<= Main_x 34), 151429#(<= Main_x 35), 151434#(<= Main_x 40), 151435#(<= Main_x 41), 151432#(<= Main_x 38), 151433#(<= Main_x 39), 151438#(<= Main_x 44), 151439#(<= Main_x 45), 151436#(<= Main_x 42), 151437#(<= Main_x 43), 151442#(<= Main_x 48), 151443#(<= Main_x 49), 151440#(<= Main_x 46), 151441#(<= Main_x 47), 151446#(<= Main_x 52), 151447#(<= Main_x 53), 151444#(<= Main_x 50), 151445#(<= Main_x 51), 151450#(<= Main_x 56), 151451#(<= Main_x 57), 151448#(<= Main_x 54), 151449#(<= Main_x 55), 151454#(<= Main_x 60), 151455#(<= Main_x 61), 151452#(<= Main_x 58), 151453#(<= Main_x 59), 151458#(<= Main_x 64), 151459#(<= Main_x 65), 151456#(<= Main_x 62), 151457#(<= Main_x 63), 151462#(<= Main_x 68), 151463#(<= Main_x 69), 151460#(<= Main_x 66), 151461#(<= Main_x 67), 151466#(<= Main_x 72), 151467#(<= Main_x 73), 151464#(<= Main_x 70), 151465#(<= Main_x 71), 151470#(<= Main_x 76), 151471#(<= Main_x 77), 151468#(<= Main_x 74), 151469#(<= Main_x 75), 151474#(<= Main_x 80), 151475#(<= Main_x 81), 151472#(<= Main_x 78), 151473#(<= Main_x 79), 151478#(<= Main_x 84), 151479#(<= Main_x 85), 151476#(<= Main_x 82), 151477#(<= Main_x 83), 151482#(<= Main_x 88), 151483#(<= Main_x 89), 151480#(<= Main_x 86), 151481#(<= Main_x 87), 151486#(<= Main_x 92), 151487#(<= Main_x 93), 151484#(<= Main_x 90), 151485#(<= Main_x 91), 151490#(<= (+ Main_x 1) 0), 151488#(<= Main_x 94), 151489#(<= Main_x 95)] [2018-07-23 13:58:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:30,583 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:58:30,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:58:30,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:58:30,584 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 99 states. [2018-07-23 13:58:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:31,114 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-07-23 13:58:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:58:31,114 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-23 13:58:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:31,115 INFO L225 Difference]: With dead ends: 297 [2018-07-23 13:58:31,115 INFO L226 Difference]: Without dead ends: 197 [2018-07-23 13:58:31,115 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:58:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-23 13:58:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-23 13:58:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 13:58:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-07-23 13:58:31,283 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 196 [2018-07-23 13:58:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:31,283 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-07-23 13:58:31,284 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:58:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-07-23 13:58:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 13:58:31,284 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:31,284 INFO L357 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2018-07-23 13:58:31,284 INFO L414 AbstractCegarLoop]: === Iteration 288 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash 132597703, now seen corresponding path program 285 times [2018-07-23 13:58:31,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:31,675 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:31,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:58:31,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:31,675 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:58:31,676 INFO L185 omatonBuilderFactory]: Interpolants [152576#(<= 95 Main_x), 152577#(<= 96 Main_x), 152479#true, 152482#(<= 1 Main_x), 152483#(<= 2 Main_x), 152480#false, 152481#(<= 0 Main_x), 152486#(<= 5 Main_x), 152487#(<= 6 Main_x), 152484#(<= 3 Main_x), 152485#(<= 4 Main_x), 152490#(<= 9 Main_x), 152491#(<= 10 Main_x), 152488#(<= 7 Main_x), 152489#(<= 8 Main_x), 152494#(<= 13 Main_x), 152495#(<= 14 Main_x), 152492#(<= 11 Main_x), 152493#(<= 12 Main_x), 152498#(<= 17 Main_x), 152499#(<= 18 Main_x), 152496#(<= 15 Main_x), 152497#(<= 16 Main_x), 152502#(<= 21 Main_x), 152503#(<= 22 Main_x), 152500#(<= 19 Main_x), 152501#(<= 20 Main_x), 152506#(<= 25 Main_x), 152507#(<= 26 Main_x), 152504#(<= 23 Main_x), 152505#(<= 24 Main_x), 152510#(<= 29 Main_x), 152511#(<= 30 Main_x), 152508#(<= 27 Main_x), 152509#(<= 28 Main_x), 152514#(<= 33 Main_x), 152515#(<= 34 Main_x), 152512#(<= 31 Main_x), 152513#(<= 32 Main_x), 152518#(<= 37 Main_x), 152519#(<= 38 Main_x), 152516#(<= 35 Main_x), 152517#(<= 36 Main_x), 152522#(<= 41 Main_x), 152523#(<= 42 Main_x), 152520#(<= 39 Main_x), 152521#(<= 40 Main_x), 152526#(<= 45 Main_x), 152527#(<= 46 Main_x), 152524#(<= 43 Main_x), 152525#(<= 44 Main_x), 152530#(<= 49 Main_x), 152531#(<= 50 Main_x), 152528#(<= 47 Main_x), 152529#(<= 48 Main_x), 152534#(<= 53 Main_x), 152535#(<= 54 Main_x), 152532#(<= 51 Main_x), 152533#(<= 52 Main_x), 152538#(<= 57 Main_x), 152539#(<= 58 Main_x), 152536#(<= 55 Main_x), 152537#(<= 56 Main_x), 152542#(<= 61 Main_x), 152543#(<= 62 Main_x), 152540#(<= 59 Main_x), 152541#(<= 60 Main_x), 152546#(<= 65 Main_x), 152547#(<= 66 Main_x), 152544#(<= 63 Main_x), 152545#(<= 64 Main_x), 152550#(<= 69 Main_x), 152551#(<= 70 Main_x), 152548#(<= 67 Main_x), 152549#(<= 68 Main_x), 152554#(<= 73 Main_x), 152555#(<= 74 Main_x), 152552#(<= 71 Main_x), 152553#(<= 72 Main_x), 152558#(<= 77 Main_x), 152559#(<= 78 Main_x), 152556#(<= 75 Main_x), 152557#(<= 76 Main_x), 152562#(<= 81 Main_x), 152563#(<= 82 Main_x), 152560#(<= 79 Main_x), 152561#(<= 80 Main_x), 152566#(<= 85 Main_x), 152567#(<= 86 Main_x), 152564#(<= 83 Main_x), 152565#(<= 84 Main_x), 152570#(<= 89 Main_x), 152571#(<= 90 Main_x), 152568#(<= 87 Main_x), 152569#(<= 88 Main_x), 152574#(<= 93 Main_x), 152575#(<= 94 Main_x), 152572#(<= 91 Main_x), 152573#(<= 92 Main_x)] [2018-07-23 13:58:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:31,676 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:58:31,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:58:31,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:58:31,677 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-07-23 13:58:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:31,893 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-07-23 13:58:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:58:31,893 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-23 13:58:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:31,894 INFO L225 Difference]: With dead ends: 201 [2018-07-23 13:58:31,894 INFO L226 Difference]: Without dead ends: 198 [2018-07-23 13:58:31,894 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:58:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-23 13:58:32,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-07-23 13:58:32,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-23 13:58:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-07-23 13:58:32,062 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 196 [2018-07-23 13:58:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:32,062 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-07-23 13:58:32,062 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:58:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-07-23 13:58:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-23 13:58:32,063 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:32,063 INFO L357 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1] [2018-07-23 13:58:32,063 INFO L414 AbstractCegarLoop]: === Iteration 289 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -184500025, now seen corresponding path program 286 times [2018-07-23 13:58:32,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:32,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:32,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:58:32,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:32,668 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:58:32,668 INFO L185 omatonBuilderFactory]: Interpolants [153378#(and (<= 0 Main_y) (<= Main_y 0)), 153379#(and (<= 1 Main_y) (<= Main_y 1)), 153376#true, 153377#false, 153382#(and (<= Main_y 4) (<= 4 Main_y)), 153383#(and (<= Main_y 5) (<= 5 Main_y)), 153380#(and (<= Main_y 2) (<= 2 Main_y)), 153381#(and (<= Main_y 3) (<= 3 Main_y)), 153386#(and (<= 8 Main_y) (<= Main_y 8)), 153387#(and (<= Main_y 9) (<= 9 Main_y)), 153384#(and (<= Main_y 6) (<= 6 Main_y)), 153385#(and (<= 7 Main_y) (<= Main_y 7)), 153390#(and (<= 12 Main_y) (<= Main_y 12)), 153391#(and (<= 13 Main_y) (<= Main_y 13)), 153388#(and (<= 10 Main_y) (<= Main_y 10)), 153389#(and (<= 11 Main_y) (<= Main_y 11)), 153394#(and (<= 16 Main_y) (<= Main_y 16)), 153395#(and (<= Main_y 17) (<= 17 Main_y)), 153392#(and (<= 14 Main_y) (<= Main_y 14)), 153393#(and (<= Main_y 15) (<= 15 Main_y)), 153398#(and (<= 20 Main_y) (<= Main_y 20)), 153399#(and (<= 21 Main_y) (<= Main_y 21)), 153396#(and (<= Main_y 18) (<= 18 Main_y)), 153397#(and (<= Main_y 19) (<= 19 Main_y)), 153402#(and (<= Main_y 24) (<= 24 Main_y)), 153403#(and (<= 25 Main_y) (<= Main_y 25)), 153400#(and (<= Main_y 22) (<= 22 Main_y)), 153401#(and (<= 23 Main_y) (<= Main_y 23)), 153406#(and (<= 28 Main_y) (<= Main_y 28)), 153407#(and (<= 29 Main_y) (<= Main_y 29)), 153404#(and (<= Main_y 26) (<= 26 Main_y)), 153405#(and (<= 27 Main_y) (<= Main_y 27)), 153410#(and (<= 32 Main_y) (<= Main_y 32)), 153411#(and (<= 33 Main_y) (<= Main_y 33)), 153408#(and (<= 30 Main_y) (<= Main_y 30)), 153409#(and (<= Main_y 31) (<= 31 Main_y)), 153414#(and (<= 36 Main_y) (<= Main_y 36)), 153415#(and (<= Main_y 37) (<= 37 Main_y)), 153412#(and (<= Main_y 34) (<= 34 Main_y)), 153413#(and (<= 35 Main_y) (<= Main_y 35)), 153418#(and (<= 40 Main_y) (<= Main_y 40)), 153419#(and (<= Main_y 41) (<= 41 Main_y)), 153416#(and (<= Main_y 38) (<= 38 Main_y)), 153417#(and (<= 39 Main_y) (<= Main_y 39)), 153422#(and (<= 44 Main_y) (<= Main_y 44)), 153423#(and (<= Main_y 45) (<= 45 Main_y)), 153420#(and (<= 42 Main_y) (<= Main_y 42)), 153421#(and (<= 43 Main_y) (<= Main_y 43)), 153426#(and (<= 48 Main_y) (<= Main_y 48)), 153427#(and (<= 49 Main_y) (<= Main_y 49)), 153424#(and (<= 46 Main_y) (<= Main_y 46)), 153425#(and (<= 47 Main_y) (<= Main_y 47)), 153430#(and (<= 52 Main_y) (<= Main_y 52)), 153431#(and (<= 53 Main_y) (<= Main_y 53)), 153428#(and (<= 50 Main_y) (<= Main_y 50)), 153429#(and (<= 51 Main_y) (<= Main_y 51)), 153434#(and (<= Main_y 56) (<= 56 Main_y)), 153435#(and (<= Main_y 57) (<= 57 Main_y)), 153432#(and (<= 54 Main_y) (<= Main_y 54)), 153433#(and (<= 55 Main_y) (<= Main_y 55)), 153438#(and (<= Main_y 60) (<= 60 Main_y)), 153439#(and (<= Main_y 61) (<= 61 Main_y)), 153436#(and (<= Main_y 58) (<= 58 Main_y)), 153437#(and (<= Main_y 59) (<= 59 Main_y)), 153442#(and (<= 64 Main_y) (<= Main_y 64)), 153443#(and (<= Main_y 65) (<= 65 Main_y)), 153440#(and (<= 62 Main_y) (<= Main_y 62)), 153441#(and (<= 63 Main_y) (<= Main_y 63)), 153446#(and (<= 68 Main_y) (<= Main_y 68)), 153447#(and (<= Main_y 69) (<= 69 Main_y)), 153444#(and (<= Main_y 66) (<= 66 Main_y)), 153445#(and (<= 67 Main_y) (<= Main_y 67)), 153450#(and (<= 72 Main_y) (<= Main_y 72)), 153451#(and (<= 73 Main_y) (<= Main_y 73)), 153448#(and (<= 70 Main_y) (<= Main_y 70)), 153449#(and (<= Main_y 71) (<= 71 Main_y)), 153454#(and (<= Main_y 76) (<= 76 Main_y)), 153455#(and (<= Main_y 77) (<= 77 Main_y)), 153452#(and (<= 74 Main_y) (<= Main_y 74)), 153453#(and (<= Main_y 75) (<= 75 Main_y)), 153458#(and (<= Main_y 80) (<= 80 Main_y)), 153459#(and (<= 81 Main_y) (<= Main_y 81)), 153456#(and (<= Main_y 78) (<= 78 Main_y)), 153457#(and (<= 79 Main_y) (<= Main_y 79)), 153462#(and (<= Main_y 84) (<= 84 Main_y)), 153463#(and (<= Main_y 85) (<= 85 Main_y)), 153460#(and (<= Main_y 82) (<= 82 Main_y)), 153461#(and (<= Main_y 83) (<= 83 Main_y)), 153466#(and (<= Main_y 88) (<= 88 Main_y)), 153467#(and (<= Main_y 89) (<= 89 Main_y)), 153464#(and (<= 86 Main_y) (<= Main_y 86)), 153465#(and (<= Main_y 87) (<= 87 Main_y)), 153470#(and (<= 92 Main_y) (<= Main_y 92)), 153471#(and (<= 93 Main_y) (<= Main_y 93)), 153468#(and (<= Main_y 90) (<= 90 Main_y)), 153469#(and (<= Main_y 91) (<= 91 Main_y)), 153474#(and (<= 96 Main_y) (<= Main_y 96)), 153472#(and (<= 94 Main_y) (<= Main_y 94)), 153473#(and (<= Main_y 95) (<= 95 Main_y))] [2018-07-23 13:58:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:32,669 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:58:32,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:58:32,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:58:32,669 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 99 states. [2018-07-23 13:58:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:34,093 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2018-07-23 13:58:34,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:58:34,094 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 197 [2018-07-23 13:58:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:34,094 INFO L225 Difference]: With dead ends: 299 [2018-07-23 13:58:34,094 INFO L226 Difference]: Without dead ends: 296 [2018-07-23 13:58:34,094 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:58:34,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-07-23 13:58:34,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 200. [2018-07-23 13:58:34,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-23 13:58:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-07-23 13:58:34,416 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 197 [2018-07-23 13:58:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:34,416 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-07-23 13:58:34,416 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:58:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-07-23 13:58:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-23 13:58:34,417 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:34,417 INFO L357 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2018-07-23 13:58:34,417 INFO L414 AbstractCegarLoop]: === Iteration 290 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1424595001, now seen corresponding path program 287 times [2018-07-23 13:58:34,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:35,007 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:35,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:58:35,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:35,007 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:58:35,008 INFO L185 omatonBuilderFactory]: Interpolants [154474#false, 154475#(<= Main_x 0), 154473#true, 154478#(<= Main_x 3), 154479#(<= Main_x 4), 154476#(<= Main_x 1), 154477#(<= Main_x 2), 154482#(<= Main_x 7), 154483#(<= Main_x 8), 154480#(<= Main_x 5), 154481#(<= Main_x 6), 154486#(<= Main_x 11), 154487#(<= Main_x 12), 154484#(<= Main_x 9), 154485#(<= Main_x 10), 154490#(<= Main_x 15), 154491#(<= Main_x 16), 154488#(<= Main_x 13), 154489#(<= Main_x 14), 154494#(<= Main_x 19), 154495#(<= Main_x 20), 154492#(<= Main_x 17), 154493#(<= Main_x 18), 154498#(<= Main_x 23), 154499#(<= Main_x 24), 154496#(<= Main_x 21), 154497#(<= Main_x 22), 154502#(<= Main_x 27), 154503#(<= Main_x 28), 154500#(<= Main_x 25), 154501#(<= Main_x 26), 154506#(<= Main_x 31), 154507#(<= Main_x 32), 154504#(<= Main_x 29), 154505#(<= Main_x 30), 154510#(<= Main_x 35), 154511#(<= Main_x 36), 154508#(<= Main_x 33), 154509#(<= Main_x 34), 154514#(<= Main_x 39), 154515#(<= Main_x 40), 154512#(<= Main_x 37), 154513#(<= Main_x 38), 154518#(<= Main_x 43), 154519#(<= Main_x 44), 154516#(<= Main_x 41), 154517#(<= Main_x 42), 154522#(<= Main_x 47), 154523#(<= Main_x 48), 154520#(<= Main_x 45), 154521#(<= Main_x 46), 154526#(<= Main_x 51), 154527#(<= Main_x 52), 154524#(<= Main_x 49), 154525#(<= Main_x 50), 154530#(<= Main_x 55), 154531#(<= Main_x 56), 154528#(<= Main_x 53), 154529#(<= Main_x 54), 154534#(<= Main_x 59), 154535#(<= Main_x 60), 154532#(<= Main_x 57), 154533#(<= Main_x 58), 154538#(<= Main_x 63), 154539#(<= Main_x 64), 154536#(<= Main_x 61), 154537#(<= Main_x 62), 154542#(<= Main_x 67), 154543#(<= Main_x 68), 154540#(<= Main_x 65), 154541#(<= Main_x 66), 154546#(<= Main_x 71), 154547#(<= Main_x 72), 154544#(<= Main_x 69), 154545#(<= Main_x 70), 154550#(<= Main_x 75), 154551#(<= Main_x 76), 154548#(<= Main_x 73), 154549#(<= Main_x 74), 154554#(<= Main_x 79), 154555#(<= Main_x 80), 154552#(<= Main_x 77), 154553#(<= Main_x 78), 154558#(<= Main_x 83), 154559#(<= Main_x 84), 154556#(<= Main_x 81), 154557#(<= Main_x 82), 154562#(<= Main_x 87), 154563#(<= Main_x 88), 154560#(<= Main_x 85), 154561#(<= Main_x 86), 154566#(<= Main_x 91), 154567#(<= Main_x 92), 154564#(<= Main_x 89), 154565#(<= Main_x 90), 154570#(<= Main_x 95), 154571#(<= Main_x 96), 154568#(<= Main_x 93), 154569#(<= Main_x 94), 154572#(<= (+ Main_x 1) 0)] [2018-07-23 13:58:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:35,008 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:58:35,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:58:35,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:58:35,009 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 100 states. [2018-07-23 13:58:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:35,669 INFO L93 Difference]: Finished difference Result 300 states and 302 transitions. [2018-07-23 13:58:35,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:58:35,669 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-23 13:58:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:35,670 INFO L225 Difference]: With dead ends: 300 [2018-07-23 13:58:35,670 INFO L226 Difference]: Without dead ends: 199 [2018-07-23 13:58:35,670 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:58:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-23 13:58:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-23 13:58:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-23 13:58:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-07-23 13:58:35,863 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 198 [2018-07-23 13:58:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:35,863 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-07-23 13:58:35,863 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:58:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-07-23 13:58:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-23 13:58:35,863 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:35,863 INFO L357 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2018-07-23 13:58:35,864 INFO L414 AbstractCegarLoop]: === Iteration 291 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1768026477, now seen corresponding path program 288 times [2018-07-23 13:58:35,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:36,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:36,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:58:36,335 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:36,335 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:58:36,336 INFO L185 omatonBuilderFactory]: Interpolants [155650#(<= 77 Main_x), 155651#(<= 78 Main_x), 155648#(<= 75 Main_x), 155649#(<= 76 Main_x), 155654#(<= 81 Main_x), 155655#(<= 82 Main_x), 155652#(<= 79 Main_x), 155653#(<= 80 Main_x), 155658#(<= 85 Main_x), 155659#(<= 86 Main_x), 155656#(<= 83 Main_x), 155657#(<= 84 Main_x), 155662#(<= 89 Main_x), 155663#(<= 90 Main_x), 155660#(<= 87 Main_x), 155661#(<= 88 Main_x), 155666#(<= 93 Main_x), 155667#(<= 94 Main_x), 155664#(<= 91 Main_x), 155665#(<= 92 Main_x), 155670#(<= 97 Main_x), 155668#(<= 95 Main_x), 155669#(<= 96 Main_x), 155571#true, 155574#(<= 1 Main_x), 155575#(<= 2 Main_x), 155572#false, 155573#(<= 0 Main_x), 155578#(<= 5 Main_x), 155579#(<= 6 Main_x), 155576#(<= 3 Main_x), 155577#(<= 4 Main_x), 155582#(<= 9 Main_x), 155583#(<= 10 Main_x), 155580#(<= 7 Main_x), 155581#(<= 8 Main_x), 155586#(<= 13 Main_x), 155587#(<= 14 Main_x), 155584#(<= 11 Main_x), 155585#(<= 12 Main_x), 155590#(<= 17 Main_x), 155591#(<= 18 Main_x), 155588#(<= 15 Main_x), 155589#(<= 16 Main_x), 155594#(<= 21 Main_x), 155595#(<= 22 Main_x), 155592#(<= 19 Main_x), 155593#(<= 20 Main_x), 155598#(<= 25 Main_x), 155599#(<= 26 Main_x), 155596#(<= 23 Main_x), 155597#(<= 24 Main_x), 155602#(<= 29 Main_x), 155603#(<= 30 Main_x), 155600#(<= 27 Main_x), 155601#(<= 28 Main_x), 155606#(<= 33 Main_x), 155607#(<= 34 Main_x), 155604#(<= 31 Main_x), 155605#(<= 32 Main_x), 155610#(<= 37 Main_x), 155611#(<= 38 Main_x), 155608#(<= 35 Main_x), 155609#(<= 36 Main_x), 155614#(<= 41 Main_x), 155615#(<= 42 Main_x), 155612#(<= 39 Main_x), 155613#(<= 40 Main_x), 155618#(<= 45 Main_x), 155619#(<= 46 Main_x), 155616#(<= 43 Main_x), 155617#(<= 44 Main_x), 155622#(<= 49 Main_x), 155623#(<= 50 Main_x), 155620#(<= 47 Main_x), 155621#(<= 48 Main_x), 155626#(<= 53 Main_x), 155627#(<= 54 Main_x), 155624#(<= 51 Main_x), 155625#(<= 52 Main_x), 155630#(<= 57 Main_x), 155631#(<= 58 Main_x), 155628#(<= 55 Main_x), 155629#(<= 56 Main_x), 155634#(<= 61 Main_x), 155635#(<= 62 Main_x), 155632#(<= 59 Main_x), 155633#(<= 60 Main_x), 155638#(<= 65 Main_x), 155639#(<= 66 Main_x), 155636#(<= 63 Main_x), 155637#(<= 64 Main_x), 155642#(<= 69 Main_x), 155643#(<= 70 Main_x), 155640#(<= 67 Main_x), 155641#(<= 68 Main_x), 155646#(<= 73 Main_x), 155647#(<= 74 Main_x), 155644#(<= 71 Main_x), 155645#(<= 72 Main_x)] [2018-07-23 13:58:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 4753 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:36,336 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:58:36,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:58:36,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:58:36,337 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-07-23 13:58:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:36,614 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-07-23 13:58:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:58:36,614 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-23 13:58:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:36,614 INFO L225 Difference]: With dead ends: 203 [2018-07-23 13:58:36,614 INFO L226 Difference]: Without dead ends: 200 [2018-07-23 13:58:36,615 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:58:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-23 13:58:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-07-23 13:58:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-23 13:58:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-07-23 13:58:36,793 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 198 [2018-07-23 13:58:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:36,793 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-07-23 13:58:36,793 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:58:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-07-23 13:58:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-23 13:58:36,794 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:36,794 INFO L357 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1] [2018-07-23 13:58:36,794 INFO L414 AbstractCegarLoop]: === Iteration 292 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1025815583, now seen corresponding path program 289 times [2018-07-23 13:58:36,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:37,389 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:37,389 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:58:37,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:37,389 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:58:37,390 INFO L185 omatonBuilderFactory]: Interpolants [156478#false, 156479#(and (<= 0 Main_y) (<= Main_y 0)), 156477#true, 156482#(and (<= Main_y 3) (<= 3 Main_y)), 156483#(and (<= Main_y 4) (<= 4 Main_y)), 156480#(and (<= 1 Main_y) (<= Main_y 1)), 156481#(and (<= Main_y 2) (<= 2 Main_y)), 156486#(and (<= 7 Main_y) (<= Main_y 7)), 156487#(and (<= 8 Main_y) (<= Main_y 8)), 156484#(and (<= Main_y 5) (<= 5 Main_y)), 156485#(and (<= Main_y 6) (<= 6 Main_y)), 156490#(and (<= 11 Main_y) (<= Main_y 11)), 156491#(and (<= 12 Main_y) (<= Main_y 12)), 156488#(and (<= Main_y 9) (<= 9 Main_y)), 156489#(and (<= 10 Main_y) (<= Main_y 10)), 156494#(and (<= Main_y 15) (<= 15 Main_y)), 156495#(and (<= 16 Main_y) (<= Main_y 16)), 156492#(and (<= 13 Main_y) (<= Main_y 13)), 156493#(and (<= 14 Main_y) (<= Main_y 14)), 156498#(and (<= Main_y 19) (<= 19 Main_y)), 156499#(and (<= 20 Main_y) (<= Main_y 20)), 156496#(and (<= Main_y 17) (<= 17 Main_y)), 156497#(and (<= Main_y 18) (<= 18 Main_y)), 156502#(and (<= 23 Main_y) (<= Main_y 23)), 156503#(and (<= Main_y 24) (<= 24 Main_y)), 156500#(and (<= 21 Main_y) (<= Main_y 21)), 156501#(and (<= Main_y 22) (<= 22 Main_y)), 156506#(and (<= 27 Main_y) (<= Main_y 27)), 156507#(and (<= 28 Main_y) (<= Main_y 28)), 156504#(and (<= 25 Main_y) (<= Main_y 25)), 156505#(and (<= Main_y 26) (<= 26 Main_y)), 156510#(and (<= Main_y 31) (<= 31 Main_y)), 156511#(and (<= 32 Main_y) (<= Main_y 32)), 156508#(and (<= 29 Main_y) (<= Main_y 29)), 156509#(and (<= 30 Main_y) (<= Main_y 30)), 156514#(and (<= 35 Main_y) (<= Main_y 35)), 156515#(and (<= 36 Main_y) (<= Main_y 36)), 156512#(and (<= 33 Main_y) (<= Main_y 33)), 156513#(and (<= Main_y 34) (<= 34 Main_y)), 156518#(and (<= 39 Main_y) (<= Main_y 39)), 156519#(and (<= 40 Main_y) (<= Main_y 40)), 156516#(and (<= Main_y 37) (<= 37 Main_y)), 156517#(and (<= Main_y 38) (<= 38 Main_y)), 156522#(and (<= 43 Main_y) (<= Main_y 43)), 156523#(and (<= 44 Main_y) (<= Main_y 44)), 156520#(and (<= Main_y 41) (<= 41 Main_y)), 156521#(and (<= 42 Main_y) (<= Main_y 42)), 156526#(and (<= 47 Main_y) (<= Main_y 47)), 156527#(and (<= 48 Main_y) (<= Main_y 48)), 156524#(and (<= Main_y 45) (<= 45 Main_y)), 156525#(and (<= 46 Main_y) (<= Main_y 46)), 156530#(and (<= 51 Main_y) (<= Main_y 51)), 156531#(and (<= 52 Main_y) (<= Main_y 52)), 156528#(and (<= 49 Main_y) (<= Main_y 49)), 156529#(and (<= 50 Main_y) (<= Main_y 50)), 156534#(and (<= 55 Main_y) (<= Main_y 55)), 156535#(and (<= Main_y 56) (<= 56 Main_y)), 156532#(and (<= 53 Main_y) (<= Main_y 53)), 156533#(and (<= 54 Main_y) (<= Main_y 54)), 156538#(and (<= Main_y 59) (<= 59 Main_y)), 156539#(and (<= Main_y 60) (<= 60 Main_y)), 156536#(and (<= Main_y 57) (<= 57 Main_y)), 156537#(and (<= Main_y 58) (<= 58 Main_y)), 156542#(and (<= 63 Main_y) (<= Main_y 63)), 156543#(and (<= 64 Main_y) (<= Main_y 64)), 156540#(and (<= Main_y 61) (<= 61 Main_y)), 156541#(and (<= 62 Main_y) (<= Main_y 62)), 156546#(and (<= 67 Main_y) (<= Main_y 67)), 156547#(and (<= 68 Main_y) (<= Main_y 68)), 156544#(and (<= Main_y 65) (<= 65 Main_y)), 156545#(and (<= Main_y 66) (<= 66 Main_y)), 156550#(and (<= Main_y 71) (<= 71 Main_y)), 156551#(and (<= 72 Main_y) (<= Main_y 72)), 156548#(and (<= Main_y 69) (<= 69 Main_y)), 156549#(and (<= 70 Main_y) (<= Main_y 70)), 156554#(and (<= Main_y 75) (<= 75 Main_y)), 156555#(and (<= Main_y 76) (<= 76 Main_y)), 156552#(and (<= 73 Main_y) (<= Main_y 73)), 156553#(and (<= 74 Main_y) (<= Main_y 74)), 156558#(and (<= 79 Main_y) (<= Main_y 79)), 156559#(and (<= Main_y 80) (<= 80 Main_y)), 156556#(and (<= Main_y 77) (<= 77 Main_y)), 156557#(and (<= Main_y 78) (<= 78 Main_y)), 156562#(and (<= Main_y 83) (<= 83 Main_y)), 156563#(and (<= Main_y 84) (<= 84 Main_y)), 156560#(and (<= 81 Main_y) (<= Main_y 81)), 156561#(and (<= Main_y 82) (<= 82 Main_y)), 156566#(and (<= Main_y 87) (<= 87 Main_y)), 156567#(and (<= Main_y 88) (<= 88 Main_y)), 156564#(and (<= Main_y 85) (<= 85 Main_y)), 156565#(and (<= 86 Main_y) (<= Main_y 86)), 156570#(and (<= Main_y 91) (<= 91 Main_y)), 156571#(and (<= 92 Main_y) (<= Main_y 92)), 156568#(and (<= Main_y 89) (<= 89 Main_y)), 156569#(and (<= Main_y 90) (<= 90 Main_y)), 156574#(and (<= Main_y 95) (<= 95 Main_y)), 156575#(and (<= 96 Main_y) (<= Main_y 96)), 156572#(and (<= 93 Main_y) (<= Main_y 93)), 156573#(and (<= 94 Main_y) (<= Main_y 94)), 156576#(and (<= Main_y 97) (<= 97 Main_y))] [2018-07-23 13:58:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:37,390 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:58:37,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:58:37,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:58:37,391 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 100 states. [2018-07-23 13:58:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:38,743 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-07-23 13:58:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:58:38,743 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 199 [2018-07-23 13:58:38,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:38,743 INFO L225 Difference]: With dead ends: 302 [2018-07-23 13:58:38,744 INFO L226 Difference]: Without dead ends: 299 [2018-07-23 13:58:38,744 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:58:38,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-23 13:58:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 202. [2018-07-23 13:58:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-23 13:58:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 204 transitions. [2018-07-23 13:58:38,924 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 204 transitions. Word has length 199 [2018-07-23 13:58:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:38,924 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 204 transitions. [2018-07-23 13:58:38,924 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:58:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2018-07-23 13:58:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 13:58:38,924 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:38,925 INFO L357 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2018-07-23 13:58:38,925 INFO L414 AbstractCegarLoop]: === Iteration 293 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1735573523, now seen corresponding path program 290 times [2018-07-23 13:58:38,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4851 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:39,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:39,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:58:39,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:39,326 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:58:39,326 INFO L185 omatonBuilderFactory]: Interpolants [157586#false, 157587#(<= Main_x 0), 157585#true, 157590#(<= Main_x 3), 157591#(<= Main_x 4), 157588#(<= Main_x 1), 157589#(<= Main_x 2), 157594#(<= Main_x 7), 157595#(<= Main_x 8), 157592#(<= Main_x 5), 157593#(<= Main_x 6), 157598#(<= Main_x 11), 157599#(<= Main_x 12), 157596#(<= Main_x 9), 157597#(<= Main_x 10), 157602#(<= Main_x 15), 157603#(<= Main_x 16), 157600#(<= Main_x 13), 157601#(<= Main_x 14), 157606#(<= Main_x 19), 157607#(<= Main_x 20), 157604#(<= Main_x 17), 157605#(<= Main_x 18), 157610#(<= Main_x 23), 157611#(<= Main_x 24), 157608#(<= Main_x 21), 157609#(<= Main_x 22), 157614#(<= Main_x 27), 157615#(<= Main_x 28), 157612#(<= Main_x 25), 157613#(<= Main_x 26), 157618#(<= Main_x 31), 157619#(<= Main_x 32), 157616#(<= Main_x 29), 157617#(<= Main_x 30), 157622#(<= Main_x 35), 157623#(<= Main_x 36), 157620#(<= Main_x 33), 157621#(<= Main_x 34), 157626#(<= Main_x 39), 157627#(<= Main_x 40), 157624#(<= Main_x 37), 157625#(<= Main_x 38), 157630#(<= Main_x 43), 157631#(<= Main_x 44), 157628#(<= Main_x 41), 157629#(<= Main_x 42), 157634#(<= Main_x 47), 157635#(<= Main_x 48), 157632#(<= Main_x 45), 157633#(<= Main_x 46), 157638#(<= Main_x 51), 157639#(<= Main_x 52), 157636#(<= Main_x 49), 157637#(<= Main_x 50), 157642#(<= Main_x 55), 157643#(<= Main_x 56), 157640#(<= Main_x 53), 157641#(<= Main_x 54), 157646#(<= Main_x 59), 157647#(<= Main_x 60), 157644#(<= Main_x 57), 157645#(<= Main_x 58), 157650#(<= Main_x 63), 157651#(<= Main_x 64), 157648#(<= Main_x 61), 157649#(<= Main_x 62), 157654#(<= Main_x 67), 157655#(<= Main_x 68), 157652#(<= Main_x 65), 157653#(<= Main_x 66), 157658#(<= Main_x 71), 157659#(<= Main_x 72), 157656#(<= Main_x 69), 157657#(<= Main_x 70), 157662#(<= Main_x 75), 157663#(<= Main_x 76), 157660#(<= Main_x 73), 157661#(<= Main_x 74), 157666#(<= Main_x 79), 157667#(<= Main_x 80), 157664#(<= Main_x 77), 157665#(<= Main_x 78), 157670#(<= Main_x 83), 157671#(<= Main_x 84), 157668#(<= Main_x 81), 157669#(<= Main_x 82), 157674#(<= Main_x 87), 157675#(<= Main_x 88), 157672#(<= Main_x 85), 157673#(<= Main_x 86), 157678#(<= Main_x 91), 157679#(<= Main_x 92), 157676#(<= Main_x 89), 157677#(<= Main_x 90), 157682#(<= Main_x 95), 157683#(<= Main_x 96), 157680#(<= Main_x 93), 157681#(<= Main_x 94), 157684#(<= Main_x 97), 157685#(<= (+ Main_x 1) 0)] [2018-07-23 13:58:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4851 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:39,326 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:58:39,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:58:39,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:58:39,327 INFO L87 Difference]: Start difference. First operand 202 states and 204 transitions. Second operand 101 states. [2018-07-23 13:58:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:39,915 INFO L93 Difference]: Finished difference Result 303 states and 305 transitions. [2018-07-23 13:58:39,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:58:39,916 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-23 13:58:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:39,916 INFO L225 Difference]: With dead ends: 303 [2018-07-23 13:58:39,916 INFO L226 Difference]: Without dead ends: 201 [2018-07-23 13:58:39,917 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:58:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-23 13:58:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-23 13:58:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 13:58:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-07-23 13:58:40,090 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 200 [2018-07-23 13:58:40,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:40,091 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-07-23 13:58:40,091 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:58:40,091 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-07-23 13:58:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 13:58:40,091 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:40,092 INFO L357 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2018-07-23 13:58:40,092 INFO L414 AbstractCegarLoop]: === Iteration 294 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1548555513, now seen corresponding path program 291 times [2018-07-23 13:58:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4851 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:40,488 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:40,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:58:40,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:40,489 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:58:40,489 INFO L185 omatonBuilderFactory]: Interpolants [158722#(<= 26 Main_x), 158723#(<= 27 Main_x), 158720#(<= 24 Main_x), 158721#(<= 25 Main_x), 158726#(<= 30 Main_x), 158727#(<= 31 Main_x), 158724#(<= 28 Main_x), 158725#(<= 29 Main_x), 158730#(<= 34 Main_x), 158731#(<= 35 Main_x), 158728#(<= 32 Main_x), 158729#(<= 33 Main_x), 158734#(<= 38 Main_x), 158735#(<= 39 Main_x), 158732#(<= 36 Main_x), 158733#(<= 37 Main_x), 158738#(<= 42 Main_x), 158739#(<= 43 Main_x), 158736#(<= 40 Main_x), 158737#(<= 41 Main_x), 158742#(<= 46 Main_x), 158743#(<= 47 Main_x), 158740#(<= 44 Main_x), 158741#(<= 45 Main_x), 158746#(<= 50 Main_x), 158747#(<= 51 Main_x), 158744#(<= 48 Main_x), 158745#(<= 49 Main_x), 158750#(<= 54 Main_x), 158751#(<= 55 Main_x), 158748#(<= 52 Main_x), 158749#(<= 53 Main_x), 158754#(<= 58 Main_x), 158755#(<= 59 Main_x), 158752#(<= 56 Main_x), 158753#(<= 57 Main_x), 158758#(<= 62 Main_x), 158759#(<= 63 Main_x), 158756#(<= 60 Main_x), 158757#(<= 61 Main_x), 158762#(<= 66 Main_x), 158763#(<= 67 Main_x), 158760#(<= 64 Main_x), 158761#(<= 65 Main_x), 158766#(<= 70 Main_x), 158767#(<= 71 Main_x), 158764#(<= 68 Main_x), 158765#(<= 69 Main_x), 158770#(<= 74 Main_x), 158771#(<= 75 Main_x), 158768#(<= 72 Main_x), 158769#(<= 73 Main_x), 158774#(<= 78 Main_x), 158775#(<= 79 Main_x), 158772#(<= 76 Main_x), 158773#(<= 77 Main_x), 158778#(<= 82 Main_x), 158779#(<= 83 Main_x), 158776#(<= 80 Main_x), 158777#(<= 81 Main_x), 158782#(<= 86 Main_x), 158783#(<= 87 Main_x), 158780#(<= 84 Main_x), 158781#(<= 85 Main_x), 158786#(<= 90 Main_x), 158787#(<= 91 Main_x), 158784#(<= 88 Main_x), 158785#(<= 89 Main_x), 158790#(<= 94 Main_x), 158791#(<= 95 Main_x), 158788#(<= 92 Main_x), 158789#(<= 93 Main_x), 158794#(<= 98 Main_x), 158792#(<= 96 Main_x), 158793#(<= 97 Main_x), 158694#true, 158695#false, 158698#(<= 2 Main_x), 158699#(<= 3 Main_x), 158696#(<= 0 Main_x), 158697#(<= 1 Main_x), 158702#(<= 6 Main_x), 158703#(<= 7 Main_x), 158700#(<= 4 Main_x), 158701#(<= 5 Main_x), 158706#(<= 10 Main_x), 158707#(<= 11 Main_x), 158704#(<= 8 Main_x), 158705#(<= 9 Main_x), 158710#(<= 14 Main_x), 158711#(<= 15 Main_x), 158708#(<= 12 Main_x), 158709#(<= 13 Main_x), 158714#(<= 18 Main_x), 158715#(<= 19 Main_x), 158712#(<= 16 Main_x), 158713#(<= 17 Main_x), 158718#(<= 22 Main_x), 158719#(<= 23 Main_x), 158716#(<= 20 Main_x), 158717#(<= 21 Main_x)] [2018-07-23 13:58:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4851 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:40,489 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:58:40,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:58:40,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:58:40,490 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-07-23 13:58:40,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:40,732 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-07-23 13:58:40,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:58:40,732 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-23 13:58:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:40,732 INFO L225 Difference]: With dead ends: 205 [2018-07-23 13:58:40,733 INFO L226 Difference]: Without dead ends: 202 [2018-07-23 13:58:40,733 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:58:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-23 13:58:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-07-23 13:58:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-23 13:58:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 203 transitions. [2018-07-23 13:58:40,914 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 203 transitions. Word has length 200 [2018-07-23 13:58:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:40,914 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 203 transitions. [2018-07-23 13:58:40,914 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:58:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 203 transitions. [2018-07-23 13:58:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-23 13:58:40,915 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:40,915 INFO L357 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1] [2018-07-23 13:58:40,915 INFO L414 AbstractCegarLoop]: === Iteration 295 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash -760642169, now seen corresponding path program 292 times [2018-07-23 13:58:40,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:41,599 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:41,599 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:58:41,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:41,599 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:58:41,600 INFO L185 omatonBuilderFactory]: Interpolants [159610#false, 159611#(and (<= 0 Main_y) (<= Main_y 0)), 159609#true, 159614#(and (<= Main_y 3) (<= 3 Main_y)), 159615#(and (<= Main_y 4) (<= 4 Main_y)), 159612#(and (<= 1 Main_y) (<= Main_y 1)), 159613#(and (<= Main_y 2) (<= 2 Main_y)), 159618#(and (<= 7 Main_y) (<= Main_y 7)), 159619#(and (<= 8 Main_y) (<= Main_y 8)), 159616#(and (<= Main_y 5) (<= 5 Main_y)), 159617#(and (<= Main_y 6) (<= 6 Main_y)), 159622#(and (<= 11 Main_y) (<= Main_y 11)), 159623#(and (<= 12 Main_y) (<= Main_y 12)), 159620#(and (<= Main_y 9) (<= 9 Main_y)), 159621#(and (<= 10 Main_y) (<= Main_y 10)), 159626#(and (<= Main_y 15) (<= 15 Main_y)), 159627#(and (<= 16 Main_y) (<= Main_y 16)), 159624#(and (<= 13 Main_y) (<= Main_y 13)), 159625#(and (<= 14 Main_y) (<= Main_y 14)), 159630#(and (<= Main_y 19) (<= 19 Main_y)), 159631#(and (<= 20 Main_y) (<= Main_y 20)), 159628#(and (<= Main_y 17) (<= 17 Main_y)), 159629#(and (<= Main_y 18) (<= 18 Main_y)), 159634#(and (<= 23 Main_y) (<= Main_y 23)), 159635#(and (<= Main_y 24) (<= 24 Main_y)), 159632#(and (<= 21 Main_y) (<= Main_y 21)), 159633#(and (<= Main_y 22) (<= 22 Main_y)), 159638#(and (<= 27 Main_y) (<= Main_y 27)), 159639#(and (<= 28 Main_y) (<= Main_y 28)), 159636#(and (<= 25 Main_y) (<= Main_y 25)), 159637#(and (<= Main_y 26) (<= 26 Main_y)), 159642#(and (<= Main_y 31) (<= 31 Main_y)), 159643#(and (<= 32 Main_y) (<= Main_y 32)), 159640#(and (<= 29 Main_y) (<= Main_y 29)), 159641#(and (<= 30 Main_y) (<= Main_y 30)), 159646#(and (<= 35 Main_y) (<= Main_y 35)), 159647#(and (<= 36 Main_y) (<= Main_y 36)), 159644#(and (<= 33 Main_y) (<= Main_y 33)), 159645#(and (<= Main_y 34) (<= 34 Main_y)), 159650#(and (<= 39 Main_y) (<= Main_y 39)), 159651#(and (<= 40 Main_y) (<= Main_y 40)), 159648#(and (<= Main_y 37) (<= 37 Main_y)), 159649#(and (<= Main_y 38) (<= 38 Main_y)), 159654#(and (<= 43 Main_y) (<= Main_y 43)), 159655#(and (<= 44 Main_y) (<= Main_y 44)), 159652#(and (<= Main_y 41) (<= 41 Main_y)), 159653#(and (<= 42 Main_y) (<= Main_y 42)), 159658#(and (<= 47 Main_y) (<= Main_y 47)), 159659#(and (<= 48 Main_y) (<= Main_y 48)), 159656#(and (<= Main_y 45) (<= 45 Main_y)), 159657#(and (<= 46 Main_y) (<= Main_y 46)), 159662#(and (<= 51 Main_y) (<= Main_y 51)), 159663#(and (<= 52 Main_y) (<= Main_y 52)), 159660#(and (<= 49 Main_y) (<= Main_y 49)), 159661#(and (<= 50 Main_y) (<= Main_y 50)), 159666#(and (<= 55 Main_y) (<= Main_y 55)), 159667#(and (<= Main_y 56) (<= 56 Main_y)), 159664#(and (<= 53 Main_y) (<= Main_y 53)), 159665#(and (<= 54 Main_y) (<= Main_y 54)), 159670#(and (<= Main_y 59) (<= 59 Main_y)), 159671#(and (<= Main_y 60) (<= 60 Main_y)), 159668#(and (<= Main_y 57) (<= 57 Main_y)), 159669#(and (<= Main_y 58) (<= 58 Main_y)), 159674#(and (<= 63 Main_y) (<= Main_y 63)), 159675#(and (<= 64 Main_y) (<= Main_y 64)), 159672#(and (<= Main_y 61) (<= 61 Main_y)), 159673#(and (<= 62 Main_y) (<= Main_y 62)), 159678#(and (<= 67 Main_y) (<= Main_y 67)), 159679#(and (<= 68 Main_y) (<= Main_y 68)), 159676#(and (<= Main_y 65) (<= 65 Main_y)), 159677#(and (<= Main_y 66) (<= 66 Main_y)), 159682#(and (<= Main_y 71) (<= 71 Main_y)), 159683#(and (<= 72 Main_y) (<= Main_y 72)), 159680#(and (<= Main_y 69) (<= 69 Main_y)), 159681#(and (<= 70 Main_y) (<= Main_y 70)), 159686#(and (<= Main_y 75) (<= 75 Main_y)), 159687#(and (<= Main_y 76) (<= 76 Main_y)), 159684#(and (<= 73 Main_y) (<= Main_y 73)), 159685#(and (<= 74 Main_y) (<= Main_y 74)), 159690#(and (<= 79 Main_y) (<= Main_y 79)), 159691#(and (<= Main_y 80) (<= 80 Main_y)), 159688#(and (<= Main_y 77) (<= 77 Main_y)), 159689#(and (<= Main_y 78) (<= 78 Main_y)), 159694#(and (<= Main_y 83) (<= 83 Main_y)), 159695#(and (<= Main_y 84) (<= 84 Main_y)), 159692#(and (<= 81 Main_y) (<= Main_y 81)), 159693#(and (<= Main_y 82) (<= 82 Main_y)), 159698#(and (<= Main_y 87) (<= 87 Main_y)), 159699#(and (<= Main_y 88) (<= 88 Main_y)), 159696#(and (<= Main_y 85) (<= 85 Main_y)), 159697#(and (<= 86 Main_y) (<= Main_y 86)), 159702#(and (<= Main_y 91) (<= 91 Main_y)), 159703#(and (<= 92 Main_y) (<= Main_y 92)), 159700#(and (<= Main_y 89) (<= 89 Main_y)), 159701#(and (<= Main_y 90) (<= 90 Main_y)), 159706#(and (<= Main_y 95) (<= 95 Main_y)), 159707#(and (<= 96 Main_y) (<= Main_y 96)), 159704#(and (<= 93 Main_y) (<= Main_y 93)), 159705#(and (<= 94 Main_y) (<= Main_y 94)), 159708#(and (<= Main_y 97) (<= 97 Main_y)), 159709#(and (<= 98 Main_y) (<= Main_y 98))] [2018-07-23 13:58:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:41,600 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:58:41,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:58:41,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:58:41,601 INFO L87 Difference]: Start difference. First operand 202 states and 203 transitions. Second operand 101 states. [2018-07-23 13:58:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:42,935 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-07-23 13:58:42,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:58:42,935 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 201 [2018-07-23 13:58:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:42,935 INFO L225 Difference]: With dead ends: 305 [2018-07-23 13:58:42,935 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 13:58:42,936 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:58:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 13:58:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 204. [2018-07-23 13:58:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-23 13:58:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2018-07-23 13:58:43,118 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 201 [2018-07-23 13:58:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:43,118 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2018-07-23 13:58:43,118 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:58:43,118 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2018-07-23 13:58:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-23 13:58:43,119 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:43,119 INFO L357 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2018-07-23 13:58:43,119 INFO L414 AbstractCegarLoop]: === Iteration 296 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2105132281, now seen corresponding path program 293 times [2018-07-23 13:58:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:43,544 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:43,544 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:58:43,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:43,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:58:43,544 INFO L185 omatonBuilderFactory]: Interpolants [160770#(<= Main_x 40), 160771#(<= Main_x 41), 160768#(<= Main_x 38), 160769#(<= Main_x 39), 160774#(<= Main_x 44), 160775#(<= Main_x 45), 160772#(<= Main_x 42), 160773#(<= Main_x 43), 160778#(<= Main_x 48), 160779#(<= Main_x 49), 160776#(<= Main_x 46), 160777#(<= Main_x 47), 160782#(<= Main_x 52), 160783#(<= Main_x 53), 160780#(<= Main_x 50), 160781#(<= Main_x 51), 160786#(<= Main_x 56), 160787#(<= Main_x 57), 160784#(<= Main_x 54), 160785#(<= Main_x 55), 160790#(<= Main_x 60), 160791#(<= Main_x 61), 160788#(<= Main_x 58), 160789#(<= Main_x 59), 160794#(<= Main_x 64), 160795#(<= Main_x 65), 160792#(<= Main_x 62), 160793#(<= Main_x 63), 160798#(<= Main_x 68), 160799#(<= Main_x 69), 160796#(<= Main_x 66), 160797#(<= Main_x 67), 160802#(<= Main_x 72), 160803#(<= Main_x 73), 160800#(<= Main_x 70), 160801#(<= Main_x 71), 160806#(<= Main_x 76), 160807#(<= Main_x 77), 160804#(<= Main_x 74), 160805#(<= Main_x 75), 160810#(<= Main_x 80), 160811#(<= Main_x 81), 160808#(<= Main_x 78), 160809#(<= Main_x 79), 160814#(<= Main_x 84), 160815#(<= Main_x 85), 160812#(<= Main_x 82), 160813#(<= Main_x 83), 160818#(<= Main_x 88), 160819#(<= Main_x 89), 160816#(<= Main_x 86), 160817#(<= Main_x 87), 160822#(<= Main_x 92), 160823#(<= Main_x 93), 160820#(<= Main_x 90), 160821#(<= Main_x 91), 160826#(<= Main_x 96), 160827#(<= Main_x 97), 160824#(<= Main_x 94), 160825#(<= Main_x 95), 160828#(<= Main_x 98), 160829#(<= (+ Main_x 1) 0), 160730#(<= Main_x 0), 160731#(<= Main_x 1), 160728#true, 160729#false, 160734#(<= Main_x 4), 160735#(<= Main_x 5), 160732#(<= Main_x 2), 160733#(<= Main_x 3), 160738#(<= Main_x 8), 160739#(<= Main_x 9), 160736#(<= Main_x 6), 160737#(<= Main_x 7), 160742#(<= Main_x 12), 160743#(<= Main_x 13), 160740#(<= Main_x 10), 160741#(<= Main_x 11), 160746#(<= Main_x 16), 160747#(<= Main_x 17), 160744#(<= Main_x 14), 160745#(<= Main_x 15), 160750#(<= Main_x 20), 160751#(<= Main_x 21), 160748#(<= Main_x 18), 160749#(<= Main_x 19), 160754#(<= Main_x 24), 160755#(<= Main_x 25), 160752#(<= Main_x 22), 160753#(<= Main_x 23), 160758#(<= Main_x 28), 160759#(<= Main_x 29), 160756#(<= Main_x 26), 160757#(<= Main_x 27), 160762#(<= Main_x 32), 160763#(<= Main_x 33), 160760#(<= Main_x 30), 160761#(<= Main_x 31), 160766#(<= Main_x 36), 160767#(<= Main_x 37), 160764#(<= Main_x 34), 160765#(<= Main_x 35)] [2018-07-23 13:58:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:43,545 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:58:43,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:58:43,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:58:43,546 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 102 states. [2018-07-23 13:58:44,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:44,033 INFO L93 Difference]: Finished difference Result 306 states and 308 transitions. [2018-07-23 13:58:44,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:58:44,033 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-23 13:58:44,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:44,034 INFO L225 Difference]: With dead ends: 306 [2018-07-23 13:58:44,034 INFO L226 Difference]: Without dead ends: 203 [2018-07-23 13:58:44,035 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:58:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-23 13:58:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-23 13:58:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 13:58:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-07-23 13:58:44,213 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 202 [2018-07-23 13:58:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:44,213 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-07-23 13:58:44,214 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:58:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-07-23 13:58:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-23 13:58:44,214 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:44,214 INFO L357 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2018-07-23 13:58:44,214 INFO L414 AbstractCegarLoop]: === Iteration 297 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash -602541267, now seen corresponding path program 294 times [2018-07-23 13:58:44,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:44,651 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:44,651 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:58:44,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:44,652 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:58:44,652 INFO L185 omatonBuilderFactory]: Interpolants [161850#(<= 0 Main_x), 161851#(<= 1 Main_x), 161848#true, 161849#false, 161854#(<= 4 Main_x), 161855#(<= 5 Main_x), 161852#(<= 2 Main_x), 161853#(<= 3 Main_x), 161858#(<= 8 Main_x), 161859#(<= 9 Main_x), 161856#(<= 6 Main_x), 161857#(<= 7 Main_x), 161862#(<= 12 Main_x), 161863#(<= 13 Main_x), 161860#(<= 10 Main_x), 161861#(<= 11 Main_x), 161866#(<= 16 Main_x), 161867#(<= 17 Main_x), 161864#(<= 14 Main_x), 161865#(<= 15 Main_x), 161870#(<= 20 Main_x), 161871#(<= 21 Main_x), 161868#(<= 18 Main_x), 161869#(<= 19 Main_x), 161874#(<= 24 Main_x), 161875#(<= 25 Main_x), 161872#(<= 22 Main_x), 161873#(<= 23 Main_x), 161878#(<= 28 Main_x), 161879#(<= 29 Main_x), 161876#(<= 26 Main_x), 161877#(<= 27 Main_x), 161882#(<= 32 Main_x), 161883#(<= 33 Main_x), 161880#(<= 30 Main_x), 161881#(<= 31 Main_x), 161886#(<= 36 Main_x), 161887#(<= 37 Main_x), 161884#(<= 34 Main_x), 161885#(<= 35 Main_x), 161890#(<= 40 Main_x), 161891#(<= 41 Main_x), 161888#(<= 38 Main_x), 161889#(<= 39 Main_x), 161894#(<= 44 Main_x), 161895#(<= 45 Main_x), 161892#(<= 42 Main_x), 161893#(<= 43 Main_x), 161898#(<= 48 Main_x), 161899#(<= 49 Main_x), 161896#(<= 46 Main_x), 161897#(<= 47 Main_x), 161902#(<= 52 Main_x), 161903#(<= 53 Main_x), 161900#(<= 50 Main_x), 161901#(<= 51 Main_x), 161906#(<= 56 Main_x), 161907#(<= 57 Main_x), 161904#(<= 54 Main_x), 161905#(<= 55 Main_x), 161910#(<= 60 Main_x), 161911#(<= 61 Main_x), 161908#(<= 58 Main_x), 161909#(<= 59 Main_x), 161914#(<= 64 Main_x), 161915#(<= 65 Main_x), 161912#(<= 62 Main_x), 161913#(<= 63 Main_x), 161918#(<= 68 Main_x), 161919#(<= 69 Main_x), 161916#(<= 66 Main_x), 161917#(<= 67 Main_x), 161922#(<= 72 Main_x), 161923#(<= 73 Main_x), 161920#(<= 70 Main_x), 161921#(<= 71 Main_x), 161926#(<= 76 Main_x), 161927#(<= 77 Main_x), 161924#(<= 74 Main_x), 161925#(<= 75 Main_x), 161930#(<= 80 Main_x), 161931#(<= 81 Main_x), 161928#(<= 78 Main_x), 161929#(<= 79 Main_x), 161934#(<= 84 Main_x), 161935#(<= 85 Main_x), 161932#(<= 82 Main_x), 161933#(<= 83 Main_x), 161938#(<= 88 Main_x), 161939#(<= 89 Main_x), 161936#(<= 86 Main_x), 161937#(<= 87 Main_x), 161942#(<= 92 Main_x), 161943#(<= 93 Main_x), 161940#(<= 90 Main_x), 161941#(<= 91 Main_x), 161946#(<= 96 Main_x), 161947#(<= 97 Main_x), 161944#(<= 94 Main_x), 161945#(<= 95 Main_x), 161948#(<= 98 Main_x), 161949#(<= 99 Main_x)] [2018-07-23 13:58:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:44,652 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:58:44,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:58:44,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:58:44,653 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-07-23 13:58:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:44,915 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-07-23 13:58:44,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:58:44,915 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-23 13:58:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:44,916 INFO L225 Difference]: With dead ends: 207 [2018-07-23 13:58:44,916 INFO L226 Difference]: Without dead ends: 204 [2018-07-23 13:58:44,916 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:58:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-23 13:58:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-07-23 13:58:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-23 13:58:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-07-23 13:58:45,095 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 202 [2018-07-23 13:58:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:45,095 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-07-23 13:58:45,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:58:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-07-23 13:58:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-23 13:58:45,096 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:45,096 INFO L357 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1] [2018-07-23 13:58:45,096 INFO L414 AbstractCegarLoop]: === Iteration 298 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1498971615, now seen corresponding path program 295 times [2018-07-23 13:58:45,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:45,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:45,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:58:45,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:45,830 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:58:45,831 INFO L185 omatonBuilderFactory]: Interpolants [162818#(and (<= 44 Main_y) (<= Main_y 44)), 162819#(and (<= Main_y 45) (<= 45 Main_y)), 162816#(and (<= 42 Main_y) (<= Main_y 42)), 162817#(and (<= 43 Main_y) (<= Main_y 43)), 162822#(and (<= 48 Main_y) (<= Main_y 48)), 162823#(and (<= 49 Main_y) (<= Main_y 49)), 162820#(and (<= 46 Main_y) (<= Main_y 46)), 162821#(and (<= 47 Main_y) (<= Main_y 47)), 162826#(and (<= 52 Main_y) (<= Main_y 52)), 162827#(and (<= 53 Main_y) (<= Main_y 53)), 162824#(and (<= 50 Main_y) (<= Main_y 50)), 162825#(and (<= 51 Main_y) (<= Main_y 51)), 162830#(and (<= Main_y 56) (<= 56 Main_y)), 162831#(and (<= Main_y 57) (<= 57 Main_y)), 162828#(and (<= 54 Main_y) (<= Main_y 54)), 162829#(and (<= 55 Main_y) (<= Main_y 55)), 162834#(and (<= Main_y 60) (<= 60 Main_y)), 162835#(and (<= Main_y 61) (<= 61 Main_y)), 162832#(and (<= Main_y 58) (<= 58 Main_y)), 162833#(and (<= Main_y 59) (<= 59 Main_y)), 162838#(and (<= 64 Main_y) (<= Main_y 64)), 162839#(and (<= Main_y 65) (<= 65 Main_y)), 162836#(and (<= 62 Main_y) (<= Main_y 62)), 162837#(and (<= 63 Main_y) (<= Main_y 63)), 162842#(and (<= 68 Main_y) (<= Main_y 68)), 162843#(and (<= Main_y 69) (<= 69 Main_y)), 162840#(and (<= Main_y 66) (<= 66 Main_y)), 162841#(and (<= 67 Main_y) (<= Main_y 67)), 162846#(and (<= 72 Main_y) (<= Main_y 72)), 162847#(and (<= 73 Main_y) (<= Main_y 73)), 162844#(and (<= 70 Main_y) (<= Main_y 70)), 162845#(and (<= Main_y 71) (<= 71 Main_y)), 162850#(and (<= Main_y 76) (<= 76 Main_y)), 162851#(and (<= Main_y 77) (<= 77 Main_y)), 162848#(and (<= 74 Main_y) (<= Main_y 74)), 162849#(and (<= Main_y 75) (<= 75 Main_y)), 162854#(and (<= Main_y 80) (<= 80 Main_y)), 162855#(and (<= 81 Main_y) (<= Main_y 81)), 162852#(and (<= Main_y 78) (<= 78 Main_y)), 162853#(and (<= 79 Main_y) (<= Main_y 79)), 162858#(and (<= Main_y 84) (<= 84 Main_y)), 162859#(and (<= Main_y 85) (<= 85 Main_y)), 162856#(and (<= Main_y 82) (<= 82 Main_y)), 162857#(and (<= Main_y 83) (<= 83 Main_y)), 162862#(and (<= Main_y 88) (<= 88 Main_y)), 162863#(and (<= Main_y 89) (<= 89 Main_y)), 162860#(and (<= 86 Main_y) (<= Main_y 86)), 162861#(and (<= Main_y 87) (<= 87 Main_y)), 162866#(and (<= 92 Main_y) (<= Main_y 92)), 162867#(and (<= 93 Main_y) (<= Main_y 93)), 162864#(and (<= Main_y 90) (<= 90 Main_y)), 162865#(and (<= Main_y 91) (<= 91 Main_y)), 162870#(and (<= 96 Main_y) (<= Main_y 96)), 162871#(and (<= Main_y 97) (<= 97 Main_y)), 162868#(and (<= 94 Main_y) (<= Main_y 94)), 162869#(and (<= Main_y 95) (<= 95 Main_y)), 162872#(and (<= 98 Main_y) (<= Main_y 98)), 162873#(and (<= 99 Main_y) (<= Main_y 99)), 162774#(and (<= 0 Main_y) (<= Main_y 0)), 162775#(and (<= 1 Main_y) (<= Main_y 1)), 162772#true, 162773#false, 162778#(and (<= Main_y 4) (<= 4 Main_y)), 162779#(and (<= Main_y 5) (<= 5 Main_y)), 162776#(and (<= Main_y 2) (<= 2 Main_y)), 162777#(and (<= Main_y 3) (<= 3 Main_y)), 162782#(and (<= 8 Main_y) (<= Main_y 8)), 162783#(and (<= Main_y 9) (<= 9 Main_y)), 162780#(and (<= Main_y 6) (<= 6 Main_y)), 162781#(and (<= 7 Main_y) (<= Main_y 7)), 162786#(and (<= 12 Main_y) (<= Main_y 12)), 162787#(and (<= 13 Main_y) (<= Main_y 13)), 162784#(and (<= 10 Main_y) (<= Main_y 10)), 162785#(and (<= 11 Main_y) (<= Main_y 11)), 162790#(and (<= 16 Main_y) (<= Main_y 16)), 162791#(and (<= Main_y 17) (<= 17 Main_y)), 162788#(and (<= 14 Main_y) (<= Main_y 14)), 162789#(and (<= Main_y 15) (<= 15 Main_y)), 162794#(and (<= 20 Main_y) (<= Main_y 20)), 162795#(and (<= 21 Main_y) (<= Main_y 21)), 162792#(and (<= Main_y 18) (<= 18 Main_y)), 162793#(and (<= Main_y 19) (<= 19 Main_y)), 162798#(and (<= Main_y 24) (<= 24 Main_y)), 162799#(and (<= 25 Main_y) (<= Main_y 25)), 162796#(and (<= Main_y 22) (<= 22 Main_y)), 162797#(and (<= 23 Main_y) (<= Main_y 23)), 162802#(and (<= 28 Main_y) (<= Main_y 28)), 162803#(and (<= 29 Main_y) (<= Main_y 29)), 162800#(and (<= Main_y 26) (<= 26 Main_y)), 162801#(and (<= 27 Main_y) (<= Main_y 27)), 162806#(and (<= 32 Main_y) (<= Main_y 32)), 162807#(and (<= 33 Main_y) (<= Main_y 33)), 162804#(and (<= 30 Main_y) (<= Main_y 30)), 162805#(and (<= Main_y 31) (<= 31 Main_y)), 162810#(and (<= 36 Main_y) (<= Main_y 36)), 162811#(and (<= Main_y 37) (<= 37 Main_y)), 162808#(and (<= Main_y 34) (<= 34 Main_y)), 162809#(and (<= 35 Main_y) (<= Main_y 35)), 162814#(and (<= 40 Main_y) (<= Main_y 40)), 162815#(and (<= Main_y 41) (<= 41 Main_y)), 162812#(and (<= Main_y 38) (<= 38 Main_y)), 162813#(and (<= 39 Main_y) (<= Main_y 39))] [2018-07-23 13:58:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:45,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:58:45,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:58:45,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:58:45,832 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 102 states. [2018-07-23 13:58:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:47,286 INFO L93 Difference]: Finished difference Result 308 states and 310 transitions. [2018-07-23 13:58:47,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:58:47,286 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 203 [2018-07-23 13:58:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:47,287 INFO L225 Difference]: With dead ends: 308 [2018-07-23 13:58:47,287 INFO L226 Difference]: Without dead ends: 305 [2018-07-23 13:58:47,288 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:58:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-23 13:58:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 206. [2018-07-23 13:58:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-23 13:58:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-07-23 13:58:47,482 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 203 [2018-07-23 13:58:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:47,482 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-07-23 13:58:47,483 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:58:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-07-23 13:58:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 13:58:47,483 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:47,483 INFO L357 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2018-07-23 13:58:47,483 INFO L414 AbstractCegarLoop]: === Iteration 299 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 776458669, now seen corresponding path program 296 times [2018-07-23 13:58:47,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5050 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:47,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:47,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:58:47,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:47,865 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:58:47,866 INFO L185 omatonBuilderFactory]: Interpolants [163902#true, 163903#false, 163906#(<= Main_x 2), 163907#(<= Main_x 3), 163904#(<= Main_x 0), 163905#(<= Main_x 1), 163910#(<= Main_x 6), 163911#(<= Main_x 7), 163908#(<= Main_x 4), 163909#(<= Main_x 5), 163914#(<= Main_x 10), 163915#(<= Main_x 11), 163912#(<= Main_x 8), 163913#(<= Main_x 9), 163918#(<= Main_x 14), 163919#(<= Main_x 15), 163916#(<= Main_x 12), 163917#(<= Main_x 13), 163922#(<= Main_x 18), 163923#(<= Main_x 19), 163920#(<= Main_x 16), 163921#(<= Main_x 17), 163926#(<= Main_x 22), 163927#(<= Main_x 23), 163924#(<= Main_x 20), 163925#(<= Main_x 21), 163930#(<= Main_x 26), 163931#(<= Main_x 27), 163928#(<= Main_x 24), 163929#(<= Main_x 25), 163934#(<= Main_x 30), 163935#(<= Main_x 31), 163932#(<= Main_x 28), 163933#(<= Main_x 29), 163938#(<= Main_x 34), 163939#(<= Main_x 35), 163936#(<= Main_x 32), 163937#(<= Main_x 33), 163942#(<= Main_x 38), 163943#(<= Main_x 39), 163940#(<= Main_x 36), 163941#(<= Main_x 37), 163946#(<= Main_x 42), 163947#(<= Main_x 43), 163944#(<= Main_x 40), 163945#(<= Main_x 41), 163950#(<= Main_x 46), 163951#(<= Main_x 47), 163948#(<= Main_x 44), 163949#(<= Main_x 45), 163954#(<= Main_x 50), 163955#(<= Main_x 51), 163952#(<= Main_x 48), 163953#(<= Main_x 49), 163958#(<= Main_x 54), 163959#(<= Main_x 55), 163956#(<= Main_x 52), 163957#(<= Main_x 53), 163962#(<= Main_x 58), 163963#(<= Main_x 59), 163960#(<= Main_x 56), 163961#(<= Main_x 57), 163966#(<= Main_x 62), 163967#(<= Main_x 63), 163964#(<= Main_x 60), 163965#(<= Main_x 61), 163970#(<= Main_x 66), 163971#(<= Main_x 67), 163968#(<= Main_x 64), 163969#(<= Main_x 65), 163974#(<= Main_x 70), 163975#(<= Main_x 71), 163972#(<= Main_x 68), 163973#(<= Main_x 69), 163978#(<= Main_x 74), 163979#(<= Main_x 75), 163976#(<= Main_x 72), 163977#(<= Main_x 73), 163982#(<= Main_x 78), 163983#(<= Main_x 79), 163980#(<= Main_x 76), 163981#(<= Main_x 77), 163986#(<= Main_x 82), 163987#(<= Main_x 83), 163984#(<= Main_x 80), 163985#(<= Main_x 81), 163990#(<= Main_x 86), 163991#(<= Main_x 87), 163988#(<= Main_x 84), 163989#(<= Main_x 85), 163994#(<= Main_x 90), 163995#(<= Main_x 91), 163992#(<= Main_x 88), 163993#(<= Main_x 89), 163998#(<= Main_x 94), 163999#(<= Main_x 95), 163996#(<= Main_x 92), 163997#(<= Main_x 93), 164002#(<= Main_x 98), 164003#(<= Main_x 99), 164000#(<= Main_x 96), 164001#(<= Main_x 97), 164004#(<= (+ Main_x 1) 0)] [2018-07-23 13:58:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5050 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:47,866 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:58:47,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:58:47,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:58:47,867 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 103 states. [2018-07-23 13:58:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:48,453 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2018-07-23 13:58:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:58:48,453 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-23 13:58:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:48,453 INFO L225 Difference]: With dead ends: 309 [2018-07-23 13:58:48,453 INFO L226 Difference]: Without dead ends: 205 [2018-07-23 13:58:48,454 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:58:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-23 13:58:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-23 13:58:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-23 13:58:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-07-23 13:58:48,660 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 204 [2018-07-23 13:58:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:48,660 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-07-23 13:58:48,660 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:58:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-07-23 13:58:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 13:58:48,660 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:48,661 INFO L357 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2018-07-23 13:58:48,661 INFO L414 AbstractCegarLoop]: === Iteration 300 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash 112139847, now seen corresponding path program 297 times [2018-07-23 13:58:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5050 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:49,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:49,071 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:58:49,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:49,071 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:58:49,072 INFO L185 omatonBuilderFactory]: Interpolants [165122#(<= 87 Main_x), 165123#(<= 88 Main_x), 165120#(<= 85 Main_x), 165121#(<= 86 Main_x), 165126#(<= 91 Main_x), 165127#(<= 92 Main_x), 165124#(<= 89 Main_x), 165125#(<= 90 Main_x), 165130#(<= 95 Main_x), 165131#(<= 96 Main_x), 165128#(<= 93 Main_x), 165129#(<= 94 Main_x), 165134#(<= 99 Main_x), 165135#(<= 100 Main_x), 165132#(<= 97 Main_x), 165133#(<= 98 Main_x), 165034#false, 165035#(<= 0 Main_x), 165033#true, 165038#(<= 3 Main_x), 165039#(<= 4 Main_x), 165036#(<= 1 Main_x), 165037#(<= 2 Main_x), 165042#(<= 7 Main_x), 165043#(<= 8 Main_x), 165040#(<= 5 Main_x), 165041#(<= 6 Main_x), 165046#(<= 11 Main_x), 165047#(<= 12 Main_x), 165044#(<= 9 Main_x), 165045#(<= 10 Main_x), 165050#(<= 15 Main_x), 165051#(<= 16 Main_x), 165048#(<= 13 Main_x), 165049#(<= 14 Main_x), 165054#(<= 19 Main_x), 165055#(<= 20 Main_x), 165052#(<= 17 Main_x), 165053#(<= 18 Main_x), 165058#(<= 23 Main_x), 165059#(<= 24 Main_x), 165056#(<= 21 Main_x), 165057#(<= 22 Main_x), 165062#(<= 27 Main_x), 165063#(<= 28 Main_x), 165060#(<= 25 Main_x), 165061#(<= 26 Main_x), 165066#(<= 31 Main_x), 165067#(<= 32 Main_x), 165064#(<= 29 Main_x), 165065#(<= 30 Main_x), 165070#(<= 35 Main_x), 165071#(<= 36 Main_x), 165068#(<= 33 Main_x), 165069#(<= 34 Main_x), 165074#(<= 39 Main_x), 165075#(<= 40 Main_x), 165072#(<= 37 Main_x), 165073#(<= 38 Main_x), 165078#(<= 43 Main_x), 165079#(<= 44 Main_x), 165076#(<= 41 Main_x), 165077#(<= 42 Main_x), 165082#(<= 47 Main_x), 165083#(<= 48 Main_x), 165080#(<= 45 Main_x), 165081#(<= 46 Main_x), 165086#(<= 51 Main_x), 165087#(<= 52 Main_x), 165084#(<= 49 Main_x), 165085#(<= 50 Main_x), 165090#(<= 55 Main_x), 165091#(<= 56 Main_x), 165088#(<= 53 Main_x), 165089#(<= 54 Main_x), 165094#(<= 59 Main_x), 165095#(<= 60 Main_x), 165092#(<= 57 Main_x), 165093#(<= 58 Main_x), 165098#(<= 63 Main_x), 165099#(<= 64 Main_x), 165096#(<= 61 Main_x), 165097#(<= 62 Main_x), 165102#(<= 67 Main_x), 165103#(<= 68 Main_x), 165100#(<= 65 Main_x), 165101#(<= 66 Main_x), 165106#(<= 71 Main_x), 165107#(<= 72 Main_x), 165104#(<= 69 Main_x), 165105#(<= 70 Main_x), 165110#(<= 75 Main_x), 165111#(<= 76 Main_x), 165108#(<= 73 Main_x), 165109#(<= 74 Main_x), 165114#(<= 79 Main_x), 165115#(<= 80 Main_x), 165112#(<= 77 Main_x), 165113#(<= 78 Main_x), 165118#(<= 83 Main_x), 165119#(<= 84 Main_x), 165116#(<= 81 Main_x), 165117#(<= 82 Main_x)] [2018-07-23 13:58:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 5050 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:49,072 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:58:49,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:58:49,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:58:49,073 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-07-23 13:58:49,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:49,323 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-07-23 13:58:49,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:58:49,323 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-23 13:58:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:49,324 INFO L225 Difference]: With dead ends: 209 [2018-07-23 13:58:49,324 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 13:58:49,324 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:58:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 13:58:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-07-23 13:58:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-23 13:58:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 207 transitions. [2018-07-23 13:58:49,506 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 207 transitions. Word has length 204 [2018-07-23 13:58:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:49,506 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 207 transitions. [2018-07-23 13:58:49,506 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:58:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 207 transitions. [2018-07-23 13:58:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-23 13:58:49,507 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:49,507 INFO L357 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1] [2018-07-23 13:58:49,507 INFO L414 AbstractCegarLoop]: === Iteration 301 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:49,507 INFO L82 PathProgramCache]: Analyzing trace with hash -818693561, now seen corresponding path program 298 times [2018-07-23 13:58:49,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:50,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:50,099 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:58:50,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:50,100 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:58:50,100 INFO L185 omatonBuilderFactory]: Interpolants [165966#true, 165967#false, 165970#(and (<= Main_y 2) (<= 2 Main_y)), 165971#(and (<= Main_y 3) (<= 3 Main_y)), 165968#(and (<= 0 Main_y) (<= Main_y 0)), 165969#(and (<= 1 Main_y) (<= Main_y 1)), 165974#(and (<= Main_y 6) (<= 6 Main_y)), 165975#(and (<= 7 Main_y) (<= Main_y 7)), 165972#(and (<= Main_y 4) (<= 4 Main_y)), 165973#(and (<= Main_y 5) (<= 5 Main_y)), 165978#(and (<= 10 Main_y) (<= Main_y 10)), 165979#(and (<= 11 Main_y) (<= Main_y 11)), 165976#(and (<= 8 Main_y) (<= Main_y 8)), 165977#(and (<= Main_y 9) (<= 9 Main_y)), 165982#(and (<= 14 Main_y) (<= Main_y 14)), 165983#(and (<= Main_y 15) (<= 15 Main_y)), 165980#(and (<= 12 Main_y) (<= Main_y 12)), 165981#(and (<= 13 Main_y) (<= Main_y 13)), 165986#(and (<= Main_y 18) (<= 18 Main_y)), 165987#(and (<= Main_y 19) (<= 19 Main_y)), 165984#(and (<= 16 Main_y) (<= Main_y 16)), 165985#(and (<= Main_y 17) (<= 17 Main_y)), 165990#(and (<= Main_y 22) (<= 22 Main_y)), 165991#(and (<= 23 Main_y) (<= Main_y 23)), 165988#(and (<= 20 Main_y) (<= Main_y 20)), 165989#(and (<= 21 Main_y) (<= Main_y 21)), 165994#(and (<= Main_y 26) (<= 26 Main_y)), 165995#(and (<= 27 Main_y) (<= Main_y 27)), 165992#(and (<= Main_y 24) (<= 24 Main_y)), 165993#(and (<= 25 Main_y) (<= Main_y 25)), 165998#(and (<= 30 Main_y) (<= Main_y 30)), 165999#(and (<= Main_y 31) (<= 31 Main_y)), 165996#(and (<= 28 Main_y) (<= Main_y 28)), 165997#(and (<= 29 Main_y) (<= Main_y 29)), 166002#(and (<= Main_y 34) (<= 34 Main_y)), 166003#(and (<= 35 Main_y) (<= Main_y 35)), 166000#(and (<= 32 Main_y) (<= Main_y 32)), 166001#(and (<= 33 Main_y) (<= Main_y 33)), 166006#(and (<= Main_y 38) (<= 38 Main_y)), 166007#(and (<= 39 Main_y) (<= Main_y 39)), 166004#(and (<= 36 Main_y) (<= Main_y 36)), 166005#(and (<= Main_y 37) (<= 37 Main_y)), 166010#(and (<= 42 Main_y) (<= Main_y 42)), 166011#(and (<= 43 Main_y) (<= Main_y 43)), 166008#(and (<= 40 Main_y) (<= Main_y 40)), 166009#(and (<= Main_y 41) (<= 41 Main_y)), 166014#(and (<= 46 Main_y) (<= Main_y 46)), 166015#(and (<= 47 Main_y) (<= Main_y 47)), 166012#(and (<= 44 Main_y) (<= Main_y 44)), 166013#(and (<= Main_y 45) (<= 45 Main_y)), 166018#(and (<= 50 Main_y) (<= Main_y 50)), 166019#(and (<= 51 Main_y) (<= Main_y 51)), 166016#(and (<= 48 Main_y) (<= Main_y 48)), 166017#(and (<= 49 Main_y) (<= Main_y 49)), 166022#(and (<= 54 Main_y) (<= Main_y 54)), 166023#(and (<= 55 Main_y) (<= Main_y 55)), 166020#(and (<= 52 Main_y) (<= Main_y 52)), 166021#(and (<= 53 Main_y) (<= Main_y 53)), 166026#(and (<= Main_y 58) (<= 58 Main_y)), 166027#(and (<= Main_y 59) (<= 59 Main_y)), 166024#(and (<= Main_y 56) (<= 56 Main_y)), 166025#(and (<= Main_y 57) (<= 57 Main_y)), 166030#(and (<= 62 Main_y) (<= Main_y 62)), 166031#(and (<= 63 Main_y) (<= Main_y 63)), 166028#(and (<= Main_y 60) (<= 60 Main_y)), 166029#(and (<= Main_y 61) (<= 61 Main_y)), 166034#(and (<= Main_y 66) (<= 66 Main_y)), 166035#(and (<= 67 Main_y) (<= Main_y 67)), 166032#(and (<= 64 Main_y) (<= Main_y 64)), 166033#(and (<= Main_y 65) (<= 65 Main_y)), 166038#(and (<= 70 Main_y) (<= Main_y 70)), 166039#(and (<= Main_y 71) (<= 71 Main_y)), 166036#(and (<= 68 Main_y) (<= Main_y 68)), 166037#(and (<= Main_y 69) (<= 69 Main_y)), 166042#(and (<= 74 Main_y) (<= Main_y 74)), 166043#(and (<= Main_y 75) (<= 75 Main_y)), 166040#(and (<= 72 Main_y) (<= Main_y 72)), 166041#(and (<= 73 Main_y) (<= Main_y 73)), 166046#(and (<= Main_y 78) (<= 78 Main_y)), 166047#(and (<= 79 Main_y) (<= Main_y 79)), 166044#(and (<= Main_y 76) (<= 76 Main_y)), 166045#(and (<= Main_y 77) (<= 77 Main_y)), 166050#(and (<= Main_y 82) (<= 82 Main_y)), 166051#(and (<= Main_y 83) (<= 83 Main_y)), 166048#(and (<= Main_y 80) (<= 80 Main_y)), 166049#(and (<= 81 Main_y) (<= Main_y 81)), 166054#(and (<= 86 Main_y) (<= Main_y 86)), 166055#(and (<= Main_y 87) (<= 87 Main_y)), 166052#(and (<= Main_y 84) (<= 84 Main_y)), 166053#(and (<= Main_y 85) (<= 85 Main_y)), 166058#(and (<= Main_y 90) (<= 90 Main_y)), 166059#(and (<= Main_y 91) (<= 91 Main_y)), 166056#(and (<= Main_y 88) (<= 88 Main_y)), 166057#(and (<= Main_y 89) (<= 89 Main_y)), 166062#(and (<= 94 Main_y) (<= Main_y 94)), 166063#(and (<= Main_y 95) (<= 95 Main_y)), 166060#(and (<= 92 Main_y) (<= Main_y 92)), 166061#(and (<= 93 Main_y) (<= Main_y 93)), 166066#(and (<= 98 Main_y) (<= Main_y 98)), 166067#(and (<= 99 Main_y) (<= Main_y 99)), 166064#(and (<= 96 Main_y) (<= Main_y 96)), 166065#(and (<= Main_y 97) (<= 97 Main_y)), 166068#(and (<= Main_y 100) (<= 100 Main_y))] [2018-07-23 13:58:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:50,101 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:58:50,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:58:50,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:58:50,101 INFO L87 Difference]: Start difference. First operand 206 states and 207 transitions. Second operand 103 states. [2018-07-23 13:58:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:51,456 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2018-07-23 13:58:51,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:58:51,456 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 205 [2018-07-23 13:58:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:51,457 INFO L225 Difference]: With dead ends: 311 [2018-07-23 13:58:51,457 INFO L226 Difference]: Without dead ends: 308 [2018-07-23 13:58:51,457 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:58:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-07-23 13:58:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 208. [2018-07-23 13:58:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-23 13:58:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 210 transitions. [2018-07-23 13:58:51,672 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 210 transitions. Word has length 205 [2018-07-23 13:58:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:51,672 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 210 transitions. [2018-07-23 13:58:51,672 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:58:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 210 transitions. [2018-07-23 13:58:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-23 13:58:51,672 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:51,672 INFO L357 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2018-07-23 13:58:51,673 INFO L414 AbstractCegarLoop]: === Iteration 302 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:51,673 INFO L82 PathProgramCache]: Analyzing trace with hash 390241863, now seen corresponding path program 299 times [2018-07-23 13:58:51,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:52,097 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:52,097 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 13:58:52,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:52,097 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:58:52,097 INFO L185 omatonBuilderFactory]: Interpolants [167170#(<= Main_x 61), 167171#(<= Main_x 62), 167168#(<= Main_x 59), 167169#(<= Main_x 60), 167174#(<= Main_x 65), 167175#(<= Main_x 66), 167172#(<= Main_x 63), 167173#(<= Main_x 64), 167178#(<= Main_x 69), 167179#(<= Main_x 70), 167176#(<= Main_x 67), 167177#(<= Main_x 68), 167182#(<= Main_x 73), 167183#(<= Main_x 74), 167180#(<= Main_x 71), 167181#(<= Main_x 72), 167186#(<= Main_x 77), 167187#(<= Main_x 78), 167184#(<= Main_x 75), 167185#(<= Main_x 76), 167190#(<= Main_x 81), 167191#(<= Main_x 82), 167188#(<= Main_x 79), 167189#(<= Main_x 80), 167194#(<= Main_x 85), 167195#(<= Main_x 86), 167192#(<= Main_x 83), 167193#(<= Main_x 84), 167198#(<= Main_x 89), 167199#(<= Main_x 90), 167196#(<= Main_x 87), 167197#(<= Main_x 88), 167202#(<= Main_x 93), 167203#(<= Main_x 94), 167200#(<= Main_x 91), 167201#(<= Main_x 92), 167206#(<= Main_x 97), 167207#(<= Main_x 98), 167204#(<= Main_x 95), 167205#(<= Main_x 96), 167210#(<= (+ Main_x 1) 0), 167208#(<= Main_x 99), 167209#(<= Main_x 100), 167107#true, 167110#(<= Main_x 1), 167111#(<= Main_x 2), 167108#false, 167109#(<= Main_x 0), 167114#(<= Main_x 5), 167115#(<= Main_x 6), 167112#(<= Main_x 3), 167113#(<= Main_x 4), 167118#(<= Main_x 9), 167119#(<= Main_x 10), 167116#(<= Main_x 7), 167117#(<= Main_x 8), 167122#(<= Main_x 13), 167123#(<= Main_x 14), 167120#(<= Main_x 11), 167121#(<= Main_x 12), 167126#(<= Main_x 17), 167127#(<= Main_x 18), 167124#(<= Main_x 15), 167125#(<= Main_x 16), 167130#(<= Main_x 21), 167131#(<= Main_x 22), 167128#(<= Main_x 19), 167129#(<= Main_x 20), 167134#(<= Main_x 25), 167135#(<= Main_x 26), 167132#(<= Main_x 23), 167133#(<= Main_x 24), 167138#(<= Main_x 29), 167139#(<= Main_x 30), 167136#(<= Main_x 27), 167137#(<= Main_x 28), 167142#(<= Main_x 33), 167143#(<= Main_x 34), 167140#(<= Main_x 31), 167141#(<= Main_x 32), 167146#(<= Main_x 37), 167147#(<= Main_x 38), 167144#(<= Main_x 35), 167145#(<= Main_x 36), 167150#(<= Main_x 41), 167151#(<= Main_x 42), 167148#(<= Main_x 39), 167149#(<= Main_x 40), 167154#(<= Main_x 45), 167155#(<= Main_x 46), 167152#(<= Main_x 43), 167153#(<= Main_x 44), 167158#(<= Main_x 49), 167159#(<= Main_x 50), 167156#(<= Main_x 47), 167157#(<= Main_x 48), 167162#(<= Main_x 53), 167163#(<= Main_x 54), 167160#(<= Main_x 51), 167161#(<= Main_x 52), 167166#(<= Main_x 57), 167167#(<= Main_x 58), 167164#(<= Main_x 55), 167165#(<= Main_x 56)] [2018-07-23 13:58:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:52,098 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 13:58:52,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 13:58:52,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:58:52,099 INFO L87 Difference]: Start difference. First operand 208 states and 210 transitions. Second operand 104 states. [2018-07-23 13:58:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:52,617 INFO L93 Difference]: Finished difference Result 312 states and 314 transitions. [2018-07-23 13:58:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 13:58:52,617 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-23 13:58:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:52,618 INFO L225 Difference]: With dead ends: 312 [2018-07-23 13:58:52,618 INFO L226 Difference]: Without dead ends: 207 [2018-07-23 13:58:52,618 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:58:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-23 13:58:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-23 13:58:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-23 13:58:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-07-23 13:58:52,875 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 206 [2018-07-23 13:58:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:52,876 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-07-23 13:58:52,876 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 13:58:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-07-23 13:58:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-23 13:58:52,877 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:52,877 INFO L357 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2018-07-23 13:58:52,877 INFO L414 AbstractCegarLoop]: === Iteration 303 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1271194861, now seen corresponding path program 300 times [2018-07-23 13:58:52,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:53,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:53,369 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 13:58:53,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:53,370 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:58:53,370 INFO L185 omatonBuilderFactory]: Interpolants [168250#false, 168251#(<= 0 Main_x), 168249#true, 168254#(<= 3 Main_x), 168255#(<= 4 Main_x), 168252#(<= 1 Main_x), 168253#(<= 2 Main_x), 168258#(<= 7 Main_x), 168259#(<= 8 Main_x), 168256#(<= 5 Main_x), 168257#(<= 6 Main_x), 168262#(<= 11 Main_x), 168263#(<= 12 Main_x), 168260#(<= 9 Main_x), 168261#(<= 10 Main_x), 168266#(<= 15 Main_x), 168267#(<= 16 Main_x), 168264#(<= 13 Main_x), 168265#(<= 14 Main_x), 168270#(<= 19 Main_x), 168271#(<= 20 Main_x), 168268#(<= 17 Main_x), 168269#(<= 18 Main_x), 168274#(<= 23 Main_x), 168275#(<= 24 Main_x), 168272#(<= 21 Main_x), 168273#(<= 22 Main_x), 168278#(<= 27 Main_x), 168279#(<= 28 Main_x), 168276#(<= 25 Main_x), 168277#(<= 26 Main_x), 168282#(<= 31 Main_x), 168283#(<= 32 Main_x), 168280#(<= 29 Main_x), 168281#(<= 30 Main_x), 168286#(<= 35 Main_x), 168287#(<= 36 Main_x), 168284#(<= 33 Main_x), 168285#(<= 34 Main_x), 168290#(<= 39 Main_x), 168291#(<= 40 Main_x), 168288#(<= 37 Main_x), 168289#(<= 38 Main_x), 168294#(<= 43 Main_x), 168295#(<= 44 Main_x), 168292#(<= 41 Main_x), 168293#(<= 42 Main_x), 168298#(<= 47 Main_x), 168299#(<= 48 Main_x), 168296#(<= 45 Main_x), 168297#(<= 46 Main_x), 168302#(<= 51 Main_x), 168303#(<= 52 Main_x), 168300#(<= 49 Main_x), 168301#(<= 50 Main_x), 168306#(<= 55 Main_x), 168307#(<= 56 Main_x), 168304#(<= 53 Main_x), 168305#(<= 54 Main_x), 168310#(<= 59 Main_x), 168311#(<= 60 Main_x), 168308#(<= 57 Main_x), 168309#(<= 58 Main_x), 168314#(<= 63 Main_x), 168315#(<= 64 Main_x), 168312#(<= 61 Main_x), 168313#(<= 62 Main_x), 168318#(<= 67 Main_x), 168319#(<= 68 Main_x), 168316#(<= 65 Main_x), 168317#(<= 66 Main_x), 168322#(<= 71 Main_x), 168323#(<= 72 Main_x), 168320#(<= 69 Main_x), 168321#(<= 70 Main_x), 168326#(<= 75 Main_x), 168327#(<= 76 Main_x), 168324#(<= 73 Main_x), 168325#(<= 74 Main_x), 168330#(<= 79 Main_x), 168331#(<= 80 Main_x), 168328#(<= 77 Main_x), 168329#(<= 78 Main_x), 168334#(<= 83 Main_x), 168335#(<= 84 Main_x), 168332#(<= 81 Main_x), 168333#(<= 82 Main_x), 168338#(<= 87 Main_x), 168339#(<= 88 Main_x), 168336#(<= 85 Main_x), 168337#(<= 86 Main_x), 168342#(<= 91 Main_x), 168343#(<= 92 Main_x), 168340#(<= 89 Main_x), 168341#(<= 90 Main_x), 168346#(<= 95 Main_x), 168347#(<= 96 Main_x), 168344#(<= 93 Main_x), 168345#(<= 94 Main_x), 168350#(<= 99 Main_x), 168351#(<= 100 Main_x), 168348#(<= 97 Main_x), 168349#(<= 98 Main_x), 168352#(<= 101 Main_x)] [2018-07-23 13:58:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 5151 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:53,370 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 13:58:53,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 13:58:53,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:58:53,372 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-07-23 13:58:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:53,660 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2018-07-23 13:58:53,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 13:58:53,660 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-23 13:58:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:53,660 INFO L225 Difference]: With dead ends: 211 [2018-07-23 13:58:53,661 INFO L226 Difference]: Without dead ends: 208 [2018-07-23 13:58:53,661 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:58:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-07-23 13:58:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-07-23 13:58:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-23 13:58:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2018-07-23 13:58:53,871 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 206 [2018-07-23 13:58:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:53,871 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2018-07-23 13:58:53,871 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 13:58:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2018-07-23 13:58:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-23 13:58:53,872 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:53,872 INFO L357 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1] [2018-07-23 13:58:53,872 INFO L414 AbstractCegarLoop]: === Iteration 304 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash 752273505, now seen corresponding path program 301 times [2018-07-23 13:58:53,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:54,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:54,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:58:54,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:54,612 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:58:54,612 INFO L185 omatonBuilderFactory]: Interpolants [169218#(and (<= 25 Main_y) (<= Main_y 25)), 169219#(and (<= Main_y 26) (<= 26 Main_y)), 169216#(and (<= 23 Main_y) (<= Main_y 23)), 169217#(and (<= Main_y 24) (<= 24 Main_y)), 169222#(and (<= 29 Main_y) (<= Main_y 29)), 169223#(and (<= 30 Main_y) (<= Main_y 30)), 169220#(and (<= 27 Main_y) (<= Main_y 27)), 169221#(and (<= 28 Main_y) (<= Main_y 28)), 169226#(and (<= 33 Main_y) (<= Main_y 33)), 169227#(and (<= Main_y 34) (<= 34 Main_y)), 169224#(and (<= Main_y 31) (<= 31 Main_y)), 169225#(and (<= 32 Main_y) (<= Main_y 32)), 169230#(and (<= Main_y 37) (<= 37 Main_y)), 169231#(and (<= Main_y 38) (<= 38 Main_y)), 169228#(and (<= 35 Main_y) (<= Main_y 35)), 169229#(and (<= 36 Main_y) (<= Main_y 36)), 169234#(and (<= Main_y 41) (<= 41 Main_y)), 169235#(and (<= 42 Main_y) (<= Main_y 42)), 169232#(and (<= 39 Main_y) (<= Main_y 39)), 169233#(and (<= 40 Main_y) (<= Main_y 40)), 169238#(and (<= Main_y 45) (<= 45 Main_y)), 169239#(and (<= 46 Main_y) (<= Main_y 46)), 169236#(and (<= 43 Main_y) (<= Main_y 43)), 169237#(and (<= 44 Main_y) (<= Main_y 44)), 169242#(and (<= 49 Main_y) (<= Main_y 49)), 169243#(and (<= 50 Main_y) (<= Main_y 50)), 169240#(and (<= 47 Main_y) (<= Main_y 47)), 169241#(and (<= 48 Main_y) (<= Main_y 48)), 169246#(and (<= 53 Main_y) (<= Main_y 53)), 169247#(and (<= 54 Main_y) (<= Main_y 54)), 169244#(and (<= 51 Main_y) (<= Main_y 51)), 169245#(and (<= 52 Main_y) (<= Main_y 52)), 169250#(and (<= Main_y 57) (<= 57 Main_y)), 169251#(and (<= Main_y 58) (<= 58 Main_y)), 169248#(and (<= 55 Main_y) (<= Main_y 55)), 169249#(and (<= Main_y 56) (<= 56 Main_y)), 169254#(and (<= Main_y 61) (<= 61 Main_y)), 169255#(and (<= 62 Main_y) (<= Main_y 62)), 169252#(and (<= Main_y 59) (<= 59 Main_y)), 169253#(and (<= Main_y 60) (<= 60 Main_y)), 169258#(and (<= Main_y 65) (<= 65 Main_y)), 169259#(and (<= Main_y 66) (<= 66 Main_y)), 169256#(and (<= 63 Main_y) (<= Main_y 63)), 169257#(and (<= 64 Main_y) (<= Main_y 64)), 169262#(and (<= Main_y 69) (<= 69 Main_y)), 169263#(and (<= 70 Main_y) (<= Main_y 70)), 169260#(and (<= 67 Main_y) (<= Main_y 67)), 169261#(and (<= 68 Main_y) (<= Main_y 68)), 169266#(and (<= 73 Main_y) (<= Main_y 73)), 169267#(and (<= 74 Main_y) (<= Main_y 74)), 169264#(and (<= Main_y 71) (<= 71 Main_y)), 169265#(and (<= 72 Main_y) (<= Main_y 72)), 169270#(and (<= Main_y 77) (<= 77 Main_y)), 169271#(and (<= Main_y 78) (<= 78 Main_y)), 169268#(and (<= Main_y 75) (<= 75 Main_y)), 169269#(and (<= Main_y 76) (<= 76 Main_y)), 169274#(and (<= 81 Main_y) (<= Main_y 81)), 169275#(and (<= Main_y 82) (<= 82 Main_y)), 169272#(and (<= 79 Main_y) (<= Main_y 79)), 169273#(and (<= Main_y 80) (<= 80 Main_y)), 169278#(and (<= Main_y 85) (<= 85 Main_y)), 169279#(and (<= 86 Main_y) (<= Main_y 86)), 169276#(and (<= Main_y 83) (<= 83 Main_y)), 169277#(and (<= Main_y 84) (<= 84 Main_y)), 169282#(and (<= Main_y 89) (<= 89 Main_y)), 169283#(and (<= Main_y 90) (<= 90 Main_y)), 169280#(and (<= Main_y 87) (<= 87 Main_y)), 169281#(and (<= Main_y 88) (<= 88 Main_y)), 169286#(and (<= 93 Main_y) (<= Main_y 93)), 169287#(and (<= 94 Main_y) (<= Main_y 94)), 169284#(and (<= Main_y 91) (<= 91 Main_y)), 169285#(and (<= 92 Main_y) (<= Main_y 92)), 169290#(and (<= Main_y 97) (<= 97 Main_y)), 169291#(and (<= 98 Main_y) (<= Main_y 98)), 169288#(and (<= Main_y 95) (<= 95 Main_y)), 169289#(and (<= 96 Main_y) (<= Main_y 96)), 169294#(and (<= Main_y 101) (<= 101 Main_y)), 169292#(and (<= 99 Main_y) (<= Main_y 99)), 169293#(and (<= Main_y 100) (<= 100 Main_y)), 169191#true, 169194#(and (<= 1 Main_y) (<= Main_y 1)), 169195#(and (<= Main_y 2) (<= 2 Main_y)), 169192#false, 169193#(and (<= 0 Main_y) (<= Main_y 0)), 169198#(and (<= Main_y 5) (<= 5 Main_y)), 169199#(and (<= Main_y 6) (<= 6 Main_y)), 169196#(and (<= Main_y 3) (<= 3 Main_y)), 169197#(and (<= Main_y 4) (<= 4 Main_y)), 169202#(and (<= Main_y 9) (<= 9 Main_y)), 169203#(and (<= 10 Main_y) (<= Main_y 10)), 169200#(and (<= 7 Main_y) (<= Main_y 7)), 169201#(and (<= 8 Main_y) (<= Main_y 8)), 169206#(and (<= 13 Main_y) (<= Main_y 13)), 169207#(and (<= 14 Main_y) (<= Main_y 14)), 169204#(and (<= 11 Main_y) (<= Main_y 11)), 169205#(and (<= 12 Main_y) (<= Main_y 12)), 169210#(and (<= Main_y 17) (<= 17 Main_y)), 169211#(and (<= Main_y 18) (<= 18 Main_y)), 169208#(and (<= Main_y 15) (<= 15 Main_y)), 169209#(and (<= 16 Main_y) (<= Main_y 16)), 169214#(and (<= 21 Main_y) (<= Main_y 21)), 169215#(and (<= Main_y 22) (<= 22 Main_y)), 169212#(and (<= Main_y 19) (<= 19 Main_y)), 169213#(and (<= 20 Main_y) (<= Main_y 20))] [2018-07-23 13:58:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:54,613 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 13:58:54,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 13:58:54,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:58:54,613 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand 104 states. [2018-07-23 13:58:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:56,106 INFO L93 Difference]: Finished difference Result 314 states and 316 transitions. [2018-07-23 13:58:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 13:58:56,107 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 207 [2018-07-23 13:58:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:56,107 INFO L225 Difference]: With dead ends: 314 [2018-07-23 13:58:56,107 INFO L226 Difference]: Without dead ends: 311 [2018-07-23 13:58:56,108 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:58:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-23 13:58:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 210. [2018-07-23 13:58:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-07-23 13:58:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-07-23 13:58:56,324 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 207 [2018-07-23 13:58:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:56,325 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-07-23 13:58:56,325 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 13:58:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-07-23 13:58:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 13:58:56,325 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:56,325 INFO L357 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2018-07-23 13:58:56,325 INFO L414 AbstractCegarLoop]: === Iteration 305 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1845580653, now seen corresponding path program 302 times [2018-07-23 13:58:56,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 5253 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:56,814 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:56,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 13:58:56,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:56,814 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:58:56,814 INFO L185 omatonBuilderFactory]: Interpolants [170343#true, 170346#(<= Main_x 1), 170347#(<= Main_x 2), 170344#false, 170345#(<= Main_x 0), 170350#(<= Main_x 5), 170351#(<= Main_x 6), 170348#(<= Main_x 3), 170349#(<= Main_x 4), 170354#(<= Main_x 9), 170355#(<= Main_x 10), 170352#(<= Main_x 7), 170353#(<= Main_x 8), 170358#(<= Main_x 13), 170359#(<= Main_x 14), 170356#(<= Main_x 11), 170357#(<= Main_x 12), 170362#(<= Main_x 17), 170363#(<= Main_x 18), 170360#(<= Main_x 15), 170361#(<= Main_x 16), 170366#(<= Main_x 21), 170367#(<= Main_x 22), 170364#(<= Main_x 19), 170365#(<= Main_x 20), 170370#(<= Main_x 25), 170371#(<= Main_x 26), 170368#(<= Main_x 23), 170369#(<= Main_x 24), 170374#(<= Main_x 29), 170375#(<= Main_x 30), 170372#(<= Main_x 27), 170373#(<= Main_x 28), 170378#(<= Main_x 33), 170379#(<= Main_x 34), 170376#(<= Main_x 31), 170377#(<= Main_x 32), 170382#(<= Main_x 37), 170383#(<= Main_x 38), 170380#(<= Main_x 35), 170381#(<= Main_x 36), 170386#(<= Main_x 41), 170387#(<= Main_x 42), 170384#(<= Main_x 39), 170385#(<= Main_x 40), 170390#(<= Main_x 45), 170391#(<= Main_x 46), 170388#(<= Main_x 43), 170389#(<= Main_x 44), 170394#(<= Main_x 49), 170395#(<= Main_x 50), 170392#(<= Main_x 47), 170393#(<= Main_x 48), 170398#(<= Main_x 53), 170399#(<= Main_x 54), 170396#(<= Main_x 51), 170397#(<= Main_x 52), 170402#(<= Main_x 57), 170403#(<= Main_x 58), 170400#(<= Main_x 55), 170401#(<= Main_x 56), 170406#(<= Main_x 61), 170407#(<= Main_x 62), 170404#(<= Main_x 59), 170405#(<= Main_x 60), 170410#(<= Main_x 65), 170411#(<= Main_x 66), 170408#(<= Main_x 63), 170409#(<= Main_x 64), 170414#(<= Main_x 69), 170415#(<= Main_x 70), 170412#(<= Main_x 67), 170413#(<= Main_x 68), 170418#(<= Main_x 73), 170419#(<= Main_x 74), 170416#(<= Main_x 71), 170417#(<= Main_x 72), 170422#(<= Main_x 77), 170423#(<= Main_x 78), 170420#(<= Main_x 75), 170421#(<= Main_x 76), 170426#(<= Main_x 81), 170427#(<= Main_x 82), 170424#(<= Main_x 79), 170425#(<= Main_x 80), 170430#(<= Main_x 85), 170431#(<= Main_x 86), 170428#(<= Main_x 83), 170429#(<= Main_x 84), 170434#(<= Main_x 89), 170435#(<= Main_x 90), 170432#(<= Main_x 87), 170433#(<= Main_x 88), 170438#(<= Main_x 93), 170439#(<= Main_x 94), 170436#(<= Main_x 91), 170437#(<= Main_x 92), 170442#(<= Main_x 97), 170443#(<= Main_x 98), 170440#(<= Main_x 95), 170441#(<= Main_x 96), 170446#(<= Main_x 101), 170447#(<= (+ Main_x 1) 0), 170444#(<= Main_x 99), 170445#(<= Main_x 100)] [2018-07-23 13:58:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 5253 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:56,815 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 13:58:56,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 13:58:56,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:58:56,816 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 105 states. [2018-07-23 13:58:57,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:57,535 INFO L93 Difference]: Finished difference Result 315 states and 317 transitions. [2018-07-23 13:58:57,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 13:58:57,535 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-23 13:58:57,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:57,535 INFO L225 Difference]: With dead ends: 315 [2018-07-23 13:58:57,535 INFO L226 Difference]: Without dead ends: 209 [2018-07-23 13:58:57,536 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:58:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-23 13:58:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-23 13:58:57,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-23 13:58:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-07-23 13:58:57,748 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 208 [2018-07-23 13:58:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:57,748 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-07-23 13:58:57,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 13:58:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-07-23 13:58:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 13:58:57,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:57,749 INFO L357 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2018-07-23 13:58:57,749 INFO L414 AbstractCegarLoop]: === Iteration 306 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash -909647481, now seen corresponding path program 303 times [2018-07-23 13:58:57,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 5253 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:58,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:58,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 13:58:58,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:58,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:58:58,268 INFO L185 omatonBuilderFactory]: Interpolants [171522#(<= 24 Main_x), 171523#(<= 25 Main_x), 171520#(<= 22 Main_x), 171521#(<= 23 Main_x), 171526#(<= 28 Main_x), 171527#(<= 29 Main_x), 171524#(<= 26 Main_x), 171525#(<= 27 Main_x), 171530#(<= 32 Main_x), 171531#(<= 33 Main_x), 171528#(<= 30 Main_x), 171529#(<= 31 Main_x), 171534#(<= 36 Main_x), 171535#(<= 37 Main_x), 171532#(<= 34 Main_x), 171533#(<= 35 Main_x), 171538#(<= 40 Main_x), 171539#(<= 41 Main_x), 171536#(<= 38 Main_x), 171537#(<= 39 Main_x), 171542#(<= 44 Main_x), 171543#(<= 45 Main_x), 171540#(<= 42 Main_x), 171541#(<= 43 Main_x), 171546#(<= 48 Main_x), 171547#(<= 49 Main_x), 171544#(<= 46 Main_x), 171545#(<= 47 Main_x), 171550#(<= 52 Main_x), 171551#(<= 53 Main_x), 171548#(<= 50 Main_x), 171549#(<= 51 Main_x), 171554#(<= 56 Main_x), 171555#(<= 57 Main_x), 171552#(<= 54 Main_x), 171553#(<= 55 Main_x), 171558#(<= 60 Main_x), 171559#(<= 61 Main_x), 171556#(<= 58 Main_x), 171557#(<= 59 Main_x), 171562#(<= 64 Main_x), 171563#(<= 65 Main_x), 171560#(<= 62 Main_x), 171561#(<= 63 Main_x), 171566#(<= 68 Main_x), 171567#(<= 69 Main_x), 171564#(<= 66 Main_x), 171565#(<= 67 Main_x), 171570#(<= 72 Main_x), 171571#(<= 73 Main_x), 171568#(<= 70 Main_x), 171569#(<= 71 Main_x), 171574#(<= 76 Main_x), 171575#(<= 77 Main_x), 171572#(<= 74 Main_x), 171573#(<= 75 Main_x), 171578#(<= 80 Main_x), 171579#(<= 81 Main_x), 171576#(<= 78 Main_x), 171577#(<= 79 Main_x), 171582#(<= 84 Main_x), 171583#(<= 85 Main_x), 171580#(<= 82 Main_x), 171581#(<= 83 Main_x), 171586#(<= 88 Main_x), 171587#(<= 89 Main_x), 171584#(<= 86 Main_x), 171585#(<= 87 Main_x), 171590#(<= 92 Main_x), 171591#(<= 93 Main_x), 171588#(<= 90 Main_x), 171589#(<= 91 Main_x), 171594#(<= 96 Main_x), 171595#(<= 97 Main_x), 171592#(<= 94 Main_x), 171593#(<= 95 Main_x), 171598#(<= 100 Main_x), 171599#(<= 101 Main_x), 171596#(<= 98 Main_x), 171597#(<= 99 Main_x), 171600#(<= 102 Main_x), 171498#(<= 0 Main_x), 171499#(<= 1 Main_x), 171496#true, 171497#false, 171502#(<= 4 Main_x), 171503#(<= 5 Main_x), 171500#(<= 2 Main_x), 171501#(<= 3 Main_x), 171506#(<= 8 Main_x), 171507#(<= 9 Main_x), 171504#(<= 6 Main_x), 171505#(<= 7 Main_x), 171510#(<= 12 Main_x), 171511#(<= 13 Main_x), 171508#(<= 10 Main_x), 171509#(<= 11 Main_x), 171514#(<= 16 Main_x), 171515#(<= 17 Main_x), 171512#(<= 14 Main_x), 171513#(<= 15 Main_x), 171518#(<= 20 Main_x), 171519#(<= 21 Main_x), 171516#(<= 18 Main_x), 171517#(<= 19 Main_x)] [2018-07-23 13:58:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 5253 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:58,268 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 13:58:58,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 13:58:58,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:58:58,270 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2018-07-23 13:58:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:58:58,550 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-07-23 13:58:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 13:58:58,550 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-23 13:58:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:58:58,551 INFO L225 Difference]: With dead ends: 213 [2018-07-23 13:58:58,551 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 13:58:58,552 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:58:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 13:58:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-07-23 13:58:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-07-23 13:58:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-07-23 13:58:58,764 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 208 [2018-07-23 13:58:58,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:58:58,764 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-07-23 13:58:58,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 13:58:58,764 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-07-23 13:58:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-07-23 13:58:58,765 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:58:58,765 INFO L357 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1] [2018-07-23 13:58:58,765 INFO L414 AbstractCegarLoop]: === Iteration 307 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:58:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1865637639, now seen corresponding path program 304 times [2018-07-23 13:58:58,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:58:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:58:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:59,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:58:59,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 13:58:59,488 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:58:59,488 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:58:59,488 INFO L185 omatonBuilderFactory]: Interpolants [172546#(and (<= Main_y 97) (<= 97 Main_y)), 172547#(and (<= 98 Main_y) (<= Main_y 98)), 172544#(and (<= Main_y 95) (<= 95 Main_y)), 172545#(and (<= 96 Main_y) (<= Main_y 96)), 172550#(and (<= Main_y 101) (<= 101 Main_y)), 172551#(and (<= 102 Main_y) (<= Main_y 102)), 172548#(and (<= 99 Main_y) (<= Main_y 99)), 172549#(and (<= Main_y 100) (<= 100 Main_y)), 172447#true, 172450#(and (<= 1 Main_y) (<= Main_y 1)), 172451#(and (<= Main_y 2) (<= 2 Main_y)), 172448#false, 172449#(and (<= 0 Main_y) (<= Main_y 0)), 172454#(and (<= Main_y 5) (<= 5 Main_y)), 172455#(and (<= Main_y 6) (<= 6 Main_y)), 172452#(and (<= Main_y 3) (<= 3 Main_y)), 172453#(and (<= Main_y 4) (<= 4 Main_y)), 172458#(and (<= Main_y 9) (<= 9 Main_y)), 172459#(and (<= 10 Main_y) (<= Main_y 10)), 172456#(and (<= 7 Main_y) (<= Main_y 7)), 172457#(and (<= 8 Main_y) (<= Main_y 8)), 172462#(and (<= 13 Main_y) (<= Main_y 13)), 172463#(and (<= 14 Main_y) (<= Main_y 14)), 172460#(and (<= 11 Main_y) (<= Main_y 11)), 172461#(and (<= 12 Main_y) (<= Main_y 12)), 172466#(and (<= Main_y 17) (<= 17 Main_y)), 172467#(and (<= Main_y 18) (<= 18 Main_y)), 172464#(and (<= Main_y 15) (<= 15 Main_y)), 172465#(and (<= 16 Main_y) (<= Main_y 16)), 172470#(and (<= 21 Main_y) (<= Main_y 21)), 172471#(and (<= Main_y 22) (<= 22 Main_y)), 172468#(and (<= Main_y 19) (<= 19 Main_y)), 172469#(and (<= 20 Main_y) (<= Main_y 20)), 172474#(and (<= 25 Main_y) (<= Main_y 25)), 172475#(and (<= Main_y 26) (<= 26 Main_y)), 172472#(and (<= 23 Main_y) (<= Main_y 23)), 172473#(and (<= Main_y 24) (<= 24 Main_y)), 172478#(and (<= 29 Main_y) (<= Main_y 29)), 172479#(and (<= 30 Main_y) (<= Main_y 30)), 172476#(and (<= 27 Main_y) (<= Main_y 27)), 172477#(and (<= 28 Main_y) (<= Main_y 28)), 172482#(and (<= 33 Main_y) (<= Main_y 33)), 172483#(and (<= Main_y 34) (<= 34 Main_y)), 172480#(and (<= Main_y 31) (<= 31 Main_y)), 172481#(and (<= 32 Main_y) (<= Main_y 32)), 172486#(and (<= Main_y 37) (<= 37 Main_y)), 172487#(and (<= Main_y 38) (<= 38 Main_y)), 172484#(and (<= 35 Main_y) (<= Main_y 35)), 172485#(and (<= 36 Main_y) (<= Main_y 36)), 172490#(and (<= Main_y 41) (<= 41 Main_y)), 172491#(and (<= 42 Main_y) (<= Main_y 42)), 172488#(and (<= 39 Main_y) (<= Main_y 39)), 172489#(and (<= 40 Main_y) (<= Main_y 40)), 172494#(and (<= Main_y 45) (<= 45 Main_y)), 172495#(and (<= 46 Main_y) (<= Main_y 46)), 172492#(and (<= 43 Main_y) (<= Main_y 43)), 172493#(and (<= 44 Main_y) (<= Main_y 44)), 172498#(and (<= 49 Main_y) (<= Main_y 49)), 172499#(and (<= 50 Main_y) (<= Main_y 50)), 172496#(and (<= 47 Main_y) (<= Main_y 47)), 172497#(and (<= 48 Main_y) (<= Main_y 48)), 172502#(and (<= 53 Main_y) (<= Main_y 53)), 172503#(and (<= 54 Main_y) (<= Main_y 54)), 172500#(and (<= 51 Main_y) (<= Main_y 51)), 172501#(and (<= 52 Main_y) (<= Main_y 52)), 172506#(and (<= Main_y 57) (<= 57 Main_y)), 172507#(and (<= Main_y 58) (<= 58 Main_y)), 172504#(and (<= 55 Main_y) (<= Main_y 55)), 172505#(and (<= Main_y 56) (<= 56 Main_y)), 172510#(and (<= Main_y 61) (<= 61 Main_y)), 172511#(and (<= 62 Main_y) (<= Main_y 62)), 172508#(and (<= Main_y 59) (<= 59 Main_y)), 172509#(and (<= Main_y 60) (<= 60 Main_y)), 172514#(and (<= Main_y 65) (<= 65 Main_y)), 172515#(and (<= Main_y 66) (<= 66 Main_y)), 172512#(and (<= 63 Main_y) (<= Main_y 63)), 172513#(and (<= 64 Main_y) (<= Main_y 64)), 172518#(and (<= Main_y 69) (<= 69 Main_y)), 172519#(and (<= 70 Main_y) (<= Main_y 70)), 172516#(and (<= 67 Main_y) (<= Main_y 67)), 172517#(and (<= 68 Main_y) (<= Main_y 68)), 172522#(and (<= 73 Main_y) (<= Main_y 73)), 172523#(and (<= 74 Main_y) (<= Main_y 74)), 172520#(and (<= Main_y 71) (<= 71 Main_y)), 172521#(and (<= 72 Main_y) (<= Main_y 72)), 172526#(and (<= Main_y 77) (<= 77 Main_y)), 172527#(and (<= Main_y 78) (<= 78 Main_y)), 172524#(and (<= Main_y 75) (<= 75 Main_y)), 172525#(and (<= Main_y 76) (<= 76 Main_y)), 172530#(and (<= 81 Main_y) (<= Main_y 81)), 172531#(and (<= Main_y 82) (<= 82 Main_y)), 172528#(and (<= 79 Main_y) (<= Main_y 79)), 172529#(and (<= Main_y 80) (<= 80 Main_y)), 172534#(and (<= Main_y 85) (<= 85 Main_y)), 172535#(and (<= 86 Main_y) (<= Main_y 86)), 172532#(and (<= Main_y 83) (<= 83 Main_y)), 172533#(and (<= Main_y 84) (<= 84 Main_y)), 172538#(and (<= Main_y 89) (<= 89 Main_y)), 172539#(and (<= Main_y 90) (<= 90 Main_y)), 172536#(and (<= Main_y 87) (<= 87 Main_y)), 172537#(and (<= Main_y 88) (<= 88 Main_y)), 172542#(and (<= 93 Main_y) (<= Main_y 93)), 172543#(and (<= 94 Main_y) (<= Main_y 94)), 172540#(and (<= Main_y 91) (<= 91 Main_y)), 172541#(and (<= 92 Main_y) (<= Main_y 92))] [2018-07-23 13:58:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:58:59,489 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 13:58:59,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 13:58:59,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:58:59,490 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 105 states. [2018-07-23 13:59:01,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:01,025 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-07-23 13:59:01,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 13:59:01,025 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 209 [2018-07-23 13:59:01,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:01,026 INFO L225 Difference]: With dead ends: 317 [2018-07-23 13:59:01,026 INFO L226 Difference]: Without dead ends: 314 [2018-07-23 13:59:01,027 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:59:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-07-23 13:59:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 212. [2018-07-23 13:59:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-23 13:59:01,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2018-07-23 13:59:01,271 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 209 [2018-07-23 13:59:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2018-07-23 13:59:01,271 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 13:59:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2018-07-23 13:59:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-23 13:59:01,272 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:01,272 INFO L357 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2018-07-23 13:59:01,272 INFO L414 AbstractCegarLoop]: === Iteration 308 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:01,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2000130439, now seen corresponding path program 305 times [2018-07-23 13:59:01,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:01,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:01,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 13:59:01,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:01,786 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:59:01,786 INFO L185 omatonBuilderFactory]: Interpolants [173610#true, 173611#false, 173614#(<= Main_x 2), 173615#(<= Main_x 3), 173612#(<= Main_x 0), 173613#(<= Main_x 1), 173618#(<= Main_x 6), 173619#(<= Main_x 7), 173616#(<= Main_x 4), 173617#(<= Main_x 5), 173622#(<= Main_x 10), 173623#(<= Main_x 11), 173620#(<= Main_x 8), 173621#(<= Main_x 9), 173626#(<= Main_x 14), 173627#(<= Main_x 15), 173624#(<= Main_x 12), 173625#(<= Main_x 13), 173630#(<= Main_x 18), 173631#(<= Main_x 19), 173628#(<= Main_x 16), 173629#(<= Main_x 17), 173634#(<= Main_x 22), 173635#(<= Main_x 23), 173632#(<= Main_x 20), 173633#(<= Main_x 21), 173638#(<= Main_x 26), 173639#(<= Main_x 27), 173636#(<= Main_x 24), 173637#(<= Main_x 25), 173642#(<= Main_x 30), 173643#(<= Main_x 31), 173640#(<= Main_x 28), 173641#(<= Main_x 29), 173646#(<= Main_x 34), 173647#(<= Main_x 35), 173644#(<= Main_x 32), 173645#(<= Main_x 33), 173650#(<= Main_x 38), 173651#(<= Main_x 39), 173648#(<= Main_x 36), 173649#(<= Main_x 37), 173654#(<= Main_x 42), 173655#(<= Main_x 43), 173652#(<= Main_x 40), 173653#(<= Main_x 41), 173658#(<= Main_x 46), 173659#(<= Main_x 47), 173656#(<= Main_x 44), 173657#(<= Main_x 45), 173662#(<= Main_x 50), 173663#(<= Main_x 51), 173660#(<= Main_x 48), 173661#(<= Main_x 49), 173666#(<= Main_x 54), 173667#(<= Main_x 55), 173664#(<= Main_x 52), 173665#(<= Main_x 53), 173670#(<= Main_x 58), 173671#(<= Main_x 59), 173668#(<= Main_x 56), 173669#(<= Main_x 57), 173674#(<= Main_x 62), 173675#(<= Main_x 63), 173672#(<= Main_x 60), 173673#(<= Main_x 61), 173678#(<= Main_x 66), 173679#(<= Main_x 67), 173676#(<= Main_x 64), 173677#(<= Main_x 65), 173682#(<= Main_x 70), 173683#(<= Main_x 71), 173680#(<= Main_x 68), 173681#(<= Main_x 69), 173686#(<= Main_x 74), 173687#(<= Main_x 75), 173684#(<= Main_x 72), 173685#(<= Main_x 73), 173690#(<= Main_x 78), 173691#(<= Main_x 79), 173688#(<= Main_x 76), 173689#(<= Main_x 77), 173694#(<= Main_x 82), 173695#(<= Main_x 83), 173692#(<= Main_x 80), 173693#(<= Main_x 81), 173698#(<= Main_x 86), 173699#(<= Main_x 87), 173696#(<= Main_x 84), 173697#(<= Main_x 85), 173702#(<= Main_x 90), 173703#(<= Main_x 91), 173700#(<= Main_x 88), 173701#(<= Main_x 89), 173706#(<= Main_x 94), 173707#(<= Main_x 95), 173704#(<= Main_x 92), 173705#(<= Main_x 93), 173710#(<= Main_x 98), 173711#(<= Main_x 99), 173708#(<= Main_x 96), 173709#(<= Main_x 97), 173714#(<= Main_x 102), 173715#(<= (+ Main_x 1) 0), 173712#(<= Main_x 100), 173713#(<= Main_x 101)] [2018-07-23 13:59:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:01,787 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 13:59:01,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 13:59:01,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:59:01,788 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 106 states. [2018-07-23 13:59:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:02,453 INFO L93 Difference]: Finished difference Result 318 states and 320 transitions. [2018-07-23 13:59:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 13:59:02,454 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-23 13:59:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:02,454 INFO L225 Difference]: With dead ends: 318 [2018-07-23 13:59:02,454 INFO L226 Difference]: Without dead ends: 211 [2018-07-23 13:59:02,455 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:59:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-23 13:59:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-23 13:59:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-23 13:59:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-07-23 13:59:02,646 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 210 [2018-07-23 13:59:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:02,646 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-07-23 13:59:02,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 13:59:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-07-23 13:59:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-23 13:59:02,647 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:02,647 INFO L357 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2018-07-23 13:59:02,647 INFO L414 AbstractCegarLoop]: === Iteration 309 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:02,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1807563091, now seen corresponding path program 306 times [2018-07-23 13:59:02,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:03,125 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:03,125 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 13:59:03,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:03,125 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:59:03,125 INFO L185 omatonBuilderFactory]: Interpolants [174850#(<= 74 Main_x), 174851#(<= 75 Main_x), 174848#(<= 72 Main_x), 174849#(<= 73 Main_x), 174854#(<= 78 Main_x), 174855#(<= 79 Main_x), 174852#(<= 76 Main_x), 174853#(<= 77 Main_x), 174858#(<= 82 Main_x), 174859#(<= 83 Main_x), 174856#(<= 80 Main_x), 174857#(<= 81 Main_x), 174862#(<= 86 Main_x), 174863#(<= 87 Main_x), 174860#(<= 84 Main_x), 174861#(<= 85 Main_x), 174866#(<= 90 Main_x), 174867#(<= 91 Main_x), 174864#(<= 88 Main_x), 174865#(<= 89 Main_x), 174870#(<= 94 Main_x), 174871#(<= 95 Main_x), 174868#(<= 92 Main_x), 174869#(<= 93 Main_x), 174874#(<= 98 Main_x), 174875#(<= 99 Main_x), 174872#(<= 96 Main_x), 174873#(<= 97 Main_x), 174878#(<= 102 Main_x), 174879#(<= 103 Main_x), 174876#(<= 100 Main_x), 174877#(<= 101 Main_x), 174774#true, 174775#false, 174778#(<= 2 Main_x), 174779#(<= 3 Main_x), 174776#(<= 0 Main_x), 174777#(<= 1 Main_x), 174782#(<= 6 Main_x), 174783#(<= 7 Main_x), 174780#(<= 4 Main_x), 174781#(<= 5 Main_x), 174786#(<= 10 Main_x), 174787#(<= 11 Main_x), 174784#(<= 8 Main_x), 174785#(<= 9 Main_x), 174790#(<= 14 Main_x), 174791#(<= 15 Main_x), 174788#(<= 12 Main_x), 174789#(<= 13 Main_x), 174794#(<= 18 Main_x), 174795#(<= 19 Main_x), 174792#(<= 16 Main_x), 174793#(<= 17 Main_x), 174798#(<= 22 Main_x), 174799#(<= 23 Main_x), 174796#(<= 20 Main_x), 174797#(<= 21 Main_x), 174802#(<= 26 Main_x), 174803#(<= 27 Main_x), 174800#(<= 24 Main_x), 174801#(<= 25 Main_x), 174806#(<= 30 Main_x), 174807#(<= 31 Main_x), 174804#(<= 28 Main_x), 174805#(<= 29 Main_x), 174810#(<= 34 Main_x), 174811#(<= 35 Main_x), 174808#(<= 32 Main_x), 174809#(<= 33 Main_x), 174814#(<= 38 Main_x), 174815#(<= 39 Main_x), 174812#(<= 36 Main_x), 174813#(<= 37 Main_x), 174818#(<= 42 Main_x), 174819#(<= 43 Main_x), 174816#(<= 40 Main_x), 174817#(<= 41 Main_x), 174822#(<= 46 Main_x), 174823#(<= 47 Main_x), 174820#(<= 44 Main_x), 174821#(<= 45 Main_x), 174826#(<= 50 Main_x), 174827#(<= 51 Main_x), 174824#(<= 48 Main_x), 174825#(<= 49 Main_x), 174830#(<= 54 Main_x), 174831#(<= 55 Main_x), 174828#(<= 52 Main_x), 174829#(<= 53 Main_x), 174834#(<= 58 Main_x), 174835#(<= 59 Main_x), 174832#(<= 56 Main_x), 174833#(<= 57 Main_x), 174838#(<= 62 Main_x), 174839#(<= 63 Main_x), 174836#(<= 60 Main_x), 174837#(<= 61 Main_x), 174842#(<= 66 Main_x), 174843#(<= 67 Main_x), 174840#(<= 64 Main_x), 174841#(<= 65 Main_x), 174846#(<= 70 Main_x), 174847#(<= 71 Main_x), 174844#(<= 68 Main_x), 174845#(<= 69 Main_x)] [2018-07-23 13:59:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 5356 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:03,126 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 13:59:03,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 13:59:03,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:59:03,127 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2018-07-23 13:59:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:03,440 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-07-23 13:59:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 13:59:03,441 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-23 13:59:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:03,441 INFO L225 Difference]: With dead ends: 215 [2018-07-23 13:59:03,441 INFO L226 Difference]: Without dead ends: 212 [2018-07-23 13:59:03,442 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:59:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-07-23 13:59:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-07-23 13:59:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-07-23 13:59:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 213 transitions. [2018-07-23 13:59:03,661 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 213 transitions. Word has length 210 [2018-07-23 13:59:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:03,661 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 213 transitions. [2018-07-23 13:59:03,661 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 13:59:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 213 transitions. [2018-07-23 13:59:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-07-23 13:59:03,662 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:03,662 INFO L357 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1] [2018-07-23 13:59:03,662 INFO L414 AbstractCegarLoop]: === Iteration 310 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -199942495, now seen corresponding path program 307 times [2018-07-23 13:59:03,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:04,432 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:04,433 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 13:59:04,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:04,433 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:59:04,433 INFO L185 omatonBuilderFactory]: Interpolants [175734#true, 175735#false, 175738#(and (<= Main_y 2) (<= 2 Main_y)), 175739#(and (<= Main_y 3) (<= 3 Main_y)), 175736#(and (<= 0 Main_y) (<= Main_y 0)), 175737#(and (<= 1 Main_y) (<= Main_y 1)), 175742#(and (<= Main_y 6) (<= 6 Main_y)), 175743#(and (<= 7 Main_y) (<= Main_y 7)), 175740#(and (<= Main_y 4) (<= 4 Main_y)), 175741#(and (<= Main_y 5) (<= 5 Main_y)), 175746#(and (<= 10 Main_y) (<= Main_y 10)), 175747#(and (<= 11 Main_y) (<= Main_y 11)), 175744#(and (<= 8 Main_y) (<= Main_y 8)), 175745#(and (<= Main_y 9) (<= 9 Main_y)), 175750#(and (<= 14 Main_y) (<= Main_y 14)), 175751#(and (<= Main_y 15) (<= 15 Main_y)), 175748#(and (<= 12 Main_y) (<= Main_y 12)), 175749#(and (<= 13 Main_y) (<= Main_y 13)), 175754#(and (<= Main_y 18) (<= 18 Main_y)), 175755#(and (<= Main_y 19) (<= 19 Main_y)), 175752#(and (<= 16 Main_y) (<= Main_y 16)), 175753#(and (<= Main_y 17) (<= 17 Main_y)), 175758#(and (<= Main_y 22) (<= 22 Main_y)), 175759#(and (<= 23 Main_y) (<= Main_y 23)), 175756#(and (<= 20 Main_y) (<= Main_y 20)), 175757#(and (<= 21 Main_y) (<= Main_y 21)), 175762#(and (<= Main_y 26) (<= 26 Main_y)), 175763#(and (<= 27 Main_y) (<= Main_y 27)), 175760#(and (<= Main_y 24) (<= 24 Main_y)), 175761#(and (<= 25 Main_y) (<= Main_y 25)), 175766#(and (<= 30 Main_y) (<= Main_y 30)), 175767#(and (<= Main_y 31) (<= 31 Main_y)), 175764#(and (<= 28 Main_y) (<= Main_y 28)), 175765#(and (<= 29 Main_y) (<= Main_y 29)), 175770#(and (<= Main_y 34) (<= 34 Main_y)), 175771#(and (<= 35 Main_y) (<= Main_y 35)), 175768#(and (<= 32 Main_y) (<= Main_y 32)), 175769#(and (<= 33 Main_y) (<= Main_y 33)), 175774#(and (<= Main_y 38) (<= 38 Main_y)), 175775#(and (<= 39 Main_y) (<= Main_y 39)), 175772#(and (<= 36 Main_y) (<= Main_y 36)), 175773#(and (<= Main_y 37) (<= 37 Main_y)), 175778#(and (<= 42 Main_y) (<= Main_y 42)), 175779#(and (<= 43 Main_y) (<= Main_y 43)), 175776#(and (<= 40 Main_y) (<= Main_y 40)), 175777#(and (<= Main_y 41) (<= 41 Main_y)), 175782#(and (<= 46 Main_y) (<= Main_y 46)), 175783#(and (<= 47 Main_y) (<= Main_y 47)), 175780#(and (<= 44 Main_y) (<= Main_y 44)), 175781#(and (<= Main_y 45) (<= 45 Main_y)), 175786#(and (<= 50 Main_y) (<= Main_y 50)), 175787#(and (<= 51 Main_y) (<= Main_y 51)), 175784#(and (<= 48 Main_y) (<= Main_y 48)), 175785#(and (<= 49 Main_y) (<= Main_y 49)), 175790#(and (<= 54 Main_y) (<= Main_y 54)), 175791#(and (<= 55 Main_y) (<= Main_y 55)), 175788#(and (<= 52 Main_y) (<= Main_y 52)), 175789#(and (<= 53 Main_y) (<= Main_y 53)), 175794#(and (<= Main_y 58) (<= 58 Main_y)), 175795#(and (<= Main_y 59) (<= 59 Main_y)), 175792#(and (<= Main_y 56) (<= 56 Main_y)), 175793#(and (<= Main_y 57) (<= 57 Main_y)), 175798#(and (<= 62 Main_y) (<= Main_y 62)), 175799#(and (<= 63 Main_y) (<= Main_y 63)), 175796#(and (<= Main_y 60) (<= 60 Main_y)), 175797#(and (<= Main_y 61) (<= 61 Main_y)), 175802#(and (<= Main_y 66) (<= 66 Main_y)), 175803#(and (<= 67 Main_y) (<= Main_y 67)), 175800#(and (<= 64 Main_y) (<= Main_y 64)), 175801#(and (<= Main_y 65) (<= 65 Main_y)), 175806#(and (<= 70 Main_y) (<= Main_y 70)), 175807#(and (<= Main_y 71) (<= 71 Main_y)), 175804#(and (<= 68 Main_y) (<= Main_y 68)), 175805#(and (<= Main_y 69) (<= 69 Main_y)), 175810#(and (<= 74 Main_y) (<= Main_y 74)), 175811#(and (<= Main_y 75) (<= 75 Main_y)), 175808#(and (<= 72 Main_y) (<= Main_y 72)), 175809#(and (<= 73 Main_y) (<= Main_y 73)), 175814#(and (<= Main_y 78) (<= 78 Main_y)), 175815#(and (<= 79 Main_y) (<= Main_y 79)), 175812#(and (<= Main_y 76) (<= 76 Main_y)), 175813#(and (<= Main_y 77) (<= 77 Main_y)), 175818#(and (<= Main_y 82) (<= 82 Main_y)), 175819#(and (<= Main_y 83) (<= 83 Main_y)), 175816#(and (<= Main_y 80) (<= 80 Main_y)), 175817#(and (<= 81 Main_y) (<= Main_y 81)), 175822#(and (<= 86 Main_y) (<= Main_y 86)), 175823#(and (<= Main_y 87) (<= 87 Main_y)), 175820#(and (<= Main_y 84) (<= 84 Main_y)), 175821#(and (<= Main_y 85) (<= 85 Main_y)), 175826#(and (<= Main_y 90) (<= 90 Main_y)), 175827#(and (<= Main_y 91) (<= 91 Main_y)), 175824#(and (<= Main_y 88) (<= 88 Main_y)), 175825#(and (<= Main_y 89) (<= 89 Main_y)), 175830#(and (<= 94 Main_y) (<= Main_y 94)), 175831#(and (<= Main_y 95) (<= 95 Main_y)), 175828#(and (<= 92 Main_y) (<= Main_y 92)), 175829#(and (<= 93 Main_y) (<= Main_y 93)), 175834#(and (<= 98 Main_y) (<= Main_y 98)), 175835#(and (<= 99 Main_y) (<= Main_y 99)), 175832#(and (<= 96 Main_y) (<= Main_y 96)), 175833#(and (<= Main_y 97) (<= 97 Main_y)), 175838#(and (<= 102 Main_y) (<= Main_y 102)), 175839#(and (<= 103 Main_y) (<= Main_y 103)), 175836#(and (<= Main_y 100) (<= 100 Main_y)), 175837#(and (<= Main_y 101) (<= 101 Main_y))] [2018-07-23 13:59:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:04,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 13:59:04,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 13:59:04,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:59:04,435 INFO L87 Difference]: Start difference. First operand 212 states and 213 transitions. Second operand 106 states. [2018-07-23 13:59:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:06,018 INFO L93 Difference]: Finished difference Result 320 states and 322 transitions. [2018-07-23 13:59:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 13:59:06,018 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 211 [2018-07-23 13:59:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:06,018 INFO L225 Difference]: With dead ends: 320 [2018-07-23 13:59:06,019 INFO L226 Difference]: Without dead ends: 317 [2018-07-23 13:59:06,019 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:59:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-23 13:59:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 214. [2018-07-23 13:59:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-23 13:59:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 216 transitions. [2018-07-23 13:59:06,245 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 216 transitions. Word has length 211 [2018-07-23 13:59:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:06,245 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 216 transitions. [2018-07-23 13:59:06,246 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 13:59:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 216 transitions. [2018-07-23 13:59:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-23 13:59:06,246 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:06,247 INFO L357 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2018-07-23 13:59:06,247 INFO L414 AbstractCegarLoop]: === Iteration 311 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:06,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1903311571, now seen corresponding path program 308 times [2018-07-23 13:59:06,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5460 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:06,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:06,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 13:59:06,756 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:06,756 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:59:06,757 INFO L185 omatonBuilderFactory]: Interpolants [176910#(<= Main_x 0), 176911#(<= Main_x 1), 176908#true, 176909#false, 176914#(<= Main_x 4), 176915#(<= Main_x 5), 176912#(<= Main_x 2), 176913#(<= Main_x 3), 176918#(<= Main_x 8), 176919#(<= Main_x 9), 176916#(<= Main_x 6), 176917#(<= Main_x 7), 176922#(<= Main_x 12), 176923#(<= Main_x 13), 176920#(<= Main_x 10), 176921#(<= Main_x 11), 176926#(<= Main_x 16), 176927#(<= Main_x 17), 176924#(<= Main_x 14), 176925#(<= Main_x 15), 176930#(<= Main_x 20), 176931#(<= Main_x 21), 176928#(<= Main_x 18), 176929#(<= Main_x 19), 176934#(<= Main_x 24), 176935#(<= Main_x 25), 176932#(<= Main_x 22), 176933#(<= Main_x 23), 176938#(<= Main_x 28), 176939#(<= Main_x 29), 176936#(<= Main_x 26), 176937#(<= Main_x 27), 176942#(<= Main_x 32), 176943#(<= Main_x 33), 176940#(<= Main_x 30), 176941#(<= Main_x 31), 176946#(<= Main_x 36), 176947#(<= Main_x 37), 176944#(<= Main_x 34), 176945#(<= Main_x 35), 176950#(<= Main_x 40), 176951#(<= Main_x 41), 176948#(<= Main_x 38), 176949#(<= Main_x 39), 176954#(<= Main_x 44), 176955#(<= Main_x 45), 176952#(<= Main_x 42), 176953#(<= Main_x 43), 176958#(<= Main_x 48), 176959#(<= Main_x 49), 176956#(<= Main_x 46), 176957#(<= Main_x 47), 176962#(<= Main_x 52), 176963#(<= Main_x 53), 176960#(<= Main_x 50), 176961#(<= Main_x 51), 176966#(<= Main_x 56), 176967#(<= Main_x 57), 176964#(<= Main_x 54), 176965#(<= Main_x 55), 176970#(<= Main_x 60), 176971#(<= Main_x 61), 176968#(<= Main_x 58), 176969#(<= Main_x 59), 176974#(<= Main_x 64), 176975#(<= Main_x 65), 176972#(<= Main_x 62), 176973#(<= Main_x 63), 176978#(<= Main_x 68), 176979#(<= Main_x 69), 176976#(<= Main_x 66), 176977#(<= Main_x 67), 176982#(<= Main_x 72), 176983#(<= Main_x 73), 176980#(<= Main_x 70), 176981#(<= Main_x 71), 176986#(<= Main_x 76), 176987#(<= Main_x 77), 176984#(<= Main_x 74), 176985#(<= Main_x 75), 176990#(<= Main_x 80), 176991#(<= Main_x 81), 176988#(<= Main_x 78), 176989#(<= Main_x 79), 176994#(<= Main_x 84), 176995#(<= Main_x 85), 176992#(<= Main_x 82), 176993#(<= Main_x 83), 176998#(<= Main_x 88), 176999#(<= Main_x 89), 176996#(<= Main_x 86), 176997#(<= Main_x 87), 177002#(<= Main_x 92), 177003#(<= Main_x 93), 177000#(<= Main_x 90), 177001#(<= Main_x 91), 177006#(<= Main_x 96), 177007#(<= Main_x 97), 177004#(<= Main_x 94), 177005#(<= Main_x 95), 177010#(<= Main_x 100), 177011#(<= Main_x 101), 177008#(<= Main_x 98), 177009#(<= Main_x 99), 177014#(<= (+ Main_x 1) 0), 177012#(<= Main_x 102), 177013#(<= Main_x 103)] [2018-07-23 13:59:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5460 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:06,757 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 13:59:06,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 13:59:06,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:59:06,758 INFO L87 Difference]: Start difference. First operand 214 states and 216 transitions. Second operand 107 states. [2018-07-23 13:59:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:07,526 INFO L93 Difference]: Finished difference Result 321 states and 323 transitions. [2018-07-23 13:59:07,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 13:59:07,526 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-23 13:59:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:07,526 INFO L225 Difference]: With dead ends: 321 [2018-07-23 13:59:07,526 INFO L226 Difference]: Without dead ends: 213 [2018-07-23 13:59:07,527 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:59:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-23 13:59:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-23 13:59:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-23 13:59:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-07-23 13:59:07,722 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 212 [2018-07-23 13:59:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:07,722 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-07-23 13:59:07,722 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 13:59:07,722 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-07-23 13:59:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-23 13:59:07,723 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:07,723 INFO L357 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2018-07-23 13:59:07,723 INFO L414 AbstractCegarLoop]: === Iteration 312 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 317273287, now seen corresponding path program 309 times [2018-07-23 13:59:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5460 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:08,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:08,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 13:59:08,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:08,179 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:59:08,179 INFO L185 omatonBuilderFactory]: Interpolants [178178#(<= 93 Main_x), 178179#(<= 94 Main_x), 178176#(<= 91 Main_x), 178177#(<= 92 Main_x), 178182#(<= 97 Main_x), 178183#(<= 98 Main_x), 178180#(<= 95 Main_x), 178181#(<= 96 Main_x), 178186#(<= 101 Main_x), 178187#(<= 102 Main_x), 178184#(<= 99 Main_x), 178185#(<= 100 Main_x), 178188#(<= 103 Main_x), 178189#(<= 104 Main_x), 178083#true, 178086#(<= 1 Main_x), 178087#(<= 2 Main_x), 178084#false, 178085#(<= 0 Main_x), 178090#(<= 5 Main_x), 178091#(<= 6 Main_x), 178088#(<= 3 Main_x), 178089#(<= 4 Main_x), 178094#(<= 9 Main_x), 178095#(<= 10 Main_x), 178092#(<= 7 Main_x), 178093#(<= 8 Main_x), 178098#(<= 13 Main_x), 178099#(<= 14 Main_x), 178096#(<= 11 Main_x), 178097#(<= 12 Main_x), 178102#(<= 17 Main_x), 178103#(<= 18 Main_x), 178100#(<= 15 Main_x), 178101#(<= 16 Main_x), 178106#(<= 21 Main_x), 178107#(<= 22 Main_x), 178104#(<= 19 Main_x), 178105#(<= 20 Main_x), 178110#(<= 25 Main_x), 178111#(<= 26 Main_x), 178108#(<= 23 Main_x), 178109#(<= 24 Main_x), 178114#(<= 29 Main_x), 178115#(<= 30 Main_x), 178112#(<= 27 Main_x), 178113#(<= 28 Main_x), 178118#(<= 33 Main_x), 178119#(<= 34 Main_x), 178116#(<= 31 Main_x), 178117#(<= 32 Main_x), 178122#(<= 37 Main_x), 178123#(<= 38 Main_x), 178120#(<= 35 Main_x), 178121#(<= 36 Main_x), 178126#(<= 41 Main_x), 178127#(<= 42 Main_x), 178124#(<= 39 Main_x), 178125#(<= 40 Main_x), 178130#(<= 45 Main_x), 178131#(<= 46 Main_x), 178128#(<= 43 Main_x), 178129#(<= 44 Main_x), 178134#(<= 49 Main_x), 178135#(<= 50 Main_x), 178132#(<= 47 Main_x), 178133#(<= 48 Main_x), 178138#(<= 53 Main_x), 178139#(<= 54 Main_x), 178136#(<= 51 Main_x), 178137#(<= 52 Main_x), 178142#(<= 57 Main_x), 178143#(<= 58 Main_x), 178140#(<= 55 Main_x), 178141#(<= 56 Main_x), 178146#(<= 61 Main_x), 178147#(<= 62 Main_x), 178144#(<= 59 Main_x), 178145#(<= 60 Main_x), 178150#(<= 65 Main_x), 178151#(<= 66 Main_x), 178148#(<= 63 Main_x), 178149#(<= 64 Main_x), 178154#(<= 69 Main_x), 178155#(<= 70 Main_x), 178152#(<= 67 Main_x), 178153#(<= 68 Main_x), 178158#(<= 73 Main_x), 178159#(<= 74 Main_x), 178156#(<= 71 Main_x), 178157#(<= 72 Main_x), 178162#(<= 77 Main_x), 178163#(<= 78 Main_x), 178160#(<= 75 Main_x), 178161#(<= 76 Main_x), 178166#(<= 81 Main_x), 178167#(<= 82 Main_x), 178164#(<= 79 Main_x), 178165#(<= 80 Main_x), 178170#(<= 85 Main_x), 178171#(<= 86 Main_x), 178168#(<= 83 Main_x), 178169#(<= 84 Main_x), 178174#(<= 89 Main_x), 178175#(<= 90 Main_x), 178172#(<= 87 Main_x), 178173#(<= 88 Main_x)] [2018-07-23 13:59:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 5460 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:08,179 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 13:59:08,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 13:59:08,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:59:08,180 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2018-07-23 13:59:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:08,448 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-07-23 13:59:08,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 13:59:08,448 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-23 13:59:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:08,448 INFO L225 Difference]: With dead ends: 217 [2018-07-23 13:59:08,448 INFO L226 Difference]: Without dead ends: 214 [2018-07-23 13:59:08,449 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:59:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-23 13:59:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-07-23 13:59:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-07-23 13:59:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 215 transitions. [2018-07-23 13:59:08,646 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 215 transitions. Word has length 212 [2018-07-23 13:59:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:08,646 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 215 transitions. [2018-07-23 13:59:08,646 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 13:59:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 215 transitions. [2018-07-23 13:59:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-07-23 13:59:08,647 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:08,647 INFO L357 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1] [2018-07-23 13:59:08,647 INFO L414 AbstractCegarLoop]: === Iteration 313 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1245475783, now seen corresponding path program 310 times [2018-07-23 13:59:08,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:09,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:09,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:09,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 13:59:09,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:09,313 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:59:09,313 INFO L185 omatonBuilderFactory]: Interpolants [179054#(and (<= 0 Main_y) (<= Main_y 0)), 179055#(and (<= 1 Main_y) (<= Main_y 1)), 179052#true, 179053#false, 179058#(and (<= Main_y 4) (<= 4 Main_y)), 179059#(and (<= Main_y 5) (<= 5 Main_y)), 179056#(and (<= Main_y 2) (<= 2 Main_y)), 179057#(and (<= Main_y 3) (<= 3 Main_y)), 179062#(and (<= 8 Main_y) (<= Main_y 8)), 179063#(and (<= Main_y 9) (<= 9 Main_y)), 179060#(and (<= Main_y 6) (<= 6 Main_y)), 179061#(and (<= 7 Main_y) (<= Main_y 7)), 179066#(and (<= 12 Main_y) (<= Main_y 12)), 179067#(and (<= 13 Main_y) (<= Main_y 13)), 179064#(and (<= 10 Main_y) (<= Main_y 10)), 179065#(and (<= 11 Main_y) (<= Main_y 11)), 179070#(and (<= 16 Main_y) (<= Main_y 16)), 179071#(and (<= Main_y 17) (<= 17 Main_y)), 179068#(and (<= 14 Main_y) (<= Main_y 14)), 179069#(and (<= Main_y 15) (<= 15 Main_y)), 179074#(and (<= 20 Main_y) (<= Main_y 20)), 179075#(and (<= 21 Main_y) (<= Main_y 21)), 179072#(and (<= Main_y 18) (<= 18 Main_y)), 179073#(and (<= Main_y 19) (<= 19 Main_y)), 179078#(and (<= Main_y 24) (<= 24 Main_y)), 179079#(and (<= 25 Main_y) (<= Main_y 25)), 179076#(and (<= Main_y 22) (<= 22 Main_y)), 179077#(and (<= 23 Main_y) (<= Main_y 23)), 179082#(and (<= 28 Main_y) (<= Main_y 28)), 179083#(and (<= 29 Main_y) (<= Main_y 29)), 179080#(and (<= Main_y 26) (<= 26 Main_y)), 179081#(and (<= 27 Main_y) (<= Main_y 27)), 179086#(and (<= 32 Main_y) (<= Main_y 32)), 179087#(and (<= 33 Main_y) (<= Main_y 33)), 179084#(and (<= 30 Main_y) (<= Main_y 30)), 179085#(and (<= Main_y 31) (<= 31 Main_y)), 179090#(and (<= 36 Main_y) (<= Main_y 36)), 179091#(and (<= Main_y 37) (<= 37 Main_y)), 179088#(and (<= Main_y 34) (<= 34 Main_y)), 179089#(and (<= 35 Main_y) (<= Main_y 35)), 179094#(and (<= 40 Main_y) (<= Main_y 40)), 179095#(and (<= Main_y 41) (<= 41 Main_y)), 179092#(and (<= Main_y 38) (<= 38 Main_y)), 179093#(and (<= 39 Main_y) (<= Main_y 39)), 179098#(and (<= 44 Main_y) (<= Main_y 44)), 179099#(and (<= Main_y 45) (<= 45 Main_y)), 179096#(and (<= 42 Main_y) (<= Main_y 42)), 179097#(and (<= 43 Main_y) (<= Main_y 43)), 179102#(and (<= 48 Main_y) (<= Main_y 48)), 179103#(and (<= 49 Main_y) (<= Main_y 49)), 179100#(and (<= 46 Main_y) (<= Main_y 46)), 179101#(and (<= 47 Main_y) (<= Main_y 47)), 179106#(and (<= 52 Main_y) (<= Main_y 52)), 179107#(and (<= 53 Main_y) (<= Main_y 53)), 179104#(and (<= 50 Main_y) (<= Main_y 50)), 179105#(and (<= 51 Main_y) (<= Main_y 51)), 179110#(and (<= Main_y 56) (<= 56 Main_y)), 179111#(and (<= Main_y 57) (<= 57 Main_y)), 179108#(and (<= 54 Main_y) (<= Main_y 54)), 179109#(and (<= 55 Main_y) (<= Main_y 55)), 179114#(and (<= Main_y 60) (<= 60 Main_y)), 179115#(and (<= Main_y 61) (<= 61 Main_y)), 179112#(and (<= Main_y 58) (<= 58 Main_y)), 179113#(and (<= Main_y 59) (<= 59 Main_y)), 179118#(and (<= 64 Main_y) (<= Main_y 64)), 179119#(and (<= Main_y 65) (<= 65 Main_y)), 179116#(and (<= 62 Main_y) (<= Main_y 62)), 179117#(and (<= 63 Main_y) (<= Main_y 63)), 179122#(and (<= 68 Main_y) (<= Main_y 68)), 179123#(and (<= Main_y 69) (<= 69 Main_y)), 179120#(and (<= Main_y 66) (<= 66 Main_y)), 179121#(and (<= 67 Main_y) (<= Main_y 67)), 179126#(and (<= 72 Main_y) (<= Main_y 72)), 179127#(and (<= 73 Main_y) (<= Main_y 73)), 179124#(and (<= 70 Main_y) (<= Main_y 70)), 179125#(and (<= Main_y 71) (<= 71 Main_y)), 179130#(and (<= Main_y 76) (<= 76 Main_y)), 179131#(and (<= Main_y 77) (<= 77 Main_y)), 179128#(and (<= 74 Main_y) (<= Main_y 74)), 179129#(and (<= Main_y 75) (<= 75 Main_y)), 179134#(and (<= Main_y 80) (<= 80 Main_y)), 179135#(and (<= 81 Main_y) (<= Main_y 81)), 179132#(and (<= Main_y 78) (<= 78 Main_y)), 179133#(and (<= 79 Main_y) (<= Main_y 79)), 179138#(and (<= Main_y 84) (<= 84 Main_y)), 179139#(and (<= Main_y 85) (<= 85 Main_y)), 179136#(and (<= Main_y 82) (<= 82 Main_y)), 179137#(and (<= Main_y 83) (<= 83 Main_y)), 179142#(and (<= Main_y 88) (<= 88 Main_y)), 179143#(and (<= Main_y 89) (<= 89 Main_y)), 179140#(and (<= 86 Main_y) (<= Main_y 86)), 179141#(and (<= Main_y 87) (<= 87 Main_y)), 179146#(and (<= 92 Main_y) (<= Main_y 92)), 179147#(and (<= 93 Main_y) (<= Main_y 93)), 179144#(and (<= Main_y 90) (<= 90 Main_y)), 179145#(and (<= Main_y 91) (<= 91 Main_y)), 179150#(and (<= 96 Main_y) (<= Main_y 96)), 179151#(and (<= Main_y 97) (<= 97 Main_y)), 179148#(and (<= 94 Main_y) (<= Main_y 94)), 179149#(and (<= Main_y 95) (<= 95 Main_y)), 179154#(and (<= Main_y 100) (<= 100 Main_y)), 179155#(and (<= Main_y 101) (<= 101 Main_y)), 179152#(and (<= 98 Main_y) (<= Main_y 98)), 179153#(and (<= 99 Main_y) (<= Main_y 99)), 179158#(and (<= 104 Main_y) (<= Main_y 104)), 179156#(and (<= 102 Main_y) (<= Main_y 102)), 179157#(and (<= 103 Main_y) (<= Main_y 103))] [2018-07-23 13:59:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:09,313 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 13:59:09,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 13:59:09,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:59:09,314 INFO L87 Difference]: Start difference. First operand 214 states and 215 transitions. Second operand 107 states. [2018-07-23 13:59:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:10,939 INFO L93 Difference]: Finished difference Result 323 states and 325 transitions. [2018-07-23 13:59:10,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 13:59:10,939 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 213 [2018-07-23 13:59:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:10,939 INFO L225 Difference]: With dead ends: 323 [2018-07-23 13:59:10,939 INFO L226 Difference]: Without dead ends: 320 [2018-07-23 13:59:10,940 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:59:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-07-23 13:59:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2018-07-23 13:59:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-23 13:59:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-07-23 13:59:11,170 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 213 [2018-07-23 13:59:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:11,170 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-07-23 13:59:11,170 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 13:59:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-07-23 13:59:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-23 13:59:11,171 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:11,171 INFO L357 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2018-07-23 13:59:11,171 INFO L414 AbstractCegarLoop]: === Iteration 314 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash -45017913, now seen corresponding path program 311 times [2018-07-23 13:59:11,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:11,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:11,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 13:59:11,688 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:11,688 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:59:11,688 INFO L185 omatonBuilderFactory]: Interpolants [180238#false, 180239#(<= Main_x 0), 180237#true, 180242#(<= Main_x 3), 180243#(<= Main_x 4), 180240#(<= Main_x 1), 180241#(<= Main_x 2), 180246#(<= Main_x 7), 180247#(<= Main_x 8), 180244#(<= Main_x 5), 180245#(<= Main_x 6), 180250#(<= Main_x 11), 180251#(<= Main_x 12), 180248#(<= Main_x 9), 180249#(<= Main_x 10), 180254#(<= Main_x 15), 180255#(<= Main_x 16), 180252#(<= Main_x 13), 180253#(<= Main_x 14), 180258#(<= Main_x 19), 180259#(<= Main_x 20), 180256#(<= Main_x 17), 180257#(<= Main_x 18), 180262#(<= Main_x 23), 180263#(<= Main_x 24), 180260#(<= Main_x 21), 180261#(<= Main_x 22), 180266#(<= Main_x 27), 180267#(<= Main_x 28), 180264#(<= Main_x 25), 180265#(<= Main_x 26), 180270#(<= Main_x 31), 180271#(<= Main_x 32), 180268#(<= Main_x 29), 180269#(<= Main_x 30), 180274#(<= Main_x 35), 180275#(<= Main_x 36), 180272#(<= Main_x 33), 180273#(<= Main_x 34), 180278#(<= Main_x 39), 180279#(<= Main_x 40), 180276#(<= Main_x 37), 180277#(<= Main_x 38), 180282#(<= Main_x 43), 180283#(<= Main_x 44), 180280#(<= Main_x 41), 180281#(<= Main_x 42), 180286#(<= Main_x 47), 180287#(<= Main_x 48), 180284#(<= Main_x 45), 180285#(<= Main_x 46), 180290#(<= Main_x 51), 180291#(<= Main_x 52), 180288#(<= Main_x 49), 180289#(<= Main_x 50), 180294#(<= Main_x 55), 180295#(<= Main_x 56), 180292#(<= Main_x 53), 180293#(<= Main_x 54), 180298#(<= Main_x 59), 180299#(<= Main_x 60), 180296#(<= Main_x 57), 180297#(<= Main_x 58), 180302#(<= Main_x 63), 180303#(<= Main_x 64), 180300#(<= Main_x 61), 180301#(<= Main_x 62), 180306#(<= Main_x 67), 180307#(<= Main_x 68), 180304#(<= Main_x 65), 180305#(<= Main_x 66), 180310#(<= Main_x 71), 180311#(<= Main_x 72), 180308#(<= Main_x 69), 180309#(<= Main_x 70), 180314#(<= Main_x 75), 180315#(<= Main_x 76), 180312#(<= Main_x 73), 180313#(<= Main_x 74), 180318#(<= Main_x 79), 180319#(<= Main_x 80), 180316#(<= Main_x 77), 180317#(<= Main_x 78), 180322#(<= Main_x 83), 180323#(<= Main_x 84), 180320#(<= Main_x 81), 180321#(<= Main_x 82), 180326#(<= Main_x 87), 180327#(<= Main_x 88), 180324#(<= Main_x 85), 180325#(<= Main_x 86), 180330#(<= Main_x 91), 180331#(<= Main_x 92), 180328#(<= Main_x 89), 180329#(<= Main_x 90), 180334#(<= Main_x 95), 180335#(<= Main_x 96), 180332#(<= Main_x 93), 180333#(<= Main_x 94), 180338#(<= Main_x 99), 180339#(<= Main_x 100), 180336#(<= Main_x 97), 180337#(<= Main_x 98), 180342#(<= Main_x 103), 180343#(<= Main_x 104), 180340#(<= Main_x 101), 180341#(<= Main_x 102), 180344#(<= (+ Main_x 1) 0)] [2018-07-23 13:59:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:11,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 13:59:11,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 13:59:11,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:59:11,691 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 108 states. [2018-07-23 13:59:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:12,492 INFO L93 Difference]: Finished difference Result 324 states and 326 transitions. [2018-07-23 13:59:12,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 13:59:12,492 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-23 13:59:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:12,492 INFO L225 Difference]: With dead ends: 324 [2018-07-23 13:59:12,493 INFO L226 Difference]: Without dead ends: 215 [2018-07-23 13:59:12,493 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:59:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-23 13:59:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-23 13:59:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-23 13:59:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-07-23 13:59:12,717 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 214 [2018-07-23 13:59:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:12,717 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-07-23 13:59:12,717 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 13:59:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-07-23 13:59:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-23 13:59:12,718 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:12,718 INFO L357 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2018-07-23 13:59:12,718 INFO L414 AbstractCegarLoop]: === Iteration 315 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:12,718 INFO L82 PathProgramCache]: Analyzing trace with hash 73635949, now seen corresponding path program 312 times [2018-07-23 13:59:12,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:13,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:13,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 13:59:13,245 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:13,245 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:59:13,246 INFO L185 omatonBuilderFactory]: Interpolants [181506#(<= 81 Main_x), 181507#(<= 82 Main_x), 181504#(<= 79 Main_x), 181505#(<= 80 Main_x), 181510#(<= 85 Main_x), 181511#(<= 86 Main_x), 181508#(<= 83 Main_x), 181509#(<= 84 Main_x), 181514#(<= 89 Main_x), 181515#(<= 90 Main_x), 181512#(<= 87 Main_x), 181513#(<= 88 Main_x), 181518#(<= 93 Main_x), 181519#(<= 94 Main_x), 181516#(<= 91 Main_x), 181517#(<= 92 Main_x), 181522#(<= 97 Main_x), 181523#(<= 98 Main_x), 181520#(<= 95 Main_x), 181521#(<= 96 Main_x), 181526#(<= 101 Main_x), 181527#(<= 102 Main_x), 181524#(<= 99 Main_x), 181525#(<= 100 Main_x), 181530#(<= 105 Main_x), 181528#(<= 103 Main_x), 181529#(<= 104 Main_x), 181423#true, 181426#(<= 1 Main_x), 181427#(<= 2 Main_x), 181424#false, 181425#(<= 0 Main_x), 181430#(<= 5 Main_x), 181431#(<= 6 Main_x), 181428#(<= 3 Main_x), 181429#(<= 4 Main_x), 181434#(<= 9 Main_x), 181435#(<= 10 Main_x), 181432#(<= 7 Main_x), 181433#(<= 8 Main_x), 181438#(<= 13 Main_x), 181439#(<= 14 Main_x), 181436#(<= 11 Main_x), 181437#(<= 12 Main_x), 181442#(<= 17 Main_x), 181443#(<= 18 Main_x), 181440#(<= 15 Main_x), 181441#(<= 16 Main_x), 181446#(<= 21 Main_x), 181447#(<= 22 Main_x), 181444#(<= 19 Main_x), 181445#(<= 20 Main_x), 181450#(<= 25 Main_x), 181451#(<= 26 Main_x), 181448#(<= 23 Main_x), 181449#(<= 24 Main_x), 181454#(<= 29 Main_x), 181455#(<= 30 Main_x), 181452#(<= 27 Main_x), 181453#(<= 28 Main_x), 181458#(<= 33 Main_x), 181459#(<= 34 Main_x), 181456#(<= 31 Main_x), 181457#(<= 32 Main_x), 181462#(<= 37 Main_x), 181463#(<= 38 Main_x), 181460#(<= 35 Main_x), 181461#(<= 36 Main_x), 181466#(<= 41 Main_x), 181467#(<= 42 Main_x), 181464#(<= 39 Main_x), 181465#(<= 40 Main_x), 181470#(<= 45 Main_x), 181471#(<= 46 Main_x), 181468#(<= 43 Main_x), 181469#(<= 44 Main_x), 181474#(<= 49 Main_x), 181475#(<= 50 Main_x), 181472#(<= 47 Main_x), 181473#(<= 48 Main_x), 181478#(<= 53 Main_x), 181479#(<= 54 Main_x), 181476#(<= 51 Main_x), 181477#(<= 52 Main_x), 181482#(<= 57 Main_x), 181483#(<= 58 Main_x), 181480#(<= 55 Main_x), 181481#(<= 56 Main_x), 181486#(<= 61 Main_x), 181487#(<= 62 Main_x), 181484#(<= 59 Main_x), 181485#(<= 60 Main_x), 181490#(<= 65 Main_x), 181491#(<= 66 Main_x), 181488#(<= 63 Main_x), 181489#(<= 64 Main_x), 181494#(<= 69 Main_x), 181495#(<= 70 Main_x), 181492#(<= 67 Main_x), 181493#(<= 68 Main_x), 181498#(<= 73 Main_x), 181499#(<= 74 Main_x), 181496#(<= 71 Main_x), 181497#(<= 72 Main_x), 181502#(<= 77 Main_x), 181503#(<= 78 Main_x), 181500#(<= 75 Main_x), 181501#(<= 76 Main_x)] [2018-07-23 13:59:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 5565 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:13,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 13:59:13,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 13:59:13,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:59:13,247 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 108 states. [2018-07-23 13:59:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:13,571 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-07-23 13:59:13,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 13:59:13,571 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-23 13:59:13,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:13,571 INFO L225 Difference]: With dead ends: 219 [2018-07-23 13:59:13,571 INFO L226 Difference]: Without dead ends: 216 [2018-07-23 13:59:13,572 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:59:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-07-23 13:59:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-07-23 13:59:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-23 13:59:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-07-23 13:59:13,820 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 214 [2018-07-23 13:59:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:13,820 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-07-23 13:59:13,820 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 13:59:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-07-23 13:59:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-23 13:59:13,821 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:13,821 INFO L357 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1] [2018-07-23 13:59:13,821 INFO L414 AbstractCegarLoop]: === Iteration 316 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2012314399, now seen corresponding path program 313 times [2018-07-23 13:59:13,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:14,594 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:14,594 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 13:59:14,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:14,595 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:59:14,595 INFO L185 omatonBuilderFactory]: Interpolants [182402#false, 182403#(and (<= 0 Main_y) (<= Main_y 0)), 182401#true, 182406#(and (<= Main_y 3) (<= 3 Main_y)), 182407#(and (<= Main_y 4) (<= 4 Main_y)), 182404#(and (<= 1 Main_y) (<= Main_y 1)), 182405#(and (<= Main_y 2) (<= 2 Main_y)), 182410#(and (<= 7 Main_y) (<= Main_y 7)), 182411#(and (<= 8 Main_y) (<= Main_y 8)), 182408#(and (<= Main_y 5) (<= 5 Main_y)), 182409#(and (<= Main_y 6) (<= 6 Main_y)), 182414#(and (<= 11 Main_y) (<= Main_y 11)), 182415#(and (<= 12 Main_y) (<= Main_y 12)), 182412#(and (<= Main_y 9) (<= 9 Main_y)), 182413#(and (<= 10 Main_y) (<= Main_y 10)), 182418#(and (<= Main_y 15) (<= 15 Main_y)), 182419#(and (<= 16 Main_y) (<= Main_y 16)), 182416#(and (<= 13 Main_y) (<= Main_y 13)), 182417#(and (<= 14 Main_y) (<= Main_y 14)), 182422#(and (<= Main_y 19) (<= 19 Main_y)), 182423#(and (<= 20 Main_y) (<= Main_y 20)), 182420#(and (<= Main_y 17) (<= 17 Main_y)), 182421#(and (<= Main_y 18) (<= 18 Main_y)), 182426#(and (<= 23 Main_y) (<= Main_y 23)), 182427#(and (<= Main_y 24) (<= 24 Main_y)), 182424#(and (<= 21 Main_y) (<= Main_y 21)), 182425#(and (<= Main_y 22) (<= 22 Main_y)), 182430#(and (<= 27 Main_y) (<= Main_y 27)), 182431#(and (<= 28 Main_y) (<= Main_y 28)), 182428#(and (<= 25 Main_y) (<= Main_y 25)), 182429#(and (<= Main_y 26) (<= 26 Main_y)), 182434#(and (<= Main_y 31) (<= 31 Main_y)), 182435#(and (<= 32 Main_y) (<= Main_y 32)), 182432#(and (<= 29 Main_y) (<= Main_y 29)), 182433#(and (<= 30 Main_y) (<= Main_y 30)), 182438#(and (<= 35 Main_y) (<= Main_y 35)), 182439#(and (<= 36 Main_y) (<= Main_y 36)), 182436#(and (<= 33 Main_y) (<= Main_y 33)), 182437#(and (<= Main_y 34) (<= 34 Main_y)), 182442#(and (<= 39 Main_y) (<= Main_y 39)), 182443#(and (<= 40 Main_y) (<= Main_y 40)), 182440#(and (<= Main_y 37) (<= 37 Main_y)), 182441#(and (<= Main_y 38) (<= 38 Main_y)), 182446#(and (<= 43 Main_y) (<= Main_y 43)), 182447#(and (<= 44 Main_y) (<= Main_y 44)), 182444#(and (<= Main_y 41) (<= 41 Main_y)), 182445#(and (<= 42 Main_y) (<= Main_y 42)), 182450#(and (<= 47 Main_y) (<= Main_y 47)), 182451#(and (<= 48 Main_y) (<= Main_y 48)), 182448#(and (<= Main_y 45) (<= 45 Main_y)), 182449#(and (<= 46 Main_y) (<= Main_y 46)), 182454#(and (<= 51 Main_y) (<= Main_y 51)), 182455#(and (<= 52 Main_y) (<= Main_y 52)), 182452#(and (<= 49 Main_y) (<= Main_y 49)), 182453#(and (<= 50 Main_y) (<= Main_y 50)), 182458#(and (<= 55 Main_y) (<= Main_y 55)), 182459#(and (<= Main_y 56) (<= 56 Main_y)), 182456#(and (<= 53 Main_y) (<= Main_y 53)), 182457#(and (<= 54 Main_y) (<= Main_y 54)), 182462#(and (<= Main_y 59) (<= 59 Main_y)), 182463#(and (<= Main_y 60) (<= 60 Main_y)), 182460#(and (<= Main_y 57) (<= 57 Main_y)), 182461#(and (<= Main_y 58) (<= 58 Main_y)), 182466#(and (<= 63 Main_y) (<= Main_y 63)), 182467#(and (<= 64 Main_y) (<= Main_y 64)), 182464#(and (<= Main_y 61) (<= 61 Main_y)), 182465#(and (<= 62 Main_y) (<= Main_y 62)), 182470#(and (<= 67 Main_y) (<= Main_y 67)), 182471#(and (<= 68 Main_y) (<= Main_y 68)), 182468#(and (<= Main_y 65) (<= 65 Main_y)), 182469#(and (<= Main_y 66) (<= 66 Main_y)), 182474#(and (<= Main_y 71) (<= 71 Main_y)), 182475#(and (<= 72 Main_y) (<= Main_y 72)), 182472#(and (<= Main_y 69) (<= 69 Main_y)), 182473#(and (<= 70 Main_y) (<= Main_y 70)), 182478#(and (<= Main_y 75) (<= 75 Main_y)), 182479#(and (<= Main_y 76) (<= 76 Main_y)), 182476#(and (<= 73 Main_y) (<= Main_y 73)), 182477#(and (<= 74 Main_y) (<= Main_y 74)), 182482#(and (<= 79 Main_y) (<= Main_y 79)), 182483#(and (<= Main_y 80) (<= 80 Main_y)), 182480#(and (<= Main_y 77) (<= 77 Main_y)), 182481#(and (<= Main_y 78) (<= 78 Main_y)), 182486#(and (<= Main_y 83) (<= 83 Main_y)), 182487#(and (<= Main_y 84) (<= 84 Main_y)), 182484#(and (<= 81 Main_y) (<= Main_y 81)), 182485#(and (<= Main_y 82) (<= 82 Main_y)), 182490#(and (<= Main_y 87) (<= 87 Main_y)), 182491#(and (<= Main_y 88) (<= 88 Main_y)), 182488#(and (<= Main_y 85) (<= 85 Main_y)), 182489#(and (<= 86 Main_y) (<= Main_y 86)), 182494#(and (<= Main_y 91) (<= 91 Main_y)), 182495#(and (<= 92 Main_y) (<= Main_y 92)), 182492#(and (<= Main_y 89) (<= 89 Main_y)), 182493#(and (<= Main_y 90) (<= 90 Main_y)), 182498#(and (<= Main_y 95) (<= 95 Main_y)), 182499#(and (<= 96 Main_y) (<= Main_y 96)), 182496#(and (<= 93 Main_y) (<= Main_y 93)), 182497#(and (<= 94 Main_y) (<= Main_y 94)), 182502#(and (<= 99 Main_y) (<= Main_y 99)), 182503#(and (<= Main_y 100) (<= 100 Main_y)), 182500#(and (<= Main_y 97) (<= 97 Main_y)), 182501#(and (<= 98 Main_y) (<= Main_y 98)), 182506#(and (<= 103 Main_y) (<= Main_y 103)), 182507#(and (<= 104 Main_y) (<= Main_y 104)), 182504#(and (<= Main_y 101) (<= 101 Main_y)), 182505#(and (<= 102 Main_y) (<= Main_y 102)), 182508#(and (<= 105 Main_y) (<= Main_y 105))] [2018-07-23 13:59:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:14,596 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 13:59:14,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 13:59:14,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:59:14,596 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 108 states. [2018-07-23 13:59:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:16,235 INFO L93 Difference]: Finished difference Result 326 states and 328 transitions. [2018-07-23 13:59:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 13:59:16,236 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 215 [2018-07-23 13:59:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:16,236 INFO L225 Difference]: With dead ends: 326 [2018-07-23 13:59:16,236 INFO L226 Difference]: Without dead ends: 323 [2018-07-23 13:59:16,237 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:59:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-07-23 13:59:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 218. [2018-07-23 13:59:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-23 13:59:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 220 transitions. [2018-07-23 13:59:16,472 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 220 transitions. Word has length 215 [2018-07-23 13:59:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:16,472 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 220 transitions. [2018-07-23 13:59:16,472 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 13:59:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 220 transitions. [2018-07-23 13:59:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-23 13:59:16,472 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:16,473 INFO L357 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2018-07-23 13:59:16,473 INFO L414 AbstractCegarLoop]: === Iteration 317 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2042701549, now seen corresponding path program 314 times [2018-07-23 13:59:16,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 5671 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:17,007 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:17,008 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 13:59:17,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:17,008 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:59:17,008 INFO L185 omatonBuilderFactory]: Interpolants [183598#false, 183599#(<= Main_x 0), 183597#true, 183602#(<= Main_x 3), 183603#(<= Main_x 4), 183600#(<= Main_x 1), 183601#(<= Main_x 2), 183606#(<= Main_x 7), 183607#(<= Main_x 8), 183604#(<= Main_x 5), 183605#(<= Main_x 6), 183610#(<= Main_x 11), 183611#(<= Main_x 12), 183608#(<= Main_x 9), 183609#(<= Main_x 10), 183614#(<= Main_x 15), 183615#(<= Main_x 16), 183612#(<= Main_x 13), 183613#(<= Main_x 14), 183618#(<= Main_x 19), 183619#(<= Main_x 20), 183616#(<= Main_x 17), 183617#(<= Main_x 18), 183622#(<= Main_x 23), 183623#(<= Main_x 24), 183620#(<= Main_x 21), 183621#(<= Main_x 22), 183626#(<= Main_x 27), 183627#(<= Main_x 28), 183624#(<= Main_x 25), 183625#(<= Main_x 26), 183630#(<= Main_x 31), 183631#(<= Main_x 32), 183628#(<= Main_x 29), 183629#(<= Main_x 30), 183634#(<= Main_x 35), 183635#(<= Main_x 36), 183632#(<= Main_x 33), 183633#(<= Main_x 34), 183638#(<= Main_x 39), 183639#(<= Main_x 40), 183636#(<= Main_x 37), 183637#(<= Main_x 38), 183642#(<= Main_x 43), 183643#(<= Main_x 44), 183640#(<= Main_x 41), 183641#(<= Main_x 42), 183646#(<= Main_x 47), 183647#(<= Main_x 48), 183644#(<= Main_x 45), 183645#(<= Main_x 46), 183650#(<= Main_x 51), 183651#(<= Main_x 52), 183648#(<= Main_x 49), 183649#(<= Main_x 50), 183654#(<= Main_x 55), 183655#(<= Main_x 56), 183652#(<= Main_x 53), 183653#(<= Main_x 54), 183658#(<= Main_x 59), 183659#(<= Main_x 60), 183656#(<= Main_x 57), 183657#(<= Main_x 58), 183662#(<= Main_x 63), 183663#(<= Main_x 64), 183660#(<= Main_x 61), 183661#(<= Main_x 62), 183666#(<= Main_x 67), 183667#(<= Main_x 68), 183664#(<= Main_x 65), 183665#(<= Main_x 66), 183670#(<= Main_x 71), 183671#(<= Main_x 72), 183668#(<= Main_x 69), 183669#(<= Main_x 70), 183674#(<= Main_x 75), 183675#(<= Main_x 76), 183672#(<= Main_x 73), 183673#(<= Main_x 74), 183678#(<= Main_x 79), 183679#(<= Main_x 80), 183676#(<= Main_x 77), 183677#(<= Main_x 78), 183682#(<= Main_x 83), 183683#(<= Main_x 84), 183680#(<= Main_x 81), 183681#(<= Main_x 82), 183686#(<= Main_x 87), 183687#(<= Main_x 88), 183684#(<= Main_x 85), 183685#(<= Main_x 86), 183690#(<= Main_x 91), 183691#(<= Main_x 92), 183688#(<= Main_x 89), 183689#(<= Main_x 90), 183694#(<= Main_x 95), 183695#(<= Main_x 96), 183692#(<= Main_x 93), 183693#(<= Main_x 94), 183698#(<= Main_x 99), 183699#(<= Main_x 100), 183696#(<= Main_x 97), 183697#(<= Main_x 98), 183702#(<= Main_x 103), 183703#(<= Main_x 104), 183700#(<= Main_x 101), 183701#(<= Main_x 102), 183704#(<= Main_x 105), 183705#(<= (+ Main_x 1) 0)] [2018-07-23 13:59:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 5671 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:17,009 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 13:59:17,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 13:59:17,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:59:17,010 INFO L87 Difference]: Start difference. First operand 218 states and 220 transitions. Second operand 109 states. [2018-07-23 13:59:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:17,717 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-07-23 13:59:17,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 13:59:17,717 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-23 13:59:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:17,718 INFO L225 Difference]: With dead ends: 327 [2018-07-23 13:59:17,718 INFO L226 Difference]: Without dead ends: 217 [2018-07-23 13:59:17,718 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:59:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-23 13:59:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-23 13:59:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-23 13:59:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-07-23 13:59:17,946 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 216 [2018-07-23 13:59:17,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:17,947 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-07-23 13:59:17,947 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 13:59:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-07-23 13:59:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-23 13:59:17,947 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:17,947 INFO L357 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2018-07-23 13:59:17,947 INFO L414 AbstractCegarLoop]: === Iteration 318 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1426003975, now seen corresponding path program 315 times [2018-07-23 13:59:17,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 5671 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:18,502 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:18,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 13:59:18,502 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:18,502 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:59:18,502 INFO L185 omatonBuilderFactory]: Interpolants [184834#(<= 38 Main_x), 184835#(<= 39 Main_x), 184832#(<= 36 Main_x), 184833#(<= 37 Main_x), 184838#(<= 42 Main_x), 184839#(<= 43 Main_x), 184836#(<= 40 Main_x), 184837#(<= 41 Main_x), 184842#(<= 46 Main_x), 184843#(<= 47 Main_x), 184840#(<= 44 Main_x), 184841#(<= 45 Main_x), 184846#(<= 50 Main_x), 184847#(<= 51 Main_x), 184844#(<= 48 Main_x), 184845#(<= 49 Main_x), 184850#(<= 54 Main_x), 184851#(<= 55 Main_x), 184848#(<= 52 Main_x), 184849#(<= 53 Main_x), 184854#(<= 58 Main_x), 184855#(<= 59 Main_x), 184852#(<= 56 Main_x), 184853#(<= 57 Main_x), 184858#(<= 62 Main_x), 184859#(<= 63 Main_x), 184856#(<= 60 Main_x), 184857#(<= 61 Main_x), 184862#(<= 66 Main_x), 184863#(<= 67 Main_x), 184860#(<= 64 Main_x), 184861#(<= 65 Main_x), 184866#(<= 70 Main_x), 184867#(<= 71 Main_x), 184864#(<= 68 Main_x), 184865#(<= 69 Main_x), 184870#(<= 74 Main_x), 184871#(<= 75 Main_x), 184868#(<= 72 Main_x), 184869#(<= 73 Main_x), 184874#(<= 78 Main_x), 184875#(<= 79 Main_x), 184872#(<= 76 Main_x), 184873#(<= 77 Main_x), 184878#(<= 82 Main_x), 184879#(<= 83 Main_x), 184876#(<= 80 Main_x), 184877#(<= 81 Main_x), 184882#(<= 86 Main_x), 184883#(<= 87 Main_x), 184880#(<= 84 Main_x), 184881#(<= 85 Main_x), 184886#(<= 90 Main_x), 184887#(<= 91 Main_x), 184884#(<= 88 Main_x), 184885#(<= 89 Main_x), 184890#(<= 94 Main_x), 184891#(<= 95 Main_x), 184888#(<= 92 Main_x), 184889#(<= 93 Main_x), 184894#(<= 98 Main_x), 184895#(<= 99 Main_x), 184892#(<= 96 Main_x), 184893#(<= 97 Main_x), 184898#(<= 102 Main_x), 184899#(<= 103 Main_x), 184896#(<= 100 Main_x), 184897#(<= 101 Main_x), 184902#(<= 106 Main_x), 184900#(<= 104 Main_x), 184901#(<= 105 Main_x), 184794#true, 184795#false, 184798#(<= 2 Main_x), 184799#(<= 3 Main_x), 184796#(<= 0 Main_x), 184797#(<= 1 Main_x), 184802#(<= 6 Main_x), 184803#(<= 7 Main_x), 184800#(<= 4 Main_x), 184801#(<= 5 Main_x), 184806#(<= 10 Main_x), 184807#(<= 11 Main_x), 184804#(<= 8 Main_x), 184805#(<= 9 Main_x), 184810#(<= 14 Main_x), 184811#(<= 15 Main_x), 184808#(<= 12 Main_x), 184809#(<= 13 Main_x), 184814#(<= 18 Main_x), 184815#(<= 19 Main_x), 184812#(<= 16 Main_x), 184813#(<= 17 Main_x), 184818#(<= 22 Main_x), 184819#(<= 23 Main_x), 184816#(<= 20 Main_x), 184817#(<= 21 Main_x), 184822#(<= 26 Main_x), 184823#(<= 27 Main_x), 184820#(<= 24 Main_x), 184821#(<= 25 Main_x), 184826#(<= 30 Main_x), 184827#(<= 31 Main_x), 184824#(<= 28 Main_x), 184825#(<= 29 Main_x), 184830#(<= 34 Main_x), 184831#(<= 35 Main_x), 184828#(<= 32 Main_x), 184829#(<= 33 Main_x)] [2018-07-23 13:59:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 5671 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:18,503 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 13:59:18,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 13:59:18,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:59:18,504 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 109 states. [2018-07-23 13:59:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:18,820 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-07-23 13:59:18,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 13:59:18,820 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-23 13:59:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:18,821 INFO L225 Difference]: With dead ends: 221 [2018-07-23 13:59:18,821 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 13:59:18,822 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:59:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 13:59:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-07-23 13:59:19,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-07-23 13:59:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 219 transitions. [2018-07-23 13:59:19,043 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 219 transitions. Word has length 216 [2018-07-23 13:59:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 219 transitions. [2018-07-23 13:59:19,043 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 13:59:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 219 transitions. [2018-07-23 13:59:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-07-23 13:59:19,044 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:19,044 INFO L357 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1] [2018-07-23 13:59:19,044 INFO L414 AbstractCegarLoop]: === Iteration 319 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:19,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1256388743, now seen corresponding path program 316 times [2018-07-23 13:59:19,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:19,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:19,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 13:59:19,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:19,740 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:59:19,741 INFO L185 omatonBuilderFactory]: Interpolants [185858#(and (<= Main_y 75) (<= 75 Main_y)), 185859#(and (<= Main_y 76) (<= 76 Main_y)), 185856#(and (<= 73 Main_y) (<= Main_y 73)), 185857#(and (<= 74 Main_y) (<= Main_y 74)), 185862#(and (<= 79 Main_y) (<= Main_y 79)), 185863#(and (<= Main_y 80) (<= 80 Main_y)), 185860#(and (<= Main_y 77) (<= 77 Main_y)), 185861#(and (<= Main_y 78) (<= 78 Main_y)), 185866#(and (<= Main_y 83) (<= 83 Main_y)), 185867#(and (<= Main_y 84) (<= 84 Main_y)), 185864#(and (<= 81 Main_y) (<= Main_y 81)), 185865#(and (<= Main_y 82) (<= 82 Main_y)), 185870#(and (<= Main_y 87) (<= 87 Main_y)), 185871#(and (<= Main_y 88) (<= 88 Main_y)), 185868#(and (<= Main_y 85) (<= 85 Main_y)), 185869#(and (<= 86 Main_y) (<= Main_y 86)), 185874#(and (<= Main_y 91) (<= 91 Main_y)), 185875#(and (<= 92 Main_y) (<= Main_y 92)), 185872#(and (<= Main_y 89) (<= 89 Main_y)), 185873#(and (<= Main_y 90) (<= 90 Main_y)), 185878#(and (<= Main_y 95) (<= 95 Main_y)), 185879#(and (<= 96 Main_y) (<= Main_y 96)), 185876#(and (<= 93 Main_y) (<= Main_y 93)), 185877#(and (<= 94 Main_y) (<= Main_y 94)), 185882#(and (<= 99 Main_y) (<= Main_y 99)), 185883#(and (<= Main_y 100) (<= 100 Main_y)), 185880#(and (<= Main_y 97) (<= 97 Main_y)), 185881#(and (<= 98 Main_y) (<= Main_y 98)), 185886#(and (<= 103 Main_y) (<= Main_y 103)), 185887#(and (<= 104 Main_y) (<= Main_y 104)), 185884#(and (<= Main_y 101) (<= 101 Main_y)), 185885#(and (<= 102 Main_y) (<= Main_y 102)), 185888#(and (<= 105 Main_y) (<= Main_y 105)), 185889#(and (<= Main_y 106) (<= 106 Main_y)), 185782#false, 185783#(and (<= 0 Main_y) (<= Main_y 0)), 185781#true, 185786#(and (<= Main_y 3) (<= 3 Main_y)), 185787#(and (<= Main_y 4) (<= 4 Main_y)), 185784#(and (<= 1 Main_y) (<= Main_y 1)), 185785#(and (<= Main_y 2) (<= 2 Main_y)), 185790#(and (<= 7 Main_y) (<= Main_y 7)), 185791#(and (<= 8 Main_y) (<= Main_y 8)), 185788#(and (<= Main_y 5) (<= 5 Main_y)), 185789#(and (<= Main_y 6) (<= 6 Main_y)), 185794#(and (<= 11 Main_y) (<= Main_y 11)), 185795#(and (<= 12 Main_y) (<= Main_y 12)), 185792#(and (<= Main_y 9) (<= 9 Main_y)), 185793#(and (<= 10 Main_y) (<= Main_y 10)), 185798#(and (<= Main_y 15) (<= 15 Main_y)), 185799#(and (<= 16 Main_y) (<= Main_y 16)), 185796#(and (<= 13 Main_y) (<= Main_y 13)), 185797#(and (<= 14 Main_y) (<= Main_y 14)), 185802#(and (<= Main_y 19) (<= 19 Main_y)), 185803#(and (<= 20 Main_y) (<= Main_y 20)), 185800#(and (<= Main_y 17) (<= 17 Main_y)), 185801#(and (<= Main_y 18) (<= 18 Main_y)), 185806#(and (<= 23 Main_y) (<= Main_y 23)), 185807#(and (<= Main_y 24) (<= 24 Main_y)), 185804#(and (<= 21 Main_y) (<= Main_y 21)), 185805#(and (<= Main_y 22) (<= 22 Main_y)), 185810#(and (<= 27 Main_y) (<= Main_y 27)), 185811#(and (<= 28 Main_y) (<= Main_y 28)), 185808#(and (<= 25 Main_y) (<= Main_y 25)), 185809#(and (<= Main_y 26) (<= 26 Main_y)), 185814#(and (<= Main_y 31) (<= 31 Main_y)), 185815#(and (<= 32 Main_y) (<= Main_y 32)), 185812#(and (<= 29 Main_y) (<= Main_y 29)), 185813#(and (<= 30 Main_y) (<= Main_y 30)), 185818#(and (<= 35 Main_y) (<= Main_y 35)), 185819#(and (<= 36 Main_y) (<= Main_y 36)), 185816#(and (<= 33 Main_y) (<= Main_y 33)), 185817#(and (<= Main_y 34) (<= 34 Main_y)), 185822#(and (<= 39 Main_y) (<= Main_y 39)), 185823#(and (<= 40 Main_y) (<= Main_y 40)), 185820#(and (<= Main_y 37) (<= 37 Main_y)), 185821#(and (<= Main_y 38) (<= 38 Main_y)), 185826#(and (<= 43 Main_y) (<= Main_y 43)), 185827#(and (<= 44 Main_y) (<= Main_y 44)), 185824#(and (<= Main_y 41) (<= 41 Main_y)), 185825#(and (<= 42 Main_y) (<= Main_y 42)), 185830#(and (<= 47 Main_y) (<= Main_y 47)), 185831#(and (<= 48 Main_y) (<= Main_y 48)), 185828#(and (<= Main_y 45) (<= 45 Main_y)), 185829#(and (<= 46 Main_y) (<= Main_y 46)), 185834#(and (<= 51 Main_y) (<= Main_y 51)), 185835#(and (<= 52 Main_y) (<= Main_y 52)), 185832#(and (<= 49 Main_y) (<= Main_y 49)), 185833#(and (<= 50 Main_y) (<= Main_y 50)), 185838#(and (<= 55 Main_y) (<= Main_y 55)), 185839#(and (<= Main_y 56) (<= 56 Main_y)), 185836#(and (<= 53 Main_y) (<= Main_y 53)), 185837#(and (<= 54 Main_y) (<= Main_y 54)), 185842#(and (<= Main_y 59) (<= 59 Main_y)), 185843#(and (<= Main_y 60) (<= 60 Main_y)), 185840#(and (<= Main_y 57) (<= 57 Main_y)), 185841#(and (<= Main_y 58) (<= 58 Main_y)), 185846#(and (<= 63 Main_y) (<= Main_y 63)), 185847#(and (<= 64 Main_y) (<= Main_y 64)), 185844#(and (<= Main_y 61) (<= 61 Main_y)), 185845#(and (<= 62 Main_y) (<= Main_y 62)), 185850#(and (<= 67 Main_y) (<= Main_y 67)), 185851#(and (<= 68 Main_y) (<= Main_y 68)), 185848#(and (<= Main_y 65) (<= 65 Main_y)), 185849#(and (<= Main_y 66) (<= 66 Main_y)), 185854#(and (<= Main_y 71) (<= 71 Main_y)), 185855#(and (<= 72 Main_y) (<= Main_y 72)), 185852#(and (<= Main_y 69) (<= 69 Main_y)), 185853#(and (<= 70 Main_y) (<= Main_y 70))] [2018-07-23 13:59:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:19,741 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 13:59:19,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 13:59:19,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:59:19,742 INFO L87 Difference]: Start difference. First operand 218 states and 219 transitions. Second operand 109 states. [2018-07-23 13:59:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:21,427 INFO L93 Difference]: Finished difference Result 329 states and 331 transitions. [2018-07-23 13:59:21,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 13:59:21,427 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 217 [2018-07-23 13:59:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:21,428 INFO L225 Difference]: With dead ends: 329 [2018-07-23 13:59:21,428 INFO L226 Difference]: Without dead ends: 326 [2018-07-23 13:59:21,428 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:59:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-07-23 13:59:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 220. [2018-07-23 13:59:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-23 13:59:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-07-23 13:59:21,656 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 217 [2018-07-23 13:59:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:21,656 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-07-23 13:59:21,656 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 13:59:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-07-23 13:59:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-23 13:59:21,657 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:21,657 INFO L357 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2018-07-23 13:59:21,657 INFO L414 AbstractCegarLoop]: === Iteration 320 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash 293283847, now seen corresponding path program 317 times [2018-07-23 13:59:21,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:22,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:22,153 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 13:59:22,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:22,153 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:59:22,153 INFO L185 omatonBuilderFactory]: Interpolants [186990#(<= Main_x 0), 186991#(<= Main_x 1), 186988#true, 186989#false, 186994#(<= Main_x 4), 186995#(<= Main_x 5), 186992#(<= Main_x 2), 186993#(<= Main_x 3), 186998#(<= Main_x 8), 186999#(<= Main_x 9), 186996#(<= Main_x 6), 186997#(<= Main_x 7), 187002#(<= Main_x 12), 187003#(<= Main_x 13), 187000#(<= Main_x 10), 187001#(<= Main_x 11), 187006#(<= Main_x 16), 187007#(<= Main_x 17), 187004#(<= Main_x 14), 187005#(<= Main_x 15), 187010#(<= Main_x 20), 187011#(<= Main_x 21), 187008#(<= Main_x 18), 187009#(<= Main_x 19), 187014#(<= Main_x 24), 187015#(<= Main_x 25), 187012#(<= Main_x 22), 187013#(<= Main_x 23), 187018#(<= Main_x 28), 187019#(<= Main_x 29), 187016#(<= Main_x 26), 187017#(<= Main_x 27), 187022#(<= Main_x 32), 187023#(<= Main_x 33), 187020#(<= Main_x 30), 187021#(<= Main_x 31), 187026#(<= Main_x 36), 187027#(<= Main_x 37), 187024#(<= Main_x 34), 187025#(<= Main_x 35), 187030#(<= Main_x 40), 187031#(<= Main_x 41), 187028#(<= Main_x 38), 187029#(<= Main_x 39), 187034#(<= Main_x 44), 187035#(<= Main_x 45), 187032#(<= Main_x 42), 187033#(<= Main_x 43), 187038#(<= Main_x 48), 187039#(<= Main_x 49), 187036#(<= Main_x 46), 187037#(<= Main_x 47), 187042#(<= Main_x 52), 187043#(<= Main_x 53), 187040#(<= Main_x 50), 187041#(<= Main_x 51), 187046#(<= Main_x 56), 187047#(<= Main_x 57), 187044#(<= Main_x 54), 187045#(<= Main_x 55), 187050#(<= Main_x 60), 187051#(<= Main_x 61), 187048#(<= Main_x 58), 187049#(<= Main_x 59), 187054#(<= Main_x 64), 187055#(<= Main_x 65), 187052#(<= Main_x 62), 187053#(<= Main_x 63), 187058#(<= Main_x 68), 187059#(<= Main_x 69), 187056#(<= Main_x 66), 187057#(<= Main_x 67), 187062#(<= Main_x 72), 187063#(<= Main_x 73), 187060#(<= Main_x 70), 187061#(<= Main_x 71), 187066#(<= Main_x 76), 187067#(<= Main_x 77), 187064#(<= Main_x 74), 187065#(<= Main_x 75), 187070#(<= Main_x 80), 187071#(<= Main_x 81), 187068#(<= Main_x 78), 187069#(<= Main_x 79), 187074#(<= Main_x 84), 187075#(<= Main_x 85), 187072#(<= Main_x 82), 187073#(<= Main_x 83), 187078#(<= Main_x 88), 187079#(<= Main_x 89), 187076#(<= Main_x 86), 187077#(<= Main_x 87), 187082#(<= Main_x 92), 187083#(<= Main_x 93), 187080#(<= Main_x 90), 187081#(<= Main_x 91), 187086#(<= Main_x 96), 187087#(<= Main_x 97), 187084#(<= Main_x 94), 187085#(<= Main_x 95), 187090#(<= Main_x 100), 187091#(<= Main_x 101), 187088#(<= Main_x 98), 187089#(<= Main_x 99), 187094#(<= Main_x 104), 187095#(<= Main_x 105), 187092#(<= Main_x 102), 187093#(<= Main_x 103), 187096#(<= Main_x 106), 187097#(<= (+ Main_x 1) 0)] [2018-07-23 13:59:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:22,154 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 13:59:22,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 13:59:22,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:59:22,156 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 110 states. [2018-07-23 13:59:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:22,987 INFO L93 Difference]: Finished difference Result 330 states and 332 transitions. [2018-07-23 13:59:22,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 13:59:22,987 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-23 13:59:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:22,988 INFO L225 Difference]: With dead ends: 330 [2018-07-23 13:59:22,988 INFO L226 Difference]: Without dead ends: 219 [2018-07-23 13:59:22,988 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:59:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-23 13:59:23,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-23 13:59:23,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-23 13:59:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-07-23 13:59:23,226 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 218 [2018-07-23 13:59:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:23,227 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-07-23 13:59:23,227 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 13:59:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-07-23 13:59:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-23 13:59:23,227 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:23,227 INFO L357 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2018-07-23 13:59:23,227 INFO L414 AbstractCegarLoop]: === Iteration 321 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1644471763, now seen corresponding path program 318 times [2018-07-23 13:59:23,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:23,803 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:23,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 13:59:23,803 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:23,803 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:59:23,803 INFO L185 omatonBuilderFactory]: Interpolants [188198#(<= 0 Main_x), 188199#(<= 1 Main_x), 188196#true, 188197#false, 188202#(<= 4 Main_x), 188203#(<= 5 Main_x), 188200#(<= 2 Main_x), 188201#(<= 3 Main_x), 188206#(<= 8 Main_x), 188207#(<= 9 Main_x), 188204#(<= 6 Main_x), 188205#(<= 7 Main_x), 188210#(<= 12 Main_x), 188211#(<= 13 Main_x), 188208#(<= 10 Main_x), 188209#(<= 11 Main_x), 188214#(<= 16 Main_x), 188215#(<= 17 Main_x), 188212#(<= 14 Main_x), 188213#(<= 15 Main_x), 188218#(<= 20 Main_x), 188219#(<= 21 Main_x), 188216#(<= 18 Main_x), 188217#(<= 19 Main_x), 188222#(<= 24 Main_x), 188223#(<= 25 Main_x), 188220#(<= 22 Main_x), 188221#(<= 23 Main_x), 188226#(<= 28 Main_x), 188227#(<= 29 Main_x), 188224#(<= 26 Main_x), 188225#(<= 27 Main_x), 188230#(<= 32 Main_x), 188231#(<= 33 Main_x), 188228#(<= 30 Main_x), 188229#(<= 31 Main_x), 188234#(<= 36 Main_x), 188235#(<= 37 Main_x), 188232#(<= 34 Main_x), 188233#(<= 35 Main_x), 188238#(<= 40 Main_x), 188239#(<= 41 Main_x), 188236#(<= 38 Main_x), 188237#(<= 39 Main_x), 188242#(<= 44 Main_x), 188243#(<= 45 Main_x), 188240#(<= 42 Main_x), 188241#(<= 43 Main_x), 188246#(<= 48 Main_x), 188247#(<= 49 Main_x), 188244#(<= 46 Main_x), 188245#(<= 47 Main_x), 188250#(<= 52 Main_x), 188251#(<= 53 Main_x), 188248#(<= 50 Main_x), 188249#(<= 51 Main_x), 188254#(<= 56 Main_x), 188255#(<= 57 Main_x), 188252#(<= 54 Main_x), 188253#(<= 55 Main_x), 188258#(<= 60 Main_x), 188259#(<= 61 Main_x), 188256#(<= 58 Main_x), 188257#(<= 59 Main_x), 188262#(<= 64 Main_x), 188263#(<= 65 Main_x), 188260#(<= 62 Main_x), 188261#(<= 63 Main_x), 188266#(<= 68 Main_x), 188267#(<= 69 Main_x), 188264#(<= 66 Main_x), 188265#(<= 67 Main_x), 188270#(<= 72 Main_x), 188271#(<= 73 Main_x), 188268#(<= 70 Main_x), 188269#(<= 71 Main_x), 188274#(<= 76 Main_x), 188275#(<= 77 Main_x), 188272#(<= 74 Main_x), 188273#(<= 75 Main_x), 188278#(<= 80 Main_x), 188279#(<= 81 Main_x), 188276#(<= 78 Main_x), 188277#(<= 79 Main_x), 188282#(<= 84 Main_x), 188283#(<= 85 Main_x), 188280#(<= 82 Main_x), 188281#(<= 83 Main_x), 188286#(<= 88 Main_x), 188287#(<= 89 Main_x), 188284#(<= 86 Main_x), 188285#(<= 87 Main_x), 188290#(<= 92 Main_x), 188291#(<= 93 Main_x), 188288#(<= 90 Main_x), 188289#(<= 91 Main_x), 188294#(<= 96 Main_x), 188295#(<= 97 Main_x), 188292#(<= 94 Main_x), 188293#(<= 95 Main_x), 188298#(<= 100 Main_x), 188299#(<= 101 Main_x), 188296#(<= 98 Main_x), 188297#(<= 99 Main_x), 188302#(<= 104 Main_x), 188303#(<= 105 Main_x), 188300#(<= 102 Main_x), 188301#(<= 103 Main_x), 188304#(<= 106 Main_x), 188305#(<= 107 Main_x)] [2018-07-23 13:59:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 5778 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:23,804 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 13:59:23,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 13:59:23,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:59:23,805 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 110 states. [2018-07-23 13:59:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:24,117 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2018-07-23 13:59:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 13:59:24,117 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-23 13:59:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:24,118 INFO L225 Difference]: With dead ends: 223 [2018-07-23 13:59:24,118 INFO L226 Difference]: Without dead ends: 220 [2018-07-23 13:59:24,118 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:59:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-07-23 13:59:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-07-23 13:59:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-23 13:59:24,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-07-23 13:59:24,373 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 218 [2018-07-23 13:59:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:24,373 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-07-23 13:59:24,373 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 13:59:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-07-23 13:59:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-23 13:59:24,373 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:24,374 INFO L357 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1] [2018-07-23 13:59:24,374 INFO L414 AbstractCegarLoop]: === Iteration 322 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash 560921377, now seen corresponding path program 319 times [2018-07-23 13:59:24,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:25,079 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:25,079 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 13:59:25,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:25,080 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:59:25,080 INFO L185 omatonBuilderFactory]: Interpolants [189194#(and (<= 0 Main_y) (<= Main_y 0)), 189195#(and (<= 1 Main_y) (<= Main_y 1)), 189192#true, 189193#false, 189198#(and (<= Main_y 4) (<= 4 Main_y)), 189199#(and (<= Main_y 5) (<= 5 Main_y)), 189196#(and (<= Main_y 2) (<= 2 Main_y)), 189197#(and (<= Main_y 3) (<= 3 Main_y)), 189202#(and (<= 8 Main_y) (<= Main_y 8)), 189203#(and (<= Main_y 9) (<= 9 Main_y)), 189200#(and (<= Main_y 6) (<= 6 Main_y)), 189201#(and (<= 7 Main_y) (<= Main_y 7)), 189206#(and (<= 12 Main_y) (<= Main_y 12)), 189207#(and (<= 13 Main_y) (<= Main_y 13)), 189204#(and (<= 10 Main_y) (<= Main_y 10)), 189205#(and (<= 11 Main_y) (<= Main_y 11)), 189210#(and (<= 16 Main_y) (<= Main_y 16)), 189211#(and (<= Main_y 17) (<= 17 Main_y)), 189208#(and (<= 14 Main_y) (<= Main_y 14)), 189209#(and (<= Main_y 15) (<= 15 Main_y)), 189214#(and (<= 20 Main_y) (<= Main_y 20)), 189215#(and (<= 21 Main_y) (<= Main_y 21)), 189212#(and (<= Main_y 18) (<= 18 Main_y)), 189213#(and (<= Main_y 19) (<= 19 Main_y)), 189218#(and (<= Main_y 24) (<= 24 Main_y)), 189219#(and (<= 25 Main_y) (<= Main_y 25)), 189216#(and (<= Main_y 22) (<= 22 Main_y)), 189217#(and (<= 23 Main_y) (<= Main_y 23)), 189222#(and (<= 28 Main_y) (<= Main_y 28)), 189223#(and (<= 29 Main_y) (<= Main_y 29)), 189220#(and (<= Main_y 26) (<= 26 Main_y)), 189221#(and (<= 27 Main_y) (<= Main_y 27)), 189226#(and (<= 32 Main_y) (<= Main_y 32)), 189227#(and (<= 33 Main_y) (<= Main_y 33)), 189224#(and (<= 30 Main_y) (<= Main_y 30)), 189225#(and (<= Main_y 31) (<= 31 Main_y)), 189230#(and (<= 36 Main_y) (<= Main_y 36)), 189231#(and (<= Main_y 37) (<= 37 Main_y)), 189228#(and (<= Main_y 34) (<= 34 Main_y)), 189229#(and (<= 35 Main_y) (<= Main_y 35)), 189234#(and (<= 40 Main_y) (<= Main_y 40)), 189235#(and (<= Main_y 41) (<= 41 Main_y)), 189232#(and (<= Main_y 38) (<= 38 Main_y)), 189233#(and (<= 39 Main_y) (<= Main_y 39)), 189238#(and (<= 44 Main_y) (<= Main_y 44)), 189239#(and (<= Main_y 45) (<= 45 Main_y)), 189236#(and (<= 42 Main_y) (<= Main_y 42)), 189237#(and (<= 43 Main_y) (<= Main_y 43)), 189242#(and (<= 48 Main_y) (<= Main_y 48)), 189243#(and (<= 49 Main_y) (<= Main_y 49)), 189240#(and (<= 46 Main_y) (<= Main_y 46)), 189241#(and (<= 47 Main_y) (<= Main_y 47)), 189246#(and (<= 52 Main_y) (<= Main_y 52)), 189247#(and (<= 53 Main_y) (<= Main_y 53)), 189244#(and (<= 50 Main_y) (<= Main_y 50)), 189245#(and (<= 51 Main_y) (<= Main_y 51)), 189250#(and (<= Main_y 56) (<= 56 Main_y)), 189251#(and (<= Main_y 57) (<= 57 Main_y)), 189248#(and (<= 54 Main_y) (<= Main_y 54)), 189249#(and (<= 55 Main_y) (<= Main_y 55)), 189254#(and (<= Main_y 60) (<= 60 Main_y)), 189255#(and (<= Main_y 61) (<= 61 Main_y)), 189252#(and (<= Main_y 58) (<= 58 Main_y)), 189253#(and (<= Main_y 59) (<= 59 Main_y)), 189258#(and (<= 64 Main_y) (<= Main_y 64)), 189259#(and (<= Main_y 65) (<= 65 Main_y)), 189256#(and (<= 62 Main_y) (<= Main_y 62)), 189257#(and (<= 63 Main_y) (<= Main_y 63)), 189262#(and (<= 68 Main_y) (<= Main_y 68)), 189263#(and (<= Main_y 69) (<= 69 Main_y)), 189260#(and (<= Main_y 66) (<= 66 Main_y)), 189261#(and (<= 67 Main_y) (<= Main_y 67)), 189266#(and (<= 72 Main_y) (<= Main_y 72)), 189267#(and (<= 73 Main_y) (<= Main_y 73)), 189264#(and (<= 70 Main_y) (<= Main_y 70)), 189265#(and (<= Main_y 71) (<= 71 Main_y)), 189270#(and (<= Main_y 76) (<= 76 Main_y)), 189271#(and (<= Main_y 77) (<= 77 Main_y)), 189268#(and (<= 74 Main_y) (<= Main_y 74)), 189269#(and (<= Main_y 75) (<= 75 Main_y)), 189274#(and (<= Main_y 80) (<= 80 Main_y)), 189275#(and (<= 81 Main_y) (<= Main_y 81)), 189272#(and (<= Main_y 78) (<= 78 Main_y)), 189273#(and (<= 79 Main_y) (<= Main_y 79)), 189278#(and (<= Main_y 84) (<= 84 Main_y)), 189279#(and (<= Main_y 85) (<= 85 Main_y)), 189276#(and (<= Main_y 82) (<= 82 Main_y)), 189277#(and (<= Main_y 83) (<= 83 Main_y)), 189282#(and (<= Main_y 88) (<= 88 Main_y)), 189283#(and (<= Main_y 89) (<= 89 Main_y)), 189280#(and (<= 86 Main_y) (<= Main_y 86)), 189281#(and (<= Main_y 87) (<= 87 Main_y)), 189286#(and (<= 92 Main_y) (<= Main_y 92)), 189287#(and (<= 93 Main_y) (<= Main_y 93)), 189284#(and (<= Main_y 90) (<= 90 Main_y)), 189285#(and (<= Main_y 91) (<= 91 Main_y)), 189290#(and (<= 96 Main_y) (<= Main_y 96)), 189291#(and (<= Main_y 97) (<= 97 Main_y)), 189288#(and (<= 94 Main_y) (<= Main_y 94)), 189289#(and (<= Main_y 95) (<= 95 Main_y)), 189294#(and (<= Main_y 100) (<= 100 Main_y)), 189295#(and (<= Main_y 101) (<= 101 Main_y)), 189292#(and (<= 98 Main_y) (<= Main_y 98)), 189293#(and (<= 99 Main_y) (<= Main_y 99)), 189298#(and (<= 104 Main_y) (<= Main_y 104)), 189299#(and (<= 105 Main_y) (<= Main_y 105)), 189296#(and (<= 102 Main_y) (<= Main_y 102)), 189297#(and (<= 103 Main_y) (<= Main_y 103)), 189300#(and (<= Main_y 106) (<= 106 Main_y)), 189301#(and (<= Main_y 107) (<= 107 Main_y))] [2018-07-23 13:59:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:25,081 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 13:59:25,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 13:59:25,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:59:25,081 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 110 states. [2018-07-23 13:59:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:26,732 INFO L93 Difference]: Finished difference Result 332 states and 334 transitions. [2018-07-23 13:59:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 13:59:26,732 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 219 [2018-07-23 13:59:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:26,733 INFO L225 Difference]: With dead ends: 332 [2018-07-23 13:59:26,733 INFO L226 Difference]: Without dead ends: 329 [2018-07-23 13:59:26,733 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:59:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-23 13:59:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 222. [2018-07-23 13:59:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-23 13:59:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 224 transitions. [2018-07-23 13:59:26,960 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 224 transitions. Word has length 219 [2018-07-23 13:59:26,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:26,960 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 224 transitions. [2018-07-23 13:59:26,960 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 13:59:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 224 transitions. [2018-07-23 13:59:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 13:59:26,961 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:26,961 INFO L357 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2018-07-23 13:59:26,961 INFO L414 AbstractCegarLoop]: === Iteration 323 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash 208631981, now seen corresponding path program 320 times [2018-07-23 13:59:26,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5886 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:27,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:27,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 13:59:27,469 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:27,470 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:59:27,470 INFO L185 omatonBuilderFactory]: Interpolants [190466#(<= Main_x 54), 190467#(<= Main_x 55), 190464#(<= Main_x 52), 190465#(<= Main_x 53), 190470#(<= Main_x 58), 190471#(<= Main_x 59), 190468#(<= Main_x 56), 190469#(<= Main_x 57), 190474#(<= Main_x 62), 190475#(<= Main_x 63), 190472#(<= Main_x 60), 190473#(<= Main_x 61), 190478#(<= Main_x 66), 190479#(<= Main_x 67), 190476#(<= Main_x 64), 190477#(<= Main_x 65), 190482#(<= Main_x 70), 190483#(<= Main_x 71), 190480#(<= Main_x 68), 190481#(<= Main_x 69), 190486#(<= Main_x 74), 190487#(<= Main_x 75), 190484#(<= Main_x 72), 190485#(<= Main_x 73), 190490#(<= Main_x 78), 190491#(<= Main_x 79), 190488#(<= Main_x 76), 190489#(<= Main_x 77), 190494#(<= Main_x 82), 190495#(<= Main_x 83), 190492#(<= Main_x 80), 190493#(<= Main_x 81), 190498#(<= Main_x 86), 190499#(<= Main_x 87), 190496#(<= Main_x 84), 190497#(<= Main_x 85), 190502#(<= Main_x 90), 190503#(<= Main_x 91), 190500#(<= Main_x 88), 190501#(<= Main_x 89), 190506#(<= Main_x 94), 190507#(<= Main_x 95), 190504#(<= Main_x 92), 190505#(<= Main_x 93), 190510#(<= Main_x 98), 190511#(<= Main_x 99), 190508#(<= Main_x 96), 190509#(<= Main_x 97), 190514#(<= Main_x 102), 190515#(<= Main_x 103), 190512#(<= Main_x 100), 190513#(<= Main_x 101), 190518#(<= Main_x 106), 190519#(<= Main_x 107), 190516#(<= Main_x 104), 190517#(<= Main_x 105), 190520#(<= (+ Main_x 1) 0), 190410#true, 190411#false, 190414#(<= Main_x 2), 190415#(<= Main_x 3), 190412#(<= Main_x 0), 190413#(<= Main_x 1), 190418#(<= Main_x 6), 190419#(<= Main_x 7), 190416#(<= Main_x 4), 190417#(<= Main_x 5), 190422#(<= Main_x 10), 190423#(<= Main_x 11), 190420#(<= Main_x 8), 190421#(<= Main_x 9), 190426#(<= Main_x 14), 190427#(<= Main_x 15), 190424#(<= Main_x 12), 190425#(<= Main_x 13), 190430#(<= Main_x 18), 190431#(<= Main_x 19), 190428#(<= Main_x 16), 190429#(<= Main_x 17), 190434#(<= Main_x 22), 190435#(<= Main_x 23), 190432#(<= Main_x 20), 190433#(<= Main_x 21), 190438#(<= Main_x 26), 190439#(<= Main_x 27), 190436#(<= Main_x 24), 190437#(<= Main_x 25), 190442#(<= Main_x 30), 190443#(<= Main_x 31), 190440#(<= Main_x 28), 190441#(<= Main_x 29), 190446#(<= Main_x 34), 190447#(<= Main_x 35), 190444#(<= Main_x 32), 190445#(<= Main_x 33), 190450#(<= Main_x 38), 190451#(<= Main_x 39), 190448#(<= Main_x 36), 190449#(<= Main_x 37), 190454#(<= Main_x 42), 190455#(<= Main_x 43), 190452#(<= Main_x 40), 190453#(<= Main_x 41), 190458#(<= Main_x 46), 190459#(<= Main_x 47), 190456#(<= Main_x 44), 190457#(<= Main_x 45), 190462#(<= Main_x 50), 190463#(<= Main_x 51), 190460#(<= Main_x 48), 190461#(<= Main_x 49)] [2018-07-23 13:59:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5886 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:27,470 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 13:59:27,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 13:59:27,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:59:27,471 INFO L87 Difference]: Start difference. First operand 222 states and 224 transitions. Second operand 111 states. [2018-07-23 13:59:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:28,034 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2018-07-23 13:59:28,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 13:59:28,034 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-23 13:59:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:28,035 INFO L225 Difference]: With dead ends: 333 [2018-07-23 13:59:28,035 INFO L226 Difference]: Without dead ends: 221 [2018-07-23 13:59:28,035 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:59:28,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-23 13:59:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-23 13:59:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 13:59:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-07-23 13:59:28,245 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 220 [2018-07-23 13:59:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:28,245 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-07-23 13:59:28,245 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 13:59:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-07-23 13:59:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 13:59:28,246 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:28,246 INFO L357 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2018-07-23 13:59:28,246 INFO L414 AbstractCegarLoop]: === Iteration 324 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash 267750215, now seen corresponding path program 321 times [2018-07-23 13:59:28,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5886 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:28,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:28,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 13:59:28,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:28,743 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:59:28,744 INFO L185 omatonBuilderFactory]: Interpolants [191630#false, 191631#(<= 0 Main_x), 191629#true, 191634#(<= 3 Main_x), 191635#(<= 4 Main_x), 191632#(<= 1 Main_x), 191633#(<= 2 Main_x), 191638#(<= 7 Main_x), 191639#(<= 8 Main_x), 191636#(<= 5 Main_x), 191637#(<= 6 Main_x), 191642#(<= 11 Main_x), 191643#(<= 12 Main_x), 191640#(<= 9 Main_x), 191641#(<= 10 Main_x), 191646#(<= 15 Main_x), 191647#(<= 16 Main_x), 191644#(<= 13 Main_x), 191645#(<= 14 Main_x), 191650#(<= 19 Main_x), 191651#(<= 20 Main_x), 191648#(<= 17 Main_x), 191649#(<= 18 Main_x), 191654#(<= 23 Main_x), 191655#(<= 24 Main_x), 191652#(<= 21 Main_x), 191653#(<= 22 Main_x), 191658#(<= 27 Main_x), 191659#(<= 28 Main_x), 191656#(<= 25 Main_x), 191657#(<= 26 Main_x), 191662#(<= 31 Main_x), 191663#(<= 32 Main_x), 191660#(<= 29 Main_x), 191661#(<= 30 Main_x), 191666#(<= 35 Main_x), 191667#(<= 36 Main_x), 191664#(<= 33 Main_x), 191665#(<= 34 Main_x), 191670#(<= 39 Main_x), 191671#(<= 40 Main_x), 191668#(<= 37 Main_x), 191669#(<= 38 Main_x), 191674#(<= 43 Main_x), 191675#(<= 44 Main_x), 191672#(<= 41 Main_x), 191673#(<= 42 Main_x), 191678#(<= 47 Main_x), 191679#(<= 48 Main_x), 191676#(<= 45 Main_x), 191677#(<= 46 Main_x), 191682#(<= 51 Main_x), 191683#(<= 52 Main_x), 191680#(<= 49 Main_x), 191681#(<= 50 Main_x), 191686#(<= 55 Main_x), 191687#(<= 56 Main_x), 191684#(<= 53 Main_x), 191685#(<= 54 Main_x), 191690#(<= 59 Main_x), 191691#(<= 60 Main_x), 191688#(<= 57 Main_x), 191689#(<= 58 Main_x), 191694#(<= 63 Main_x), 191695#(<= 64 Main_x), 191692#(<= 61 Main_x), 191693#(<= 62 Main_x), 191698#(<= 67 Main_x), 191699#(<= 68 Main_x), 191696#(<= 65 Main_x), 191697#(<= 66 Main_x), 191702#(<= 71 Main_x), 191703#(<= 72 Main_x), 191700#(<= 69 Main_x), 191701#(<= 70 Main_x), 191706#(<= 75 Main_x), 191707#(<= 76 Main_x), 191704#(<= 73 Main_x), 191705#(<= 74 Main_x), 191710#(<= 79 Main_x), 191711#(<= 80 Main_x), 191708#(<= 77 Main_x), 191709#(<= 78 Main_x), 191714#(<= 83 Main_x), 191715#(<= 84 Main_x), 191712#(<= 81 Main_x), 191713#(<= 82 Main_x), 191718#(<= 87 Main_x), 191719#(<= 88 Main_x), 191716#(<= 85 Main_x), 191717#(<= 86 Main_x), 191722#(<= 91 Main_x), 191723#(<= 92 Main_x), 191720#(<= 89 Main_x), 191721#(<= 90 Main_x), 191726#(<= 95 Main_x), 191727#(<= 96 Main_x), 191724#(<= 93 Main_x), 191725#(<= 94 Main_x), 191730#(<= 99 Main_x), 191731#(<= 100 Main_x), 191728#(<= 97 Main_x), 191729#(<= 98 Main_x), 191734#(<= 103 Main_x), 191735#(<= 104 Main_x), 191732#(<= 101 Main_x), 191733#(<= 102 Main_x), 191738#(<= 107 Main_x), 191739#(<= 108 Main_x), 191736#(<= 105 Main_x), 191737#(<= 106 Main_x)] [2018-07-23 13:59:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 5886 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:28,744 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 13:59:28,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 13:59:28,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:59:28,745 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 111 states. [2018-07-23 13:59:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:29,011 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-07-23 13:59:29,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 13:59:29,011 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-23 13:59:29,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:29,012 INFO L225 Difference]: With dead ends: 225 [2018-07-23 13:59:29,012 INFO L226 Difference]: Without dead ends: 222 [2018-07-23 13:59:29,013 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:59:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-23 13:59:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-07-23 13:59:29,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-07-23 13:59:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-07-23 13:59:29,226 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 220 [2018-07-23 13:59:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:29,227 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-07-23 13:59:29,227 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 13:59:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-07-23 13:59:29,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-07-23 13:59:29,227 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:29,227 INFO L357 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1] [2018-07-23 13:59:29,227 INFO L414 AbstractCegarLoop]: === Iteration 325 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -289739449, now seen corresponding path program 322 times [2018-07-23 13:59:29,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:29,977 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:29,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 13:59:29,978 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:29,978 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:59:29,978 INFO L185 omatonBuilderFactory]: Interpolants [192634#true, 192635#false, 192638#(and (<= Main_y 2) (<= 2 Main_y)), 192639#(and (<= Main_y 3) (<= 3 Main_y)), 192636#(and (<= 0 Main_y) (<= Main_y 0)), 192637#(and (<= 1 Main_y) (<= Main_y 1)), 192642#(and (<= Main_y 6) (<= 6 Main_y)), 192643#(and (<= 7 Main_y) (<= Main_y 7)), 192640#(and (<= Main_y 4) (<= 4 Main_y)), 192641#(and (<= Main_y 5) (<= 5 Main_y)), 192646#(and (<= 10 Main_y) (<= Main_y 10)), 192647#(and (<= 11 Main_y) (<= Main_y 11)), 192644#(and (<= 8 Main_y) (<= Main_y 8)), 192645#(and (<= Main_y 9) (<= 9 Main_y)), 192650#(and (<= 14 Main_y) (<= Main_y 14)), 192651#(and (<= Main_y 15) (<= 15 Main_y)), 192648#(and (<= 12 Main_y) (<= Main_y 12)), 192649#(and (<= 13 Main_y) (<= Main_y 13)), 192654#(and (<= Main_y 18) (<= 18 Main_y)), 192655#(and (<= Main_y 19) (<= 19 Main_y)), 192652#(and (<= 16 Main_y) (<= Main_y 16)), 192653#(and (<= Main_y 17) (<= 17 Main_y)), 192658#(and (<= Main_y 22) (<= 22 Main_y)), 192659#(and (<= 23 Main_y) (<= Main_y 23)), 192656#(and (<= 20 Main_y) (<= Main_y 20)), 192657#(and (<= 21 Main_y) (<= Main_y 21)), 192662#(and (<= Main_y 26) (<= 26 Main_y)), 192663#(and (<= 27 Main_y) (<= Main_y 27)), 192660#(and (<= Main_y 24) (<= 24 Main_y)), 192661#(and (<= 25 Main_y) (<= Main_y 25)), 192666#(and (<= 30 Main_y) (<= Main_y 30)), 192667#(and (<= Main_y 31) (<= 31 Main_y)), 192664#(and (<= 28 Main_y) (<= Main_y 28)), 192665#(and (<= 29 Main_y) (<= Main_y 29)), 192670#(and (<= Main_y 34) (<= 34 Main_y)), 192671#(and (<= 35 Main_y) (<= Main_y 35)), 192668#(and (<= 32 Main_y) (<= Main_y 32)), 192669#(and (<= 33 Main_y) (<= Main_y 33)), 192674#(and (<= Main_y 38) (<= 38 Main_y)), 192675#(and (<= 39 Main_y) (<= Main_y 39)), 192672#(and (<= 36 Main_y) (<= Main_y 36)), 192673#(and (<= Main_y 37) (<= 37 Main_y)), 192678#(and (<= 42 Main_y) (<= Main_y 42)), 192679#(and (<= 43 Main_y) (<= Main_y 43)), 192676#(and (<= 40 Main_y) (<= Main_y 40)), 192677#(and (<= Main_y 41) (<= 41 Main_y)), 192682#(and (<= 46 Main_y) (<= Main_y 46)), 192683#(and (<= 47 Main_y) (<= Main_y 47)), 192680#(and (<= 44 Main_y) (<= Main_y 44)), 192681#(and (<= Main_y 45) (<= 45 Main_y)), 192686#(and (<= 50 Main_y) (<= Main_y 50)), 192687#(and (<= 51 Main_y) (<= Main_y 51)), 192684#(and (<= 48 Main_y) (<= Main_y 48)), 192685#(and (<= 49 Main_y) (<= Main_y 49)), 192690#(and (<= 54 Main_y) (<= Main_y 54)), 192691#(and (<= 55 Main_y) (<= Main_y 55)), 192688#(and (<= 52 Main_y) (<= Main_y 52)), 192689#(and (<= 53 Main_y) (<= Main_y 53)), 192694#(and (<= Main_y 58) (<= 58 Main_y)), 192695#(and (<= Main_y 59) (<= 59 Main_y)), 192692#(and (<= Main_y 56) (<= 56 Main_y)), 192693#(and (<= Main_y 57) (<= 57 Main_y)), 192698#(and (<= 62 Main_y) (<= Main_y 62)), 192699#(and (<= 63 Main_y) (<= Main_y 63)), 192696#(and (<= Main_y 60) (<= 60 Main_y)), 192697#(and (<= Main_y 61) (<= 61 Main_y)), 192702#(and (<= Main_y 66) (<= 66 Main_y)), 192703#(and (<= 67 Main_y) (<= Main_y 67)), 192700#(and (<= 64 Main_y) (<= Main_y 64)), 192701#(and (<= Main_y 65) (<= 65 Main_y)), 192706#(and (<= 70 Main_y) (<= Main_y 70)), 192707#(and (<= Main_y 71) (<= 71 Main_y)), 192704#(and (<= 68 Main_y) (<= Main_y 68)), 192705#(and (<= Main_y 69) (<= 69 Main_y)), 192710#(and (<= 74 Main_y) (<= Main_y 74)), 192711#(and (<= Main_y 75) (<= 75 Main_y)), 192708#(and (<= 72 Main_y) (<= Main_y 72)), 192709#(and (<= 73 Main_y) (<= Main_y 73)), 192714#(and (<= Main_y 78) (<= 78 Main_y)), 192715#(and (<= 79 Main_y) (<= Main_y 79)), 192712#(and (<= Main_y 76) (<= 76 Main_y)), 192713#(and (<= Main_y 77) (<= 77 Main_y)), 192718#(and (<= Main_y 82) (<= 82 Main_y)), 192719#(and (<= Main_y 83) (<= 83 Main_y)), 192716#(and (<= Main_y 80) (<= 80 Main_y)), 192717#(and (<= 81 Main_y) (<= Main_y 81)), 192722#(and (<= 86 Main_y) (<= Main_y 86)), 192723#(and (<= Main_y 87) (<= 87 Main_y)), 192720#(and (<= Main_y 84) (<= 84 Main_y)), 192721#(and (<= Main_y 85) (<= 85 Main_y)), 192726#(and (<= Main_y 90) (<= 90 Main_y)), 192727#(and (<= Main_y 91) (<= 91 Main_y)), 192724#(and (<= Main_y 88) (<= 88 Main_y)), 192725#(and (<= Main_y 89) (<= 89 Main_y)), 192730#(and (<= 94 Main_y) (<= Main_y 94)), 192731#(and (<= Main_y 95) (<= 95 Main_y)), 192728#(and (<= 92 Main_y) (<= Main_y 92)), 192729#(and (<= 93 Main_y) (<= Main_y 93)), 192734#(and (<= 98 Main_y) (<= Main_y 98)), 192735#(and (<= 99 Main_y) (<= Main_y 99)), 192732#(and (<= 96 Main_y) (<= Main_y 96)), 192733#(and (<= Main_y 97) (<= 97 Main_y)), 192738#(and (<= 102 Main_y) (<= Main_y 102)), 192739#(and (<= 103 Main_y) (<= Main_y 103)), 192736#(and (<= Main_y 100) (<= 100 Main_y)), 192737#(and (<= Main_y 101) (<= 101 Main_y)), 192742#(and (<= Main_y 106) (<= 106 Main_y)), 192743#(and (<= Main_y 107) (<= 107 Main_y)), 192740#(and (<= 104 Main_y) (<= Main_y 104)), 192741#(and (<= 105 Main_y) (<= Main_y 105)), 192744#(and (<= Main_y 108) (<= 108 Main_y))] [2018-07-23 13:59:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:29,979 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 13:59:29,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 13:59:29,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:59:29,979 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 111 states. [2018-07-23 13:59:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:31,521 INFO L93 Difference]: Finished difference Result 335 states and 337 transitions. [2018-07-23 13:59:31,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 13:59:31,521 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 221 [2018-07-23 13:59:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:31,522 INFO L225 Difference]: With dead ends: 335 [2018-07-23 13:59:31,522 INFO L226 Difference]: Without dead ends: 332 [2018-07-23 13:59:31,522 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:59:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-07-23 13:59:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 224. [2018-07-23 13:59:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-23 13:59:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2018-07-23 13:59:31,742 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 221 [2018-07-23 13:59:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:31,742 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2018-07-23 13:59:31,742 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 13:59:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2018-07-23 13:59:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-23 13:59:31,743 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:31,743 INFO L357 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2018-07-23 13:59:31,743 INFO L414 AbstractCegarLoop]: === Iteration 326 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash -392049849, now seen corresponding path program 323 times [2018-07-23 13:59:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:32,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:32,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 13:59:32,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:32,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:59:32,244 INFO L185 omatonBuilderFactory]: Interpolants [193863#true, 193866#(<= Main_x 1), 193867#(<= Main_x 2), 193864#false, 193865#(<= Main_x 0), 193870#(<= Main_x 5), 193871#(<= Main_x 6), 193868#(<= Main_x 3), 193869#(<= Main_x 4), 193874#(<= Main_x 9), 193875#(<= Main_x 10), 193872#(<= Main_x 7), 193873#(<= Main_x 8), 193878#(<= Main_x 13), 193879#(<= Main_x 14), 193876#(<= Main_x 11), 193877#(<= Main_x 12), 193882#(<= Main_x 17), 193883#(<= Main_x 18), 193880#(<= Main_x 15), 193881#(<= Main_x 16), 193886#(<= Main_x 21), 193887#(<= Main_x 22), 193884#(<= Main_x 19), 193885#(<= Main_x 20), 193890#(<= Main_x 25), 193891#(<= Main_x 26), 193888#(<= Main_x 23), 193889#(<= Main_x 24), 193894#(<= Main_x 29), 193895#(<= Main_x 30), 193892#(<= Main_x 27), 193893#(<= Main_x 28), 193898#(<= Main_x 33), 193899#(<= Main_x 34), 193896#(<= Main_x 31), 193897#(<= Main_x 32), 193902#(<= Main_x 37), 193903#(<= Main_x 38), 193900#(<= Main_x 35), 193901#(<= Main_x 36), 193906#(<= Main_x 41), 193907#(<= Main_x 42), 193904#(<= Main_x 39), 193905#(<= Main_x 40), 193910#(<= Main_x 45), 193911#(<= Main_x 46), 193908#(<= Main_x 43), 193909#(<= Main_x 44), 193914#(<= Main_x 49), 193915#(<= Main_x 50), 193912#(<= Main_x 47), 193913#(<= Main_x 48), 193918#(<= Main_x 53), 193919#(<= Main_x 54), 193916#(<= Main_x 51), 193917#(<= Main_x 52), 193922#(<= Main_x 57), 193923#(<= Main_x 58), 193920#(<= Main_x 55), 193921#(<= Main_x 56), 193926#(<= Main_x 61), 193927#(<= Main_x 62), 193924#(<= Main_x 59), 193925#(<= Main_x 60), 193930#(<= Main_x 65), 193931#(<= Main_x 66), 193928#(<= Main_x 63), 193929#(<= Main_x 64), 193934#(<= Main_x 69), 193935#(<= Main_x 70), 193932#(<= Main_x 67), 193933#(<= Main_x 68), 193938#(<= Main_x 73), 193939#(<= Main_x 74), 193936#(<= Main_x 71), 193937#(<= Main_x 72), 193942#(<= Main_x 77), 193943#(<= Main_x 78), 193940#(<= Main_x 75), 193941#(<= Main_x 76), 193946#(<= Main_x 81), 193947#(<= Main_x 82), 193944#(<= Main_x 79), 193945#(<= Main_x 80), 193950#(<= Main_x 85), 193951#(<= Main_x 86), 193948#(<= Main_x 83), 193949#(<= Main_x 84), 193954#(<= Main_x 89), 193955#(<= Main_x 90), 193952#(<= Main_x 87), 193953#(<= Main_x 88), 193958#(<= Main_x 93), 193959#(<= Main_x 94), 193956#(<= Main_x 91), 193957#(<= Main_x 92), 193962#(<= Main_x 97), 193963#(<= Main_x 98), 193960#(<= Main_x 95), 193961#(<= Main_x 96), 193966#(<= Main_x 101), 193967#(<= Main_x 102), 193964#(<= Main_x 99), 193965#(<= Main_x 100), 193970#(<= Main_x 105), 193971#(<= Main_x 106), 193968#(<= Main_x 103), 193969#(<= Main_x 104), 193974#(<= (+ Main_x 1) 0), 193972#(<= Main_x 107), 193973#(<= Main_x 108)] [2018-07-23 13:59:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:32,245 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 13:59:32,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 13:59:32,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:59:32,246 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 112 states. [2018-07-23 13:59:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:32,953 INFO L93 Difference]: Finished difference Result 336 states and 338 transitions. [2018-07-23 13:59:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 13:59:32,953 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-23 13:59:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:32,953 INFO L225 Difference]: With dead ends: 336 [2018-07-23 13:59:32,954 INFO L226 Difference]: Without dead ends: 223 [2018-07-23 13:59:32,954 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:59:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-23 13:59:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-23 13:59:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-23 13:59:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-07-23 13:59:33,190 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 222 [2018-07-23 13:59:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:33,191 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-07-23 13:59:33,191 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 13:59:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-07-23 13:59:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-23 13:59:33,191 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:33,191 INFO L357 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2018-07-23 13:59:33,191 INFO L414 AbstractCegarLoop]: === Iteration 327 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:33,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1440615405, now seen corresponding path program 324 times [2018-07-23 13:59:33,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:33,711 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:33,712 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 13:59:33,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:33,712 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:59:33,712 INFO L185 omatonBuilderFactory]: Interpolants [195094#false, 195095#(<= 0 Main_x), 195093#true, 195098#(<= 3 Main_x), 195099#(<= 4 Main_x), 195096#(<= 1 Main_x), 195097#(<= 2 Main_x), 195102#(<= 7 Main_x), 195103#(<= 8 Main_x), 195100#(<= 5 Main_x), 195101#(<= 6 Main_x), 195106#(<= 11 Main_x), 195107#(<= 12 Main_x), 195104#(<= 9 Main_x), 195105#(<= 10 Main_x), 195110#(<= 15 Main_x), 195111#(<= 16 Main_x), 195108#(<= 13 Main_x), 195109#(<= 14 Main_x), 195114#(<= 19 Main_x), 195115#(<= 20 Main_x), 195112#(<= 17 Main_x), 195113#(<= 18 Main_x), 195118#(<= 23 Main_x), 195119#(<= 24 Main_x), 195116#(<= 21 Main_x), 195117#(<= 22 Main_x), 195122#(<= 27 Main_x), 195123#(<= 28 Main_x), 195120#(<= 25 Main_x), 195121#(<= 26 Main_x), 195126#(<= 31 Main_x), 195127#(<= 32 Main_x), 195124#(<= 29 Main_x), 195125#(<= 30 Main_x), 195130#(<= 35 Main_x), 195131#(<= 36 Main_x), 195128#(<= 33 Main_x), 195129#(<= 34 Main_x), 195134#(<= 39 Main_x), 195135#(<= 40 Main_x), 195132#(<= 37 Main_x), 195133#(<= 38 Main_x), 195138#(<= 43 Main_x), 195139#(<= 44 Main_x), 195136#(<= 41 Main_x), 195137#(<= 42 Main_x), 195142#(<= 47 Main_x), 195143#(<= 48 Main_x), 195140#(<= 45 Main_x), 195141#(<= 46 Main_x), 195146#(<= 51 Main_x), 195147#(<= 52 Main_x), 195144#(<= 49 Main_x), 195145#(<= 50 Main_x), 195150#(<= 55 Main_x), 195151#(<= 56 Main_x), 195148#(<= 53 Main_x), 195149#(<= 54 Main_x), 195154#(<= 59 Main_x), 195155#(<= 60 Main_x), 195152#(<= 57 Main_x), 195153#(<= 58 Main_x), 195158#(<= 63 Main_x), 195159#(<= 64 Main_x), 195156#(<= 61 Main_x), 195157#(<= 62 Main_x), 195162#(<= 67 Main_x), 195163#(<= 68 Main_x), 195160#(<= 65 Main_x), 195161#(<= 66 Main_x), 195166#(<= 71 Main_x), 195167#(<= 72 Main_x), 195164#(<= 69 Main_x), 195165#(<= 70 Main_x), 195170#(<= 75 Main_x), 195171#(<= 76 Main_x), 195168#(<= 73 Main_x), 195169#(<= 74 Main_x), 195174#(<= 79 Main_x), 195175#(<= 80 Main_x), 195172#(<= 77 Main_x), 195173#(<= 78 Main_x), 195178#(<= 83 Main_x), 195179#(<= 84 Main_x), 195176#(<= 81 Main_x), 195177#(<= 82 Main_x), 195182#(<= 87 Main_x), 195183#(<= 88 Main_x), 195180#(<= 85 Main_x), 195181#(<= 86 Main_x), 195186#(<= 91 Main_x), 195187#(<= 92 Main_x), 195184#(<= 89 Main_x), 195185#(<= 90 Main_x), 195190#(<= 95 Main_x), 195191#(<= 96 Main_x), 195188#(<= 93 Main_x), 195189#(<= 94 Main_x), 195194#(<= 99 Main_x), 195195#(<= 100 Main_x), 195192#(<= 97 Main_x), 195193#(<= 98 Main_x), 195198#(<= 103 Main_x), 195199#(<= 104 Main_x), 195196#(<= 101 Main_x), 195197#(<= 102 Main_x), 195202#(<= 107 Main_x), 195203#(<= 108 Main_x), 195200#(<= 105 Main_x), 195201#(<= 106 Main_x), 195204#(<= 109 Main_x)] [2018-07-23 13:59:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 5995 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:33,713 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 13:59:33,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 13:59:33,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:59:33,713 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 112 states. [2018-07-23 13:59:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:33,989 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-07-23 13:59:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 13:59:33,989 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-23 13:59:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:33,989 INFO L225 Difference]: With dead ends: 227 [2018-07-23 13:59:33,990 INFO L226 Difference]: Without dead ends: 224 [2018-07-23 13:59:33,990 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:59:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-23 13:59:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-07-23 13:59:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-07-23 13:59:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 225 transitions. [2018-07-23 13:59:34,208 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 225 transitions. Word has length 222 [2018-07-23 13:59:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:34,209 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 225 transitions. [2018-07-23 13:59:34,209 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 13:59:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 225 transitions. [2018-07-23 13:59:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-07-23 13:59:34,210 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:34,210 INFO L357 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1] [2018-07-23 13:59:34,210 INFO L414 AbstractCegarLoop]: === Iteration 328 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:34,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1709343073, now seen corresponding path program 325 times [2018-07-23 13:59:34,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:34,976 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:34,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 13:59:34,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:34,976 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:59:34,976 INFO L185 omatonBuilderFactory]: Interpolants [196107#true, 196110#(and (<= 1 Main_y) (<= Main_y 1)), 196111#(and (<= Main_y 2) (<= 2 Main_y)), 196108#false, 196109#(and (<= 0 Main_y) (<= Main_y 0)), 196114#(and (<= Main_y 5) (<= 5 Main_y)), 196115#(and (<= Main_y 6) (<= 6 Main_y)), 196112#(and (<= Main_y 3) (<= 3 Main_y)), 196113#(and (<= Main_y 4) (<= 4 Main_y)), 196118#(and (<= Main_y 9) (<= 9 Main_y)), 196119#(and (<= 10 Main_y) (<= Main_y 10)), 196116#(and (<= 7 Main_y) (<= Main_y 7)), 196117#(and (<= 8 Main_y) (<= Main_y 8)), 196122#(and (<= 13 Main_y) (<= Main_y 13)), 196123#(and (<= 14 Main_y) (<= Main_y 14)), 196120#(and (<= 11 Main_y) (<= Main_y 11)), 196121#(and (<= 12 Main_y) (<= Main_y 12)), 196126#(and (<= Main_y 17) (<= 17 Main_y)), 196127#(and (<= Main_y 18) (<= 18 Main_y)), 196124#(and (<= Main_y 15) (<= 15 Main_y)), 196125#(and (<= 16 Main_y) (<= Main_y 16)), 196130#(and (<= 21 Main_y) (<= Main_y 21)), 196131#(and (<= Main_y 22) (<= 22 Main_y)), 196128#(and (<= Main_y 19) (<= 19 Main_y)), 196129#(and (<= 20 Main_y) (<= Main_y 20)), 196134#(and (<= 25 Main_y) (<= Main_y 25)), 196135#(and (<= Main_y 26) (<= 26 Main_y)), 196132#(and (<= 23 Main_y) (<= Main_y 23)), 196133#(and (<= Main_y 24) (<= 24 Main_y)), 196138#(and (<= 29 Main_y) (<= Main_y 29)), 196139#(and (<= 30 Main_y) (<= Main_y 30)), 196136#(and (<= 27 Main_y) (<= Main_y 27)), 196137#(and (<= 28 Main_y) (<= Main_y 28)), 196142#(and (<= 33 Main_y) (<= Main_y 33)), 196143#(and (<= Main_y 34) (<= 34 Main_y)), 196140#(and (<= Main_y 31) (<= 31 Main_y)), 196141#(and (<= 32 Main_y) (<= Main_y 32)), 196146#(and (<= Main_y 37) (<= 37 Main_y)), 196147#(and (<= Main_y 38) (<= 38 Main_y)), 196144#(and (<= 35 Main_y) (<= Main_y 35)), 196145#(and (<= 36 Main_y) (<= Main_y 36)), 196150#(and (<= Main_y 41) (<= 41 Main_y)), 196151#(and (<= 42 Main_y) (<= Main_y 42)), 196148#(and (<= 39 Main_y) (<= Main_y 39)), 196149#(and (<= 40 Main_y) (<= Main_y 40)), 196154#(and (<= Main_y 45) (<= 45 Main_y)), 196155#(and (<= 46 Main_y) (<= Main_y 46)), 196152#(and (<= 43 Main_y) (<= Main_y 43)), 196153#(and (<= 44 Main_y) (<= Main_y 44)), 196158#(and (<= 49 Main_y) (<= Main_y 49)), 196159#(and (<= 50 Main_y) (<= Main_y 50)), 196156#(and (<= 47 Main_y) (<= Main_y 47)), 196157#(and (<= 48 Main_y) (<= Main_y 48)), 196162#(and (<= 53 Main_y) (<= Main_y 53)), 196163#(and (<= 54 Main_y) (<= Main_y 54)), 196160#(and (<= 51 Main_y) (<= Main_y 51)), 196161#(and (<= 52 Main_y) (<= Main_y 52)), 196166#(and (<= Main_y 57) (<= 57 Main_y)), 196167#(and (<= Main_y 58) (<= 58 Main_y)), 196164#(and (<= 55 Main_y) (<= Main_y 55)), 196165#(and (<= Main_y 56) (<= 56 Main_y)), 196170#(and (<= Main_y 61) (<= 61 Main_y)), 196171#(and (<= 62 Main_y) (<= Main_y 62)), 196168#(and (<= Main_y 59) (<= 59 Main_y)), 196169#(and (<= Main_y 60) (<= 60 Main_y)), 196174#(and (<= Main_y 65) (<= 65 Main_y)), 196175#(and (<= Main_y 66) (<= 66 Main_y)), 196172#(and (<= 63 Main_y) (<= Main_y 63)), 196173#(and (<= 64 Main_y) (<= Main_y 64)), 196178#(and (<= Main_y 69) (<= 69 Main_y)), 196179#(and (<= 70 Main_y) (<= Main_y 70)), 196176#(and (<= 67 Main_y) (<= Main_y 67)), 196177#(and (<= 68 Main_y) (<= Main_y 68)), 196182#(and (<= 73 Main_y) (<= Main_y 73)), 196183#(and (<= 74 Main_y) (<= Main_y 74)), 196180#(and (<= Main_y 71) (<= 71 Main_y)), 196181#(and (<= 72 Main_y) (<= Main_y 72)), 196186#(and (<= Main_y 77) (<= 77 Main_y)), 196187#(and (<= Main_y 78) (<= 78 Main_y)), 196184#(and (<= Main_y 75) (<= 75 Main_y)), 196185#(and (<= Main_y 76) (<= 76 Main_y)), 196190#(and (<= 81 Main_y) (<= Main_y 81)), 196191#(and (<= Main_y 82) (<= 82 Main_y)), 196188#(and (<= 79 Main_y) (<= Main_y 79)), 196189#(and (<= Main_y 80) (<= 80 Main_y)), 196194#(and (<= Main_y 85) (<= 85 Main_y)), 196195#(and (<= 86 Main_y) (<= Main_y 86)), 196192#(and (<= Main_y 83) (<= 83 Main_y)), 196193#(and (<= Main_y 84) (<= 84 Main_y)), 196198#(and (<= Main_y 89) (<= 89 Main_y)), 196199#(and (<= Main_y 90) (<= 90 Main_y)), 196196#(and (<= Main_y 87) (<= 87 Main_y)), 196197#(and (<= Main_y 88) (<= 88 Main_y)), 196202#(and (<= 93 Main_y) (<= Main_y 93)), 196203#(and (<= 94 Main_y) (<= Main_y 94)), 196200#(and (<= Main_y 91) (<= 91 Main_y)), 196201#(and (<= 92 Main_y) (<= Main_y 92)), 196206#(and (<= Main_y 97) (<= 97 Main_y)), 196207#(and (<= 98 Main_y) (<= Main_y 98)), 196204#(and (<= Main_y 95) (<= 95 Main_y)), 196205#(and (<= 96 Main_y) (<= Main_y 96)), 196210#(and (<= Main_y 101) (<= 101 Main_y)), 196211#(and (<= 102 Main_y) (<= Main_y 102)), 196208#(and (<= 99 Main_y) (<= Main_y 99)), 196209#(and (<= Main_y 100) (<= 100 Main_y)), 196214#(and (<= 105 Main_y) (<= Main_y 105)), 196215#(and (<= Main_y 106) (<= 106 Main_y)), 196212#(and (<= 103 Main_y) (<= Main_y 103)), 196213#(and (<= 104 Main_y) (<= Main_y 104)), 196218#(and (<= Main_y 109) (<= 109 Main_y)), 196216#(and (<= Main_y 107) (<= 107 Main_y)), 196217#(and (<= Main_y 108) (<= 108 Main_y))] [2018-07-23 13:59:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:34,977 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 13:59:34,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 13:59:34,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:59:34,977 INFO L87 Difference]: Start difference. First operand 224 states and 225 transitions. Second operand 112 states. [2018-07-23 13:59:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:36,755 INFO L93 Difference]: Finished difference Result 338 states and 340 transitions. [2018-07-23 13:59:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 13:59:36,756 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 223 [2018-07-23 13:59:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:36,756 INFO L225 Difference]: With dead ends: 338 [2018-07-23 13:59:36,756 INFO L226 Difference]: Without dead ends: 335 [2018-07-23 13:59:36,756 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:59:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-23 13:59:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 226. [2018-07-23 13:59:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-23 13:59:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 228 transitions. [2018-07-23 13:59:37,008 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 228 transitions. Word has length 223 [2018-07-23 13:59:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:37,008 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 228 transitions. [2018-07-23 13:59:37,008 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 13:59:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 228 transitions. [2018-07-23 13:59:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-23 13:59:37,009 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:37,009 INFO L357 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2018-07-23 13:59:37,009 INFO L414 AbstractCegarLoop]: === Iteration 329 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1449966189, now seen corresponding path program 326 times [2018-07-23 13:59:37,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 6105 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:37,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:37,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 13:59:37,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:37,609 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:59:37,610 INFO L185 omatonBuilderFactory]: Interpolants [197379#(<= Main_x 30), 197378#(<= Main_x 29), 197377#(<= Main_x 28), 197376#(<= Main_x 27), 197383#(<= Main_x 34), 197382#(<= Main_x 33), 197381#(<= Main_x 32), 197380#(<= Main_x 31), 197387#(<= Main_x 38), 197386#(<= Main_x 37), 197385#(<= Main_x 36), 197384#(<= Main_x 35), 197391#(<= Main_x 42), 197390#(<= Main_x 41), 197389#(<= Main_x 40), 197388#(<= Main_x 39), 197395#(<= Main_x 46), 197394#(<= Main_x 45), 197393#(<= Main_x 44), 197392#(<= Main_x 43), 197399#(<= Main_x 50), 197398#(<= Main_x 49), 197397#(<= Main_x 48), 197396#(<= Main_x 47), 197403#(<= Main_x 54), 197402#(<= Main_x 53), 197401#(<= Main_x 52), 197400#(<= Main_x 51), 197407#(<= Main_x 58), 197406#(<= Main_x 57), 197405#(<= Main_x 56), 197404#(<= Main_x 55), 197411#(<= Main_x 62), 197410#(<= Main_x 61), 197409#(<= Main_x 60), 197408#(<= Main_x 59), 197415#(<= Main_x 66), 197414#(<= Main_x 65), 197413#(<= Main_x 64), 197412#(<= Main_x 63), 197419#(<= Main_x 70), 197418#(<= Main_x 69), 197417#(<= Main_x 68), 197416#(<= Main_x 67), 197423#(<= Main_x 74), 197422#(<= Main_x 73), 197421#(<= Main_x 72), 197420#(<= Main_x 71), 197427#(<= Main_x 78), 197426#(<= Main_x 77), 197425#(<= Main_x 76), 197424#(<= Main_x 75), 197431#(<= Main_x 82), 197430#(<= Main_x 81), 197429#(<= Main_x 80), 197428#(<= Main_x 79), 197435#(<= Main_x 86), 197434#(<= Main_x 85), 197433#(<= Main_x 84), 197432#(<= Main_x 83), 197439#(<= Main_x 90), 197438#(<= Main_x 89), 197437#(<= Main_x 88), 197436#(<= Main_x 87), 197443#(<= Main_x 94), 197442#(<= Main_x 93), 197441#(<= Main_x 92), 197440#(<= Main_x 91), 197447#(<= Main_x 98), 197446#(<= Main_x 97), 197445#(<= Main_x 96), 197444#(<= Main_x 95), 197451#(<= Main_x 102), 197450#(<= Main_x 101), 197449#(<= Main_x 100), 197448#(<= Main_x 99), 197455#(<= Main_x 106), 197454#(<= Main_x 105), 197453#(<= Main_x 104), 197452#(<= Main_x 103), 197459#(<= (+ Main_x 1) 0), 197458#(<= Main_x 109), 197457#(<= Main_x 108), 197456#(<= Main_x 107), 197347#true, 197351#(<= Main_x 2), 197350#(<= Main_x 1), 197349#(<= Main_x 0), 197348#false, 197355#(<= Main_x 6), 197354#(<= Main_x 5), 197353#(<= Main_x 4), 197352#(<= Main_x 3), 197359#(<= Main_x 10), 197358#(<= Main_x 9), 197357#(<= Main_x 8), 197356#(<= Main_x 7), 197363#(<= Main_x 14), 197362#(<= Main_x 13), 197361#(<= Main_x 12), 197360#(<= Main_x 11), 197367#(<= Main_x 18), 197366#(<= Main_x 17), 197365#(<= Main_x 16), 197364#(<= Main_x 15), 197371#(<= Main_x 22), 197370#(<= Main_x 21), 197369#(<= Main_x 20), 197368#(<= Main_x 19), 197375#(<= Main_x 26), 197374#(<= Main_x 25), 197373#(<= Main_x 24), 197372#(<= Main_x 23)] [2018-07-23 13:59:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 6105 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:37,610 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 13:59:37,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 13:59:37,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:59:37,611 INFO L87 Difference]: Start difference. First operand 226 states and 228 transitions. Second operand 113 states. [2018-07-23 13:59:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:38,278 INFO L93 Difference]: Finished difference Result 339 states and 341 transitions. [2018-07-23 13:59:38,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 13:59:38,278 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-23 13:59:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:38,279 INFO L225 Difference]: With dead ends: 339 [2018-07-23 13:59:38,279 INFO L226 Difference]: Without dead ends: 225 [2018-07-23 13:59:38,280 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:59:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-23 13:59:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-23 13:59:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 13:59:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-07-23 13:59:38,503 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 224 [2018-07-23 13:59:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:38,504 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-07-23 13:59:38,504 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 13:59:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-07-23 13:59:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-23 13:59:38,504 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:38,504 INFO L357 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2018-07-23 13:59:38,504 INFO L414 AbstractCegarLoop]: === Iteration 330 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:38,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1866953081, now seen corresponding path program 327 times [2018-07-23 13:59:38,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 6105 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:39,055 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:39,055 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 13:59:39,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:39,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:59:39,055 INFO L185 omatonBuilderFactory]: Interpolants [198659#(<= 69 Main_x), 198658#(<= 68 Main_x), 198657#(<= 67 Main_x), 198656#(<= 66 Main_x), 198663#(<= 73 Main_x), 198662#(<= 72 Main_x), 198661#(<= 71 Main_x), 198660#(<= 70 Main_x), 198667#(<= 77 Main_x), 198666#(<= 76 Main_x), 198665#(<= 75 Main_x), 198664#(<= 74 Main_x), 198671#(<= 81 Main_x), 198670#(<= 80 Main_x), 198669#(<= 79 Main_x), 198668#(<= 78 Main_x), 198675#(<= 85 Main_x), 198674#(<= 84 Main_x), 198673#(<= 83 Main_x), 198672#(<= 82 Main_x), 198679#(<= 89 Main_x), 198678#(<= 88 Main_x), 198677#(<= 87 Main_x), 198676#(<= 86 Main_x), 198683#(<= 93 Main_x), 198682#(<= 92 Main_x), 198681#(<= 91 Main_x), 198680#(<= 90 Main_x), 198687#(<= 97 Main_x), 198686#(<= 96 Main_x), 198685#(<= 95 Main_x), 198684#(<= 94 Main_x), 198691#(<= 101 Main_x), 198690#(<= 100 Main_x), 198689#(<= 99 Main_x), 198688#(<= 98 Main_x), 198695#(<= 105 Main_x), 198694#(<= 104 Main_x), 198693#(<= 103 Main_x), 198692#(<= 102 Main_x), 198699#(<= 109 Main_x), 198698#(<= 108 Main_x), 198697#(<= 107 Main_x), 198696#(<= 106 Main_x), 198700#(<= 110 Main_x), 198591#(<= 1 Main_x), 198590#(<= 0 Main_x), 198589#false, 198588#true, 198595#(<= 5 Main_x), 198594#(<= 4 Main_x), 198593#(<= 3 Main_x), 198592#(<= 2 Main_x), 198599#(<= 9 Main_x), 198598#(<= 8 Main_x), 198597#(<= 7 Main_x), 198596#(<= 6 Main_x), 198603#(<= 13 Main_x), 198602#(<= 12 Main_x), 198601#(<= 11 Main_x), 198600#(<= 10 Main_x), 198607#(<= 17 Main_x), 198606#(<= 16 Main_x), 198605#(<= 15 Main_x), 198604#(<= 14 Main_x), 198611#(<= 21 Main_x), 198610#(<= 20 Main_x), 198609#(<= 19 Main_x), 198608#(<= 18 Main_x), 198615#(<= 25 Main_x), 198614#(<= 24 Main_x), 198613#(<= 23 Main_x), 198612#(<= 22 Main_x), 198619#(<= 29 Main_x), 198618#(<= 28 Main_x), 198617#(<= 27 Main_x), 198616#(<= 26 Main_x), 198623#(<= 33 Main_x), 198622#(<= 32 Main_x), 198621#(<= 31 Main_x), 198620#(<= 30 Main_x), 198627#(<= 37 Main_x), 198626#(<= 36 Main_x), 198625#(<= 35 Main_x), 198624#(<= 34 Main_x), 198631#(<= 41 Main_x), 198630#(<= 40 Main_x), 198629#(<= 39 Main_x), 198628#(<= 38 Main_x), 198635#(<= 45 Main_x), 198634#(<= 44 Main_x), 198633#(<= 43 Main_x), 198632#(<= 42 Main_x), 198639#(<= 49 Main_x), 198638#(<= 48 Main_x), 198637#(<= 47 Main_x), 198636#(<= 46 Main_x), 198643#(<= 53 Main_x), 198642#(<= 52 Main_x), 198641#(<= 51 Main_x), 198640#(<= 50 Main_x), 198647#(<= 57 Main_x), 198646#(<= 56 Main_x), 198645#(<= 55 Main_x), 198644#(<= 54 Main_x), 198651#(<= 61 Main_x), 198650#(<= 60 Main_x), 198649#(<= 59 Main_x), 198648#(<= 58 Main_x), 198655#(<= 65 Main_x), 198654#(<= 64 Main_x), 198653#(<= 63 Main_x), 198652#(<= 62 Main_x)] [2018-07-23 13:59:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 6105 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:39,056 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 13:59:39,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 13:59:39,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:59:39,057 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 113 states. [2018-07-23 13:59:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:39,396 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-07-23 13:59:39,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 13:59:39,396 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-23 13:59:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:39,397 INFO L225 Difference]: With dead ends: 229 [2018-07-23 13:59:39,397 INFO L226 Difference]: Without dead ends: 226 [2018-07-23 13:59:39,397 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:59:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-23 13:59:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-07-23 13:59:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-23 13:59:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 227 transitions. [2018-07-23 13:59:39,618 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 227 transitions. Word has length 224 [2018-07-23 13:59:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:39,619 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 227 transitions. [2018-07-23 13:59:39,619 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 13:59:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 227 transitions. [2018-07-23 13:59:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-23 13:59:39,619 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:39,619 INFO L357 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1] [2018-07-23 13:59:39,619 INFO L414 AbstractCegarLoop]: === Iteration 331 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:39,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2041032185, now seen corresponding path program 328 times [2018-07-23 13:59:39,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:40,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:40,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 13:59:40,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:40,393 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:59:40,393 INFO L185 omatonBuilderFactory]: Interpolants [199683#(and (<= 70 Main_y) (<= Main_y 70)), 199682#(and (<= Main_y 69) (<= 69 Main_y)), 199681#(and (<= 68 Main_y) (<= Main_y 68)), 199680#(and (<= 67 Main_y) (<= Main_y 67)), 199687#(and (<= 74 Main_y) (<= Main_y 74)), 199686#(and (<= 73 Main_y) (<= Main_y 73)), 199685#(and (<= 72 Main_y) (<= Main_y 72)), 199684#(and (<= Main_y 71) (<= 71 Main_y)), 199691#(and (<= Main_y 78) (<= 78 Main_y)), 199690#(and (<= Main_y 77) (<= 77 Main_y)), 199689#(and (<= Main_y 76) (<= 76 Main_y)), 199688#(and (<= Main_y 75) (<= 75 Main_y)), 199695#(and (<= Main_y 82) (<= 82 Main_y)), 199694#(and (<= 81 Main_y) (<= Main_y 81)), 199693#(and (<= Main_y 80) (<= 80 Main_y)), 199692#(and (<= 79 Main_y) (<= Main_y 79)), 199699#(and (<= 86 Main_y) (<= Main_y 86)), 199698#(and (<= Main_y 85) (<= 85 Main_y)), 199697#(and (<= Main_y 84) (<= 84 Main_y)), 199696#(and (<= Main_y 83) (<= 83 Main_y)), 199703#(and (<= Main_y 90) (<= 90 Main_y)), 199702#(and (<= Main_y 89) (<= 89 Main_y)), 199701#(and (<= Main_y 88) (<= 88 Main_y)), 199700#(and (<= Main_y 87) (<= 87 Main_y)), 199707#(and (<= 94 Main_y) (<= Main_y 94)), 199706#(and (<= 93 Main_y) (<= Main_y 93)), 199705#(and (<= 92 Main_y) (<= Main_y 92)), 199704#(and (<= Main_y 91) (<= 91 Main_y)), 199711#(and (<= 98 Main_y) (<= Main_y 98)), 199710#(and (<= Main_y 97) (<= 97 Main_y)), 199709#(and (<= 96 Main_y) (<= Main_y 96)), 199708#(and (<= Main_y 95) (<= 95 Main_y)), 199715#(and (<= 102 Main_y) (<= Main_y 102)), 199714#(and (<= Main_y 101) (<= 101 Main_y)), 199713#(and (<= Main_y 100) (<= 100 Main_y)), 199712#(and (<= 99 Main_y) (<= Main_y 99)), 199719#(and (<= Main_y 106) (<= 106 Main_y)), 199718#(and (<= 105 Main_y) (<= Main_y 105)), 199717#(and (<= 104 Main_y) (<= Main_y 104)), 199716#(and (<= 103 Main_y) (<= Main_y 103)), 199723#(and (<= Main_y 110) (<= 110 Main_y)), 199722#(and (<= Main_y 109) (<= 109 Main_y)), 199721#(and (<= Main_y 108) (<= 108 Main_y)), 199720#(and (<= Main_y 107) (<= 107 Main_y)), 199611#true, 199615#(and (<= Main_y 2) (<= 2 Main_y)), 199614#(and (<= 1 Main_y) (<= Main_y 1)), 199613#(and (<= 0 Main_y) (<= Main_y 0)), 199612#false, 199619#(and (<= Main_y 6) (<= 6 Main_y)), 199618#(and (<= Main_y 5) (<= 5 Main_y)), 199617#(and (<= Main_y 4) (<= 4 Main_y)), 199616#(and (<= Main_y 3) (<= 3 Main_y)), 199623#(and (<= 10 Main_y) (<= Main_y 10)), 199622#(and (<= Main_y 9) (<= 9 Main_y)), 199621#(and (<= 8 Main_y) (<= Main_y 8)), 199620#(and (<= 7 Main_y) (<= Main_y 7)), 199627#(and (<= 14 Main_y) (<= Main_y 14)), 199626#(and (<= 13 Main_y) (<= Main_y 13)), 199625#(and (<= 12 Main_y) (<= Main_y 12)), 199624#(and (<= 11 Main_y) (<= Main_y 11)), 199631#(and (<= Main_y 18) (<= 18 Main_y)), 199630#(and (<= Main_y 17) (<= 17 Main_y)), 199629#(and (<= 16 Main_y) (<= Main_y 16)), 199628#(and (<= Main_y 15) (<= 15 Main_y)), 199635#(and (<= Main_y 22) (<= 22 Main_y)), 199634#(and (<= 21 Main_y) (<= Main_y 21)), 199633#(and (<= 20 Main_y) (<= Main_y 20)), 199632#(and (<= Main_y 19) (<= 19 Main_y)), 199639#(and (<= Main_y 26) (<= 26 Main_y)), 199638#(and (<= 25 Main_y) (<= Main_y 25)), 199637#(and (<= Main_y 24) (<= 24 Main_y)), 199636#(and (<= 23 Main_y) (<= Main_y 23)), 199643#(and (<= 30 Main_y) (<= Main_y 30)), 199642#(and (<= 29 Main_y) (<= Main_y 29)), 199641#(and (<= 28 Main_y) (<= Main_y 28)), 199640#(and (<= 27 Main_y) (<= Main_y 27)), 199647#(and (<= Main_y 34) (<= 34 Main_y)), 199646#(and (<= 33 Main_y) (<= Main_y 33)), 199645#(and (<= 32 Main_y) (<= Main_y 32)), 199644#(and (<= Main_y 31) (<= 31 Main_y)), 199651#(and (<= Main_y 38) (<= 38 Main_y)), 199650#(and (<= Main_y 37) (<= 37 Main_y)), 199649#(and (<= 36 Main_y) (<= Main_y 36)), 199648#(and (<= 35 Main_y) (<= Main_y 35)), 199655#(and (<= 42 Main_y) (<= Main_y 42)), 199654#(and (<= Main_y 41) (<= 41 Main_y)), 199653#(and (<= 40 Main_y) (<= Main_y 40)), 199652#(and (<= 39 Main_y) (<= Main_y 39)), 199659#(and (<= 46 Main_y) (<= Main_y 46)), 199658#(and (<= Main_y 45) (<= 45 Main_y)), 199657#(and (<= 44 Main_y) (<= Main_y 44)), 199656#(and (<= 43 Main_y) (<= Main_y 43)), 199663#(and (<= 50 Main_y) (<= Main_y 50)), 199662#(and (<= 49 Main_y) (<= Main_y 49)), 199661#(and (<= 48 Main_y) (<= Main_y 48)), 199660#(and (<= 47 Main_y) (<= Main_y 47)), 199667#(and (<= 54 Main_y) (<= Main_y 54)), 199666#(and (<= 53 Main_y) (<= Main_y 53)), 199665#(and (<= 52 Main_y) (<= Main_y 52)), 199664#(and (<= 51 Main_y) (<= Main_y 51)), 199671#(and (<= Main_y 58) (<= 58 Main_y)), 199670#(and (<= Main_y 57) (<= 57 Main_y)), 199669#(and (<= Main_y 56) (<= 56 Main_y)), 199668#(and (<= 55 Main_y) (<= Main_y 55)), 199675#(and (<= 62 Main_y) (<= Main_y 62)), 199674#(and (<= Main_y 61) (<= 61 Main_y)), 199673#(and (<= Main_y 60) (<= 60 Main_y)), 199672#(and (<= Main_y 59) (<= 59 Main_y)), 199679#(and (<= Main_y 66) (<= 66 Main_y)), 199678#(and (<= Main_y 65) (<= 65 Main_y)), 199677#(and (<= 64 Main_y) (<= Main_y 64)), 199676#(and (<= 63 Main_y) (<= Main_y 63))] [2018-07-23 13:59:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:40,394 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 13:59:40,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 13:59:40,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:59:40,395 INFO L87 Difference]: Start difference. First operand 226 states and 227 transitions. Second operand 113 states. [2018-07-23 13:59:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:42,067 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2018-07-23 13:59:42,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 13:59:42,067 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 225 [2018-07-23 13:59:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:42,067 INFO L225 Difference]: With dead ends: 341 [2018-07-23 13:59:42,068 INFO L226 Difference]: Without dead ends: 338 [2018-07-23 13:59:42,068 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:59:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-07-23 13:59:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 228. [2018-07-23 13:59:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-07-23 13:59:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 230 transitions. [2018-07-23 13:59:42,326 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 230 transitions. Word has length 225 [2018-07-23 13:59:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:42,326 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 230 transitions. [2018-07-23 13:59:42,326 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 13:59:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 230 transitions. [2018-07-23 13:59:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-23 13:59:42,327 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:42,327 INFO L357 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2018-07-23 13:59:42,327 INFO L414 AbstractCegarLoop]: === Iteration 332 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1152450183, now seen corresponding path program 329 times [2018-07-23 13:59:42,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:42,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:42,939 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 13:59:42,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:42,939 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:59:42,939 INFO L185 omatonBuilderFactory]: Interpolants [200963#(<= Main_x 99), 200962#(<= Main_x 98), 200961#(<= Main_x 97), 200960#(<= Main_x 96), 200967#(<= Main_x 103), 200966#(<= Main_x 102), 200965#(<= Main_x 101), 200964#(<= Main_x 100), 200971#(<= Main_x 107), 200970#(<= Main_x 106), 200969#(<= Main_x 105), 200968#(<= Main_x 104), 200975#(<= (+ Main_x 1) 0), 200974#(<= Main_x 110), 200973#(<= Main_x 109), 200972#(<= Main_x 108), 200863#false, 200862#true, 200867#(<= Main_x 3), 200866#(<= Main_x 2), 200865#(<= Main_x 1), 200864#(<= Main_x 0), 200871#(<= Main_x 7), 200870#(<= Main_x 6), 200869#(<= Main_x 5), 200868#(<= Main_x 4), 200875#(<= Main_x 11), 200874#(<= Main_x 10), 200873#(<= Main_x 9), 200872#(<= Main_x 8), 200879#(<= Main_x 15), 200878#(<= Main_x 14), 200877#(<= Main_x 13), 200876#(<= Main_x 12), 200883#(<= Main_x 19), 200882#(<= Main_x 18), 200881#(<= Main_x 17), 200880#(<= Main_x 16), 200887#(<= Main_x 23), 200886#(<= Main_x 22), 200885#(<= Main_x 21), 200884#(<= Main_x 20), 200891#(<= Main_x 27), 200890#(<= Main_x 26), 200889#(<= Main_x 25), 200888#(<= Main_x 24), 200895#(<= Main_x 31), 200894#(<= Main_x 30), 200893#(<= Main_x 29), 200892#(<= Main_x 28), 200899#(<= Main_x 35), 200898#(<= Main_x 34), 200897#(<= Main_x 33), 200896#(<= Main_x 32), 200903#(<= Main_x 39), 200902#(<= Main_x 38), 200901#(<= Main_x 37), 200900#(<= Main_x 36), 200907#(<= Main_x 43), 200906#(<= Main_x 42), 200905#(<= Main_x 41), 200904#(<= Main_x 40), 200911#(<= Main_x 47), 200910#(<= Main_x 46), 200909#(<= Main_x 45), 200908#(<= Main_x 44), 200915#(<= Main_x 51), 200914#(<= Main_x 50), 200913#(<= Main_x 49), 200912#(<= Main_x 48), 200919#(<= Main_x 55), 200918#(<= Main_x 54), 200917#(<= Main_x 53), 200916#(<= Main_x 52), 200923#(<= Main_x 59), 200922#(<= Main_x 58), 200921#(<= Main_x 57), 200920#(<= Main_x 56), 200927#(<= Main_x 63), 200926#(<= Main_x 62), 200925#(<= Main_x 61), 200924#(<= Main_x 60), 200931#(<= Main_x 67), 200930#(<= Main_x 66), 200929#(<= Main_x 65), 200928#(<= Main_x 64), 200935#(<= Main_x 71), 200934#(<= Main_x 70), 200933#(<= Main_x 69), 200932#(<= Main_x 68), 200939#(<= Main_x 75), 200938#(<= Main_x 74), 200937#(<= Main_x 73), 200936#(<= Main_x 72), 200943#(<= Main_x 79), 200942#(<= Main_x 78), 200941#(<= Main_x 77), 200940#(<= Main_x 76), 200947#(<= Main_x 83), 200946#(<= Main_x 82), 200945#(<= Main_x 81), 200944#(<= Main_x 80), 200951#(<= Main_x 87), 200950#(<= Main_x 86), 200949#(<= Main_x 85), 200948#(<= Main_x 84), 200955#(<= Main_x 91), 200954#(<= Main_x 90), 200953#(<= Main_x 89), 200952#(<= Main_x 88), 200959#(<= Main_x 95), 200958#(<= Main_x 94), 200957#(<= Main_x 93), 200956#(<= Main_x 92)] [2018-07-23 13:59:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:42,940 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 13:59:42,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 13:59:42,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:59:42,941 INFO L87 Difference]: Start difference. First operand 228 states and 230 transitions. Second operand 114 states. [2018-07-23 13:59:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:43,561 INFO L93 Difference]: Finished difference Result 342 states and 344 transitions. [2018-07-23 13:59:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 13:59:43,561 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-23 13:59:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:43,562 INFO L225 Difference]: With dead ends: 342 [2018-07-23 13:59:43,562 INFO L226 Difference]: Without dead ends: 227 [2018-07-23 13:59:43,562 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:59:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-23 13:59:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-23 13:59:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-23 13:59:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-07-23 13:59:43,785 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 226 [2018-07-23 13:59:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:43,785 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-07-23 13:59:43,785 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 13:59:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-07-23 13:59:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-23 13:59:43,786 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:43,786 INFO L357 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2018-07-23 13:59:43,786 INFO L414 AbstractCegarLoop]: === Iteration 333 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1407167917, now seen corresponding path program 330 times [2018-07-23 13:59:43,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:44,322 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:44,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 13:59:44,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:44,323 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:59:44,323 INFO L185 omatonBuilderFactory]: Interpolants [202115#false, 202114#true, 202119#(<= 3 Main_x), 202118#(<= 2 Main_x), 202117#(<= 1 Main_x), 202116#(<= 0 Main_x), 202123#(<= 7 Main_x), 202122#(<= 6 Main_x), 202121#(<= 5 Main_x), 202120#(<= 4 Main_x), 202127#(<= 11 Main_x), 202126#(<= 10 Main_x), 202125#(<= 9 Main_x), 202124#(<= 8 Main_x), 202131#(<= 15 Main_x), 202130#(<= 14 Main_x), 202129#(<= 13 Main_x), 202128#(<= 12 Main_x), 202135#(<= 19 Main_x), 202134#(<= 18 Main_x), 202133#(<= 17 Main_x), 202132#(<= 16 Main_x), 202139#(<= 23 Main_x), 202138#(<= 22 Main_x), 202137#(<= 21 Main_x), 202136#(<= 20 Main_x), 202143#(<= 27 Main_x), 202142#(<= 26 Main_x), 202141#(<= 25 Main_x), 202140#(<= 24 Main_x), 202147#(<= 31 Main_x), 202146#(<= 30 Main_x), 202145#(<= 29 Main_x), 202144#(<= 28 Main_x), 202151#(<= 35 Main_x), 202150#(<= 34 Main_x), 202149#(<= 33 Main_x), 202148#(<= 32 Main_x), 202155#(<= 39 Main_x), 202154#(<= 38 Main_x), 202153#(<= 37 Main_x), 202152#(<= 36 Main_x), 202159#(<= 43 Main_x), 202158#(<= 42 Main_x), 202157#(<= 41 Main_x), 202156#(<= 40 Main_x), 202163#(<= 47 Main_x), 202162#(<= 46 Main_x), 202161#(<= 45 Main_x), 202160#(<= 44 Main_x), 202167#(<= 51 Main_x), 202166#(<= 50 Main_x), 202165#(<= 49 Main_x), 202164#(<= 48 Main_x), 202171#(<= 55 Main_x), 202170#(<= 54 Main_x), 202169#(<= 53 Main_x), 202168#(<= 52 Main_x), 202175#(<= 59 Main_x), 202174#(<= 58 Main_x), 202173#(<= 57 Main_x), 202172#(<= 56 Main_x), 202179#(<= 63 Main_x), 202178#(<= 62 Main_x), 202177#(<= 61 Main_x), 202176#(<= 60 Main_x), 202183#(<= 67 Main_x), 202182#(<= 66 Main_x), 202181#(<= 65 Main_x), 202180#(<= 64 Main_x), 202187#(<= 71 Main_x), 202186#(<= 70 Main_x), 202185#(<= 69 Main_x), 202184#(<= 68 Main_x), 202191#(<= 75 Main_x), 202190#(<= 74 Main_x), 202189#(<= 73 Main_x), 202188#(<= 72 Main_x), 202195#(<= 79 Main_x), 202194#(<= 78 Main_x), 202193#(<= 77 Main_x), 202192#(<= 76 Main_x), 202199#(<= 83 Main_x), 202198#(<= 82 Main_x), 202197#(<= 81 Main_x), 202196#(<= 80 Main_x), 202203#(<= 87 Main_x), 202202#(<= 86 Main_x), 202201#(<= 85 Main_x), 202200#(<= 84 Main_x), 202207#(<= 91 Main_x), 202206#(<= 90 Main_x), 202205#(<= 89 Main_x), 202204#(<= 88 Main_x), 202211#(<= 95 Main_x), 202210#(<= 94 Main_x), 202209#(<= 93 Main_x), 202208#(<= 92 Main_x), 202215#(<= 99 Main_x), 202214#(<= 98 Main_x), 202213#(<= 97 Main_x), 202212#(<= 96 Main_x), 202219#(<= 103 Main_x), 202218#(<= 102 Main_x), 202217#(<= 101 Main_x), 202216#(<= 100 Main_x), 202223#(<= 107 Main_x), 202222#(<= 106 Main_x), 202221#(<= 105 Main_x), 202220#(<= 104 Main_x), 202227#(<= 111 Main_x), 202226#(<= 110 Main_x), 202225#(<= 109 Main_x), 202224#(<= 108 Main_x)] [2018-07-23 13:59:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 6216 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:44,324 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 13:59:44,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 13:59:44,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:59:44,325 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 114 states. [2018-07-23 13:59:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:44,616 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2018-07-23 13:59:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 13:59:44,617 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-23 13:59:44,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:44,617 INFO L225 Difference]: With dead ends: 231 [2018-07-23 13:59:44,617 INFO L226 Difference]: Without dead ends: 228 [2018-07-23 13:59:44,618 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:59:44,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-07-23 13:59:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-07-23 13:59:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-07-23 13:59:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 229 transitions. [2018-07-23 13:59:44,869 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 229 transitions. Word has length 226 [2018-07-23 13:59:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 229 transitions. [2018-07-23 13:59:44,869 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 13:59:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 229 transitions. [2018-07-23 13:59:44,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-07-23 13:59:44,870 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:44,870 INFO L357 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1] [2018-07-23 13:59:44,870 INFO L414 AbstractCegarLoop]: === Iteration 334 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:44,870 INFO L82 PathProgramCache]: Analyzing trace with hash 672470945, now seen corresponding path program 331 times [2018-07-23 13:59:44,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:45,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:45,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:45,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 13:59:45,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:45,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:59:45,653 INFO L185 omatonBuilderFactory]: Interpolants [203147#false, 203146#true, 203151#(and (<= Main_y 3) (<= 3 Main_y)), 203150#(and (<= Main_y 2) (<= 2 Main_y)), 203149#(and (<= 1 Main_y) (<= Main_y 1)), 203148#(and (<= 0 Main_y) (<= Main_y 0)), 203155#(and (<= 7 Main_y) (<= Main_y 7)), 203154#(and (<= Main_y 6) (<= 6 Main_y)), 203153#(and (<= Main_y 5) (<= 5 Main_y)), 203152#(and (<= Main_y 4) (<= 4 Main_y)), 203159#(and (<= 11 Main_y) (<= Main_y 11)), 203158#(and (<= 10 Main_y) (<= Main_y 10)), 203157#(and (<= Main_y 9) (<= 9 Main_y)), 203156#(and (<= 8 Main_y) (<= Main_y 8)), 203163#(and (<= Main_y 15) (<= 15 Main_y)), 203162#(and (<= 14 Main_y) (<= Main_y 14)), 203161#(and (<= 13 Main_y) (<= Main_y 13)), 203160#(and (<= 12 Main_y) (<= Main_y 12)), 203167#(and (<= Main_y 19) (<= 19 Main_y)), 203166#(and (<= Main_y 18) (<= 18 Main_y)), 203165#(and (<= Main_y 17) (<= 17 Main_y)), 203164#(and (<= 16 Main_y) (<= Main_y 16)), 203171#(and (<= 23 Main_y) (<= Main_y 23)), 203170#(and (<= Main_y 22) (<= 22 Main_y)), 203169#(and (<= 21 Main_y) (<= Main_y 21)), 203168#(and (<= 20 Main_y) (<= Main_y 20)), 203175#(and (<= 27 Main_y) (<= Main_y 27)), 203174#(and (<= Main_y 26) (<= 26 Main_y)), 203173#(and (<= 25 Main_y) (<= Main_y 25)), 203172#(and (<= Main_y 24) (<= 24 Main_y)), 203179#(and (<= Main_y 31) (<= 31 Main_y)), 203178#(and (<= 30 Main_y) (<= Main_y 30)), 203177#(and (<= 29 Main_y) (<= Main_y 29)), 203176#(and (<= 28 Main_y) (<= Main_y 28)), 203183#(and (<= 35 Main_y) (<= Main_y 35)), 203182#(and (<= Main_y 34) (<= 34 Main_y)), 203181#(and (<= 33 Main_y) (<= Main_y 33)), 203180#(and (<= 32 Main_y) (<= Main_y 32)), 203187#(and (<= 39 Main_y) (<= Main_y 39)), 203186#(and (<= Main_y 38) (<= 38 Main_y)), 203185#(and (<= Main_y 37) (<= 37 Main_y)), 203184#(and (<= 36 Main_y) (<= Main_y 36)), 203191#(and (<= 43 Main_y) (<= Main_y 43)), 203190#(and (<= 42 Main_y) (<= Main_y 42)), 203189#(and (<= Main_y 41) (<= 41 Main_y)), 203188#(and (<= 40 Main_y) (<= Main_y 40)), 203195#(and (<= 47 Main_y) (<= Main_y 47)), 203194#(and (<= 46 Main_y) (<= Main_y 46)), 203193#(and (<= Main_y 45) (<= 45 Main_y)), 203192#(and (<= 44 Main_y) (<= Main_y 44)), 203199#(and (<= 51 Main_y) (<= Main_y 51)), 203198#(and (<= 50 Main_y) (<= Main_y 50)), 203197#(and (<= 49 Main_y) (<= Main_y 49)), 203196#(and (<= 48 Main_y) (<= Main_y 48)), 203203#(and (<= 55 Main_y) (<= Main_y 55)), 203202#(and (<= 54 Main_y) (<= Main_y 54)), 203201#(and (<= 53 Main_y) (<= Main_y 53)), 203200#(and (<= 52 Main_y) (<= Main_y 52)), 203207#(and (<= Main_y 59) (<= 59 Main_y)), 203206#(and (<= Main_y 58) (<= 58 Main_y)), 203205#(and (<= Main_y 57) (<= 57 Main_y)), 203204#(and (<= Main_y 56) (<= 56 Main_y)), 203211#(and (<= 63 Main_y) (<= Main_y 63)), 203210#(and (<= 62 Main_y) (<= Main_y 62)), 203209#(and (<= Main_y 61) (<= 61 Main_y)), 203208#(and (<= Main_y 60) (<= 60 Main_y)), 203215#(and (<= 67 Main_y) (<= Main_y 67)), 203214#(and (<= Main_y 66) (<= 66 Main_y)), 203213#(and (<= Main_y 65) (<= 65 Main_y)), 203212#(and (<= 64 Main_y) (<= Main_y 64)), 203219#(and (<= Main_y 71) (<= 71 Main_y)), 203218#(and (<= 70 Main_y) (<= Main_y 70)), 203217#(and (<= Main_y 69) (<= 69 Main_y)), 203216#(and (<= 68 Main_y) (<= Main_y 68)), 203223#(and (<= Main_y 75) (<= 75 Main_y)), 203222#(and (<= 74 Main_y) (<= Main_y 74)), 203221#(and (<= 73 Main_y) (<= Main_y 73)), 203220#(and (<= 72 Main_y) (<= Main_y 72)), 203227#(and (<= 79 Main_y) (<= Main_y 79)), 203226#(and (<= Main_y 78) (<= 78 Main_y)), 203225#(and (<= Main_y 77) (<= 77 Main_y)), 203224#(and (<= Main_y 76) (<= 76 Main_y)), 203231#(and (<= Main_y 83) (<= 83 Main_y)), 203230#(and (<= Main_y 82) (<= 82 Main_y)), 203229#(and (<= 81 Main_y) (<= Main_y 81)), 203228#(and (<= Main_y 80) (<= 80 Main_y)), 203235#(and (<= Main_y 87) (<= 87 Main_y)), 203234#(and (<= 86 Main_y) (<= Main_y 86)), 203233#(and (<= Main_y 85) (<= 85 Main_y)), 203232#(and (<= Main_y 84) (<= 84 Main_y)), 203239#(and (<= Main_y 91) (<= 91 Main_y)), 203238#(and (<= Main_y 90) (<= 90 Main_y)), 203237#(and (<= Main_y 89) (<= 89 Main_y)), 203236#(and (<= Main_y 88) (<= 88 Main_y)), 203243#(and (<= Main_y 95) (<= 95 Main_y)), 203242#(and (<= 94 Main_y) (<= Main_y 94)), 203241#(and (<= 93 Main_y) (<= Main_y 93)), 203240#(and (<= 92 Main_y) (<= Main_y 92)), 203247#(and (<= 99 Main_y) (<= Main_y 99)), 203246#(and (<= 98 Main_y) (<= Main_y 98)), 203245#(and (<= Main_y 97) (<= 97 Main_y)), 203244#(and (<= 96 Main_y) (<= Main_y 96)), 203251#(and (<= 103 Main_y) (<= Main_y 103)), 203250#(and (<= 102 Main_y) (<= Main_y 102)), 203249#(and (<= Main_y 101) (<= 101 Main_y)), 203248#(and (<= Main_y 100) (<= 100 Main_y)), 203255#(and (<= Main_y 107) (<= 107 Main_y)), 203254#(and (<= Main_y 106) (<= 106 Main_y)), 203253#(and (<= 105 Main_y) (<= Main_y 105)), 203252#(and (<= 104 Main_y) (<= Main_y 104)), 203259#(and (<= Main_y 111) (<= 111 Main_y)), 203258#(and (<= Main_y 110) (<= 110 Main_y)), 203257#(and (<= Main_y 109) (<= 109 Main_y)), 203256#(and (<= Main_y 108) (<= 108 Main_y))] [2018-07-23 13:59:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:45,654 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 13:59:45,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 13:59:45,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:59:45,655 INFO L87 Difference]: Start difference. First operand 228 states and 229 transitions. Second operand 114 states. [2018-07-23 13:59:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:47,488 INFO L93 Difference]: Finished difference Result 344 states and 346 transitions. [2018-07-23 13:59:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 13:59:47,488 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 227 [2018-07-23 13:59:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:47,489 INFO L225 Difference]: With dead ends: 344 [2018-07-23 13:59:47,489 INFO L226 Difference]: Without dead ends: 341 [2018-07-23 13:59:47,490 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:59:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-07-23 13:59:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 230. [2018-07-23 13:59:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-23 13:59:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2018-07-23 13:59:47,751 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 227 [2018-07-23 13:59:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:47,752 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2018-07-23 13:59:47,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 13:59:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2018-07-23 13:59:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-23 13:59:47,752 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:47,752 INFO L357 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2018-07-23 13:59:47,752 INFO L414 AbstractCegarLoop]: === Iteration 335 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:47,753 INFO L82 PathProgramCache]: Analyzing trace with hash -628298707, now seen corresponding path program 332 times [2018-07-23 13:59:47,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 6328 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:48,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:48,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 13:59:48,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:48,419 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:59:48,419 INFO L185 omatonBuilderFactory]: Interpolants [204411#(<= Main_x 1), 204410#(<= Main_x 0), 204409#false, 204408#true, 204415#(<= Main_x 5), 204414#(<= Main_x 4), 204413#(<= Main_x 3), 204412#(<= Main_x 2), 204419#(<= Main_x 9), 204418#(<= Main_x 8), 204417#(<= Main_x 7), 204416#(<= Main_x 6), 204423#(<= Main_x 13), 204422#(<= Main_x 12), 204421#(<= Main_x 11), 204420#(<= Main_x 10), 204427#(<= Main_x 17), 204426#(<= Main_x 16), 204425#(<= Main_x 15), 204424#(<= Main_x 14), 204431#(<= Main_x 21), 204430#(<= Main_x 20), 204429#(<= Main_x 19), 204428#(<= Main_x 18), 204435#(<= Main_x 25), 204434#(<= Main_x 24), 204433#(<= Main_x 23), 204432#(<= Main_x 22), 204439#(<= Main_x 29), 204438#(<= Main_x 28), 204437#(<= Main_x 27), 204436#(<= Main_x 26), 204443#(<= Main_x 33), 204442#(<= Main_x 32), 204441#(<= Main_x 31), 204440#(<= Main_x 30), 204447#(<= Main_x 37), 204446#(<= Main_x 36), 204445#(<= Main_x 35), 204444#(<= Main_x 34), 204451#(<= Main_x 41), 204450#(<= Main_x 40), 204449#(<= Main_x 39), 204448#(<= Main_x 38), 204455#(<= Main_x 45), 204454#(<= Main_x 44), 204453#(<= Main_x 43), 204452#(<= Main_x 42), 204459#(<= Main_x 49), 204458#(<= Main_x 48), 204457#(<= Main_x 47), 204456#(<= Main_x 46), 204463#(<= Main_x 53), 204462#(<= Main_x 52), 204461#(<= Main_x 51), 204460#(<= Main_x 50), 204467#(<= Main_x 57), 204466#(<= Main_x 56), 204465#(<= Main_x 55), 204464#(<= Main_x 54), 204471#(<= Main_x 61), 204470#(<= Main_x 60), 204469#(<= Main_x 59), 204468#(<= Main_x 58), 204475#(<= Main_x 65), 204474#(<= Main_x 64), 204473#(<= Main_x 63), 204472#(<= Main_x 62), 204479#(<= Main_x 69), 204478#(<= Main_x 68), 204477#(<= Main_x 67), 204476#(<= Main_x 66), 204483#(<= Main_x 73), 204482#(<= Main_x 72), 204481#(<= Main_x 71), 204480#(<= Main_x 70), 204487#(<= Main_x 77), 204486#(<= Main_x 76), 204485#(<= Main_x 75), 204484#(<= Main_x 74), 204491#(<= Main_x 81), 204490#(<= Main_x 80), 204489#(<= Main_x 79), 204488#(<= Main_x 78), 204495#(<= Main_x 85), 204494#(<= Main_x 84), 204493#(<= Main_x 83), 204492#(<= Main_x 82), 204499#(<= Main_x 89), 204498#(<= Main_x 88), 204497#(<= Main_x 87), 204496#(<= Main_x 86), 204503#(<= Main_x 93), 204502#(<= Main_x 92), 204501#(<= Main_x 91), 204500#(<= Main_x 90), 204507#(<= Main_x 97), 204506#(<= Main_x 96), 204505#(<= Main_x 95), 204504#(<= Main_x 94), 204511#(<= Main_x 101), 204510#(<= Main_x 100), 204509#(<= Main_x 99), 204508#(<= Main_x 98), 204515#(<= Main_x 105), 204514#(<= Main_x 104), 204513#(<= Main_x 103), 204512#(<= Main_x 102), 204519#(<= Main_x 109), 204518#(<= Main_x 108), 204517#(<= Main_x 107), 204516#(<= Main_x 106), 204522#(<= (+ Main_x 1) 0), 204521#(<= Main_x 111), 204520#(<= Main_x 110)] [2018-07-23 13:59:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 6328 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:48,420 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 13:59:48,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 13:59:48,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:59:48,421 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 115 states. [2018-07-23 13:59:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:49,189 INFO L93 Difference]: Finished difference Result 345 states and 347 transitions. [2018-07-23 13:59:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 13:59:49,189 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-23 13:59:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:49,190 INFO L225 Difference]: With dead ends: 345 [2018-07-23 13:59:49,190 INFO L226 Difference]: Without dead ends: 229 [2018-07-23 13:59:49,191 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:59:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-23 13:59:49,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-23 13:59:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-23 13:59:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-07-23 13:59:49,445 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 228 [2018-07-23 13:59:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:49,445 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-07-23 13:59:49,445 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 13:59:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-07-23 13:59:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-23 13:59:49,446 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:49,446 INFO L357 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2018-07-23 13:59:49,446 INFO L414 AbstractCegarLoop]: === Iteration 336 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983545, now seen corresponding path program 333 times [2018-07-23 13:59:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:50,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 6328 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:50,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:50,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 13:59:50,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:50,110 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:59:50,110 INFO L185 omatonBuilderFactory]: Interpolants [205671#true, 205675#(<= 2 Main_x), 205674#(<= 1 Main_x), 205673#(<= 0 Main_x), 205672#false, 205679#(<= 6 Main_x), 205678#(<= 5 Main_x), 205677#(<= 4 Main_x), 205676#(<= 3 Main_x), 205683#(<= 10 Main_x), 205682#(<= 9 Main_x), 205681#(<= 8 Main_x), 205680#(<= 7 Main_x), 205687#(<= 14 Main_x), 205686#(<= 13 Main_x), 205685#(<= 12 Main_x), 205684#(<= 11 Main_x), 205691#(<= 18 Main_x), 205690#(<= 17 Main_x), 205689#(<= 16 Main_x), 205688#(<= 15 Main_x), 205695#(<= 22 Main_x), 205694#(<= 21 Main_x), 205693#(<= 20 Main_x), 205692#(<= 19 Main_x), 205699#(<= 26 Main_x), 205698#(<= 25 Main_x), 205697#(<= 24 Main_x), 205696#(<= 23 Main_x), 205703#(<= 30 Main_x), 205702#(<= 29 Main_x), 205701#(<= 28 Main_x), 205700#(<= 27 Main_x), 205707#(<= 34 Main_x), 205706#(<= 33 Main_x), 205705#(<= 32 Main_x), 205704#(<= 31 Main_x), 205711#(<= 38 Main_x), 205710#(<= 37 Main_x), 205709#(<= 36 Main_x), 205708#(<= 35 Main_x), 205715#(<= 42 Main_x), 205714#(<= 41 Main_x), 205713#(<= 40 Main_x), 205712#(<= 39 Main_x), 205719#(<= 46 Main_x), 205718#(<= 45 Main_x), 205717#(<= 44 Main_x), 205716#(<= 43 Main_x), 205723#(<= 50 Main_x), 205722#(<= 49 Main_x), 205721#(<= 48 Main_x), 205720#(<= 47 Main_x), 205727#(<= 54 Main_x), 205726#(<= 53 Main_x), 205725#(<= 52 Main_x), 205724#(<= 51 Main_x), 205731#(<= 58 Main_x), 205730#(<= 57 Main_x), 205729#(<= 56 Main_x), 205728#(<= 55 Main_x), 205735#(<= 62 Main_x), 205734#(<= 61 Main_x), 205733#(<= 60 Main_x), 205732#(<= 59 Main_x), 205739#(<= 66 Main_x), 205738#(<= 65 Main_x), 205737#(<= 64 Main_x), 205736#(<= 63 Main_x), 205743#(<= 70 Main_x), 205742#(<= 69 Main_x), 205741#(<= 68 Main_x), 205740#(<= 67 Main_x), 205747#(<= 74 Main_x), 205746#(<= 73 Main_x), 205745#(<= 72 Main_x), 205744#(<= 71 Main_x), 205751#(<= 78 Main_x), 205750#(<= 77 Main_x), 205749#(<= 76 Main_x), 205748#(<= 75 Main_x), 205755#(<= 82 Main_x), 205754#(<= 81 Main_x), 205753#(<= 80 Main_x), 205752#(<= 79 Main_x), 205759#(<= 86 Main_x), 205758#(<= 85 Main_x), 205757#(<= 84 Main_x), 205756#(<= 83 Main_x), 205763#(<= 90 Main_x), 205762#(<= 89 Main_x), 205761#(<= 88 Main_x), 205760#(<= 87 Main_x), 205767#(<= 94 Main_x), 205766#(<= 93 Main_x), 205765#(<= 92 Main_x), 205764#(<= 91 Main_x), 205771#(<= 98 Main_x), 205770#(<= 97 Main_x), 205769#(<= 96 Main_x), 205768#(<= 95 Main_x), 205775#(<= 102 Main_x), 205774#(<= 101 Main_x), 205773#(<= 100 Main_x), 205772#(<= 99 Main_x), 205779#(<= 106 Main_x), 205778#(<= 105 Main_x), 205777#(<= 104 Main_x), 205776#(<= 103 Main_x), 205783#(<= 110 Main_x), 205782#(<= 109 Main_x), 205781#(<= 108 Main_x), 205780#(<= 107 Main_x), 205785#(<= 112 Main_x), 205784#(<= 111 Main_x)] [2018-07-23 13:59:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 6328 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:50,111 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 13:59:50,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 13:59:50,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:59:50,112 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 115 states. [2018-07-23 13:59:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:50,450 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-07-23 13:59:50,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 13:59:50,450 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-23 13:59:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:50,450 INFO L225 Difference]: With dead ends: 233 [2018-07-23 13:59:50,450 INFO L226 Difference]: Without dead ends: 230 [2018-07-23 13:59:50,451 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:59:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-23 13:59:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-07-23 13:59:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-07-23 13:59:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-07-23 13:59:50,707 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 228 [2018-07-23 13:59:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:50,707 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-07-23 13:59:50,708 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 13:59:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-07-23 13:59:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-07-23 13:59:50,708 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:50,708 INFO L357 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1] [2018-07-23 13:59:50,708 INFO L414 AbstractCegarLoop]: === Iteration 337 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1968121543, now seen corresponding path program 334 times [2018-07-23 13:59:50,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:51,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:51,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 13:59:51,656 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:51,657 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:59:51,657 INFO L185 omatonBuilderFactory]: Interpolants [206715#(and (<= 1 Main_y) (<= Main_y 1)), 206714#(and (<= 0 Main_y) (<= Main_y 0)), 206713#false, 206712#true, 206719#(and (<= Main_y 5) (<= 5 Main_y)), 206718#(and (<= Main_y 4) (<= 4 Main_y)), 206717#(and (<= Main_y 3) (<= 3 Main_y)), 206716#(and (<= Main_y 2) (<= 2 Main_y)), 206723#(and (<= Main_y 9) (<= 9 Main_y)), 206722#(and (<= 8 Main_y) (<= Main_y 8)), 206721#(and (<= 7 Main_y) (<= Main_y 7)), 206720#(and (<= Main_y 6) (<= 6 Main_y)), 206727#(and (<= 13 Main_y) (<= Main_y 13)), 206726#(and (<= 12 Main_y) (<= Main_y 12)), 206725#(and (<= 11 Main_y) (<= Main_y 11)), 206724#(and (<= 10 Main_y) (<= Main_y 10)), 206731#(and (<= Main_y 17) (<= 17 Main_y)), 206730#(and (<= 16 Main_y) (<= Main_y 16)), 206729#(and (<= Main_y 15) (<= 15 Main_y)), 206728#(and (<= 14 Main_y) (<= Main_y 14)), 206735#(and (<= 21 Main_y) (<= Main_y 21)), 206734#(and (<= 20 Main_y) (<= Main_y 20)), 206733#(and (<= Main_y 19) (<= 19 Main_y)), 206732#(and (<= Main_y 18) (<= 18 Main_y)), 206739#(and (<= 25 Main_y) (<= Main_y 25)), 206738#(and (<= Main_y 24) (<= 24 Main_y)), 206737#(and (<= 23 Main_y) (<= Main_y 23)), 206736#(and (<= Main_y 22) (<= 22 Main_y)), 206743#(and (<= 29 Main_y) (<= Main_y 29)), 206742#(and (<= 28 Main_y) (<= Main_y 28)), 206741#(and (<= 27 Main_y) (<= Main_y 27)), 206740#(and (<= Main_y 26) (<= 26 Main_y)), 206747#(and (<= 33 Main_y) (<= Main_y 33)), 206746#(and (<= 32 Main_y) (<= Main_y 32)), 206745#(and (<= Main_y 31) (<= 31 Main_y)), 206744#(and (<= 30 Main_y) (<= Main_y 30)), 206751#(and (<= Main_y 37) (<= 37 Main_y)), 206750#(and (<= 36 Main_y) (<= Main_y 36)), 206749#(and (<= 35 Main_y) (<= Main_y 35)), 206748#(and (<= Main_y 34) (<= 34 Main_y)), 206755#(and (<= Main_y 41) (<= 41 Main_y)), 206754#(and (<= 40 Main_y) (<= Main_y 40)), 206753#(and (<= 39 Main_y) (<= Main_y 39)), 206752#(and (<= Main_y 38) (<= 38 Main_y)), 206759#(and (<= Main_y 45) (<= 45 Main_y)), 206758#(and (<= 44 Main_y) (<= Main_y 44)), 206757#(and (<= 43 Main_y) (<= Main_y 43)), 206756#(and (<= 42 Main_y) (<= Main_y 42)), 206763#(and (<= 49 Main_y) (<= Main_y 49)), 206762#(and (<= 48 Main_y) (<= Main_y 48)), 206761#(and (<= 47 Main_y) (<= Main_y 47)), 206760#(and (<= 46 Main_y) (<= Main_y 46)), 206767#(and (<= 53 Main_y) (<= Main_y 53)), 206766#(and (<= 52 Main_y) (<= Main_y 52)), 206765#(and (<= 51 Main_y) (<= Main_y 51)), 206764#(and (<= 50 Main_y) (<= Main_y 50)), 206771#(and (<= Main_y 57) (<= 57 Main_y)), 206770#(and (<= Main_y 56) (<= 56 Main_y)), 206769#(and (<= 55 Main_y) (<= Main_y 55)), 206768#(and (<= 54 Main_y) (<= Main_y 54)), 206775#(and (<= Main_y 61) (<= 61 Main_y)), 206774#(and (<= Main_y 60) (<= 60 Main_y)), 206773#(and (<= Main_y 59) (<= 59 Main_y)), 206772#(and (<= Main_y 58) (<= 58 Main_y)), 206779#(and (<= Main_y 65) (<= 65 Main_y)), 206778#(and (<= 64 Main_y) (<= Main_y 64)), 206777#(and (<= 63 Main_y) (<= Main_y 63)), 206776#(and (<= 62 Main_y) (<= Main_y 62)), 206783#(and (<= Main_y 69) (<= 69 Main_y)), 206782#(and (<= 68 Main_y) (<= Main_y 68)), 206781#(and (<= 67 Main_y) (<= Main_y 67)), 206780#(and (<= Main_y 66) (<= 66 Main_y)), 206787#(and (<= 73 Main_y) (<= Main_y 73)), 206786#(and (<= 72 Main_y) (<= Main_y 72)), 206785#(and (<= Main_y 71) (<= 71 Main_y)), 206784#(and (<= 70 Main_y) (<= Main_y 70)), 206791#(and (<= Main_y 77) (<= 77 Main_y)), 206790#(and (<= Main_y 76) (<= 76 Main_y)), 206789#(and (<= Main_y 75) (<= 75 Main_y)), 206788#(and (<= 74 Main_y) (<= Main_y 74)), 206795#(and (<= 81 Main_y) (<= Main_y 81)), 206794#(and (<= Main_y 80) (<= 80 Main_y)), 206793#(and (<= 79 Main_y) (<= Main_y 79)), 206792#(and (<= Main_y 78) (<= 78 Main_y)), 206799#(and (<= Main_y 85) (<= 85 Main_y)), 206798#(and (<= Main_y 84) (<= 84 Main_y)), 206797#(and (<= Main_y 83) (<= 83 Main_y)), 206796#(and (<= Main_y 82) (<= 82 Main_y)), 206803#(and (<= Main_y 89) (<= 89 Main_y)), 206802#(and (<= Main_y 88) (<= 88 Main_y)), 206801#(and (<= Main_y 87) (<= 87 Main_y)), 206800#(and (<= 86 Main_y) (<= Main_y 86)), 206807#(and (<= 93 Main_y) (<= Main_y 93)), 206806#(and (<= 92 Main_y) (<= Main_y 92)), 206805#(and (<= Main_y 91) (<= 91 Main_y)), 206804#(and (<= Main_y 90) (<= 90 Main_y)), 206811#(and (<= Main_y 97) (<= 97 Main_y)), 206810#(and (<= 96 Main_y) (<= Main_y 96)), 206809#(and (<= Main_y 95) (<= 95 Main_y)), 206808#(and (<= 94 Main_y) (<= Main_y 94)), 206815#(and (<= Main_y 101) (<= 101 Main_y)), 206814#(and (<= Main_y 100) (<= 100 Main_y)), 206813#(and (<= 99 Main_y) (<= Main_y 99)), 206812#(and (<= 98 Main_y) (<= Main_y 98)), 206819#(and (<= 105 Main_y) (<= Main_y 105)), 206818#(and (<= 104 Main_y) (<= Main_y 104)), 206817#(and (<= 103 Main_y) (<= Main_y 103)), 206816#(and (<= 102 Main_y) (<= Main_y 102)), 206823#(and (<= Main_y 109) (<= 109 Main_y)), 206822#(and (<= Main_y 108) (<= 108 Main_y)), 206821#(and (<= Main_y 107) (<= 107 Main_y)), 206820#(and (<= Main_y 106) (<= 106 Main_y)), 206826#(and (<= Main_y 112) (<= 112 Main_y)), 206825#(and (<= Main_y 111) (<= 111 Main_y)), 206824#(and (<= Main_y 110) (<= 110 Main_y))] [2018-07-23 13:59:51,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:51,658 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 13:59:51,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 13:59:51,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:59:51,658 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 115 states. [2018-07-23 13:59:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:53,505 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-07-23 13:59:53,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 13:59:53,506 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 229 [2018-07-23 13:59:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:53,506 INFO L225 Difference]: With dead ends: 347 [2018-07-23 13:59:53,506 INFO L226 Difference]: Without dead ends: 344 [2018-07-23 13:59:53,507 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:59:53,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-23 13:59:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 232. [2018-07-23 13:59:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-23 13:59:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 234 transitions. [2018-07-23 13:59:53,772 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 234 transitions. Word has length 229 [2018-07-23 13:59:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:53,773 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 234 transitions. [2018-07-23 13:59:53,773 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 13:59:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 234 transitions. [2018-07-23 13:59:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-23 13:59:53,774 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:53,774 INFO L357 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2018-07-23 13:59:53,774 INFO L414 AbstractCegarLoop]: === Iteration 338 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash 882164167, now seen corresponding path program 335 times [2018-07-23 13:59:53,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:54,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:54,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 13:59:54,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:54,430 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:59:54,431 INFO L185 omatonBuilderFactory]: Interpolants [207987#(<= Main_x 0), 207986#false, 207985#true, 207991#(<= Main_x 4), 207990#(<= Main_x 3), 207989#(<= Main_x 2), 207988#(<= Main_x 1), 207995#(<= Main_x 8), 207994#(<= Main_x 7), 207993#(<= Main_x 6), 207992#(<= Main_x 5), 207999#(<= Main_x 12), 207998#(<= Main_x 11), 207997#(<= Main_x 10), 207996#(<= Main_x 9), 208003#(<= Main_x 16), 208002#(<= Main_x 15), 208001#(<= Main_x 14), 208000#(<= Main_x 13), 208007#(<= Main_x 20), 208006#(<= Main_x 19), 208005#(<= Main_x 18), 208004#(<= Main_x 17), 208011#(<= Main_x 24), 208010#(<= Main_x 23), 208009#(<= Main_x 22), 208008#(<= Main_x 21), 208015#(<= Main_x 28), 208014#(<= Main_x 27), 208013#(<= Main_x 26), 208012#(<= Main_x 25), 208019#(<= Main_x 32), 208018#(<= Main_x 31), 208017#(<= Main_x 30), 208016#(<= Main_x 29), 208023#(<= Main_x 36), 208022#(<= Main_x 35), 208021#(<= Main_x 34), 208020#(<= Main_x 33), 208027#(<= Main_x 40), 208026#(<= Main_x 39), 208025#(<= Main_x 38), 208024#(<= Main_x 37), 208031#(<= Main_x 44), 208030#(<= Main_x 43), 208029#(<= Main_x 42), 208028#(<= Main_x 41), 208035#(<= Main_x 48), 208034#(<= Main_x 47), 208033#(<= Main_x 46), 208032#(<= Main_x 45), 208039#(<= Main_x 52), 208038#(<= Main_x 51), 208037#(<= Main_x 50), 208036#(<= Main_x 49), 208043#(<= Main_x 56), 208042#(<= Main_x 55), 208041#(<= Main_x 54), 208040#(<= Main_x 53), 208047#(<= Main_x 60), 208046#(<= Main_x 59), 208045#(<= Main_x 58), 208044#(<= Main_x 57), 208051#(<= Main_x 64), 208050#(<= Main_x 63), 208049#(<= Main_x 62), 208048#(<= Main_x 61), 208055#(<= Main_x 68), 208054#(<= Main_x 67), 208053#(<= Main_x 66), 208052#(<= Main_x 65), 208059#(<= Main_x 72), 208058#(<= Main_x 71), 208057#(<= Main_x 70), 208056#(<= Main_x 69), 208063#(<= Main_x 76), 208062#(<= Main_x 75), 208061#(<= Main_x 74), 208060#(<= Main_x 73), 208067#(<= Main_x 80), 208066#(<= Main_x 79), 208065#(<= Main_x 78), 208064#(<= Main_x 77), 208071#(<= Main_x 84), 208070#(<= Main_x 83), 208069#(<= Main_x 82), 208068#(<= Main_x 81), 208075#(<= Main_x 88), 208074#(<= Main_x 87), 208073#(<= Main_x 86), 208072#(<= Main_x 85), 208079#(<= Main_x 92), 208078#(<= Main_x 91), 208077#(<= Main_x 90), 208076#(<= Main_x 89), 208083#(<= Main_x 96), 208082#(<= Main_x 95), 208081#(<= Main_x 94), 208080#(<= Main_x 93), 208087#(<= Main_x 100), 208086#(<= Main_x 99), 208085#(<= Main_x 98), 208084#(<= Main_x 97), 208091#(<= Main_x 104), 208090#(<= Main_x 103), 208089#(<= Main_x 102), 208088#(<= Main_x 101), 208095#(<= Main_x 108), 208094#(<= Main_x 107), 208093#(<= Main_x 106), 208092#(<= Main_x 105), 208099#(<= Main_x 112), 208098#(<= Main_x 111), 208097#(<= Main_x 110), 208096#(<= Main_x 109), 208100#(<= (+ Main_x 1) 0)] [2018-07-23 13:59:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:54,431 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 13:59:54,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 13:59:54,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:59:54,433 INFO L87 Difference]: Start difference. First operand 232 states and 234 transitions. Second operand 116 states. [2018-07-23 13:59:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:55,219 INFO L93 Difference]: Finished difference Result 348 states and 350 transitions. [2018-07-23 13:59:55,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 13:59:55,219 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-23 13:59:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:55,219 INFO L225 Difference]: With dead ends: 348 [2018-07-23 13:59:55,219 INFO L226 Difference]: Without dead ends: 231 [2018-07-23 13:59:55,220 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:59:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-23 13:59:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-23 13:59:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-23 13:59:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-07-23 13:59:55,480 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 230 [2018-07-23 13:59:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:55,480 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-07-23 13:59:55,480 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 13:59:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-07-23 13:59:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-23 13:59:55,481 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:55,481 INFO L357 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2018-07-23 13:59:55,481 INFO L414 AbstractCegarLoop]: === Iteration 339 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash 852770669, now seen corresponding path program 336 times [2018-07-23 13:59:55,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:56,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:56,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 13:59:56,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:56,111 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:59:56,111 INFO L185 omatonBuilderFactory]: Interpolants [209259#true, 209263#(<= 2 Main_x), 209262#(<= 1 Main_x), 209261#(<= 0 Main_x), 209260#false, 209267#(<= 6 Main_x), 209266#(<= 5 Main_x), 209265#(<= 4 Main_x), 209264#(<= 3 Main_x), 209271#(<= 10 Main_x), 209270#(<= 9 Main_x), 209269#(<= 8 Main_x), 209268#(<= 7 Main_x), 209275#(<= 14 Main_x), 209274#(<= 13 Main_x), 209273#(<= 12 Main_x), 209272#(<= 11 Main_x), 209279#(<= 18 Main_x), 209278#(<= 17 Main_x), 209277#(<= 16 Main_x), 209276#(<= 15 Main_x), 209283#(<= 22 Main_x), 209282#(<= 21 Main_x), 209281#(<= 20 Main_x), 209280#(<= 19 Main_x), 209287#(<= 26 Main_x), 209286#(<= 25 Main_x), 209285#(<= 24 Main_x), 209284#(<= 23 Main_x), 209291#(<= 30 Main_x), 209290#(<= 29 Main_x), 209289#(<= 28 Main_x), 209288#(<= 27 Main_x), 209295#(<= 34 Main_x), 209294#(<= 33 Main_x), 209293#(<= 32 Main_x), 209292#(<= 31 Main_x), 209299#(<= 38 Main_x), 209298#(<= 37 Main_x), 209297#(<= 36 Main_x), 209296#(<= 35 Main_x), 209303#(<= 42 Main_x), 209302#(<= 41 Main_x), 209301#(<= 40 Main_x), 209300#(<= 39 Main_x), 209307#(<= 46 Main_x), 209306#(<= 45 Main_x), 209305#(<= 44 Main_x), 209304#(<= 43 Main_x), 209311#(<= 50 Main_x), 209310#(<= 49 Main_x), 209309#(<= 48 Main_x), 209308#(<= 47 Main_x), 209315#(<= 54 Main_x), 209314#(<= 53 Main_x), 209313#(<= 52 Main_x), 209312#(<= 51 Main_x), 209319#(<= 58 Main_x), 209318#(<= 57 Main_x), 209317#(<= 56 Main_x), 209316#(<= 55 Main_x), 209323#(<= 62 Main_x), 209322#(<= 61 Main_x), 209321#(<= 60 Main_x), 209320#(<= 59 Main_x), 209327#(<= 66 Main_x), 209326#(<= 65 Main_x), 209325#(<= 64 Main_x), 209324#(<= 63 Main_x), 209331#(<= 70 Main_x), 209330#(<= 69 Main_x), 209329#(<= 68 Main_x), 209328#(<= 67 Main_x), 209335#(<= 74 Main_x), 209334#(<= 73 Main_x), 209333#(<= 72 Main_x), 209332#(<= 71 Main_x), 209339#(<= 78 Main_x), 209338#(<= 77 Main_x), 209337#(<= 76 Main_x), 209336#(<= 75 Main_x), 209343#(<= 82 Main_x), 209342#(<= 81 Main_x), 209341#(<= 80 Main_x), 209340#(<= 79 Main_x), 209347#(<= 86 Main_x), 209346#(<= 85 Main_x), 209345#(<= 84 Main_x), 209344#(<= 83 Main_x), 209351#(<= 90 Main_x), 209350#(<= 89 Main_x), 209349#(<= 88 Main_x), 209348#(<= 87 Main_x), 209355#(<= 94 Main_x), 209354#(<= 93 Main_x), 209353#(<= 92 Main_x), 209352#(<= 91 Main_x), 209359#(<= 98 Main_x), 209358#(<= 97 Main_x), 209357#(<= 96 Main_x), 209356#(<= 95 Main_x), 209363#(<= 102 Main_x), 209362#(<= 101 Main_x), 209361#(<= 100 Main_x), 209360#(<= 99 Main_x), 209367#(<= 106 Main_x), 209366#(<= 105 Main_x), 209365#(<= 104 Main_x), 209364#(<= 103 Main_x), 209371#(<= 110 Main_x), 209370#(<= 109 Main_x), 209369#(<= 108 Main_x), 209368#(<= 107 Main_x), 209374#(<= 113 Main_x), 209373#(<= 112 Main_x), 209372#(<= 111 Main_x)] [2018-07-23 13:59:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 6441 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:56,112 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 13:59:56,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 13:59:56,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:59:56,113 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 116 states. [2018-07-23 13:59:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:56,456 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2018-07-23 13:59:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 13:59:56,456 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-23 13:59:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:56,457 INFO L225 Difference]: With dead ends: 235 [2018-07-23 13:59:56,457 INFO L226 Difference]: Without dead ends: 232 [2018-07-23 13:59:56,457 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:59:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-07-23 13:59:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-07-23 13:59:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-23 13:59:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 233 transitions. [2018-07-23 13:59:56,718 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 233 transitions. Word has length 230 [2018-07-23 13:59:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:56,718 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 233 transitions. [2018-07-23 13:59:56,718 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 13:59:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 233 transitions. [2018-07-23 13:59:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-23 13:59:56,719 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:56,719 INFO L357 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1] [2018-07-23 13:59:56,719 INFO L414 AbstractCegarLoop]: === Iteration 340 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash 666025441, now seen corresponding path program 337 times [2018-07-23 13:59:56,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:59:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:59:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:57,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:59:57,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 13:59:57,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:59:57,669 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:59:57,669 INFO L185 omatonBuilderFactory]: Interpolants [210311#(and (<= 0 Main_y) (<= Main_y 0)), 210310#false, 210309#true, 210315#(and (<= Main_y 4) (<= 4 Main_y)), 210314#(and (<= Main_y 3) (<= 3 Main_y)), 210313#(and (<= Main_y 2) (<= 2 Main_y)), 210312#(and (<= 1 Main_y) (<= Main_y 1)), 210319#(and (<= 8 Main_y) (<= Main_y 8)), 210318#(and (<= 7 Main_y) (<= Main_y 7)), 210317#(and (<= Main_y 6) (<= 6 Main_y)), 210316#(and (<= Main_y 5) (<= 5 Main_y)), 210323#(and (<= 12 Main_y) (<= Main_y 12)), 210322#(and (<= 11 Main_y) (<= Main_y 11)), 210321#(and (<= 10 Main_y) (<= Main_y 10)), 210320#(and (<= Main_y 9) (<= 9 Main_y)), 210327#(and (<= 16 Main_y) (<= Main_y 16)), 210326#(and (<= Main_y 15) (<= 15 Main_y)), 210325#(and (<= 14 Main_y) (<= Main_y 14)), 210324#(and (<= 13 Main_y) (<= Main_y 13)), 210331#(and (<= 20 Main_y) (<= Main_y 20)), 210330#(and (<= Main_y 19) (<= 19 Main_y)), 210329#(and (<= Main_y 18) (<= 18 Main_y)), 210328#(and (<= Main_y 17) (<= 17 Main_y)), 210335#(and (<= Main_y 24) (<= 24 Main_y)), 210334#(and (<= 23 Main_y) (<= Main_y 23)), 210333#(and (<= Main_y 22) (<= 22 Main_y)), 210332#(and (<= 21 Main_y) (<= Main_y 21)), 210339#(and (<= 28 Main_y) (<= Main_y 28)), 210338#(and (<= 27 Main_y) (<= Main_y 27)), 210337#(and (<= Main_y 26) (<= 26 Main_y)), 210336#(and (<= 25 Main_y) (<= Main_y 25)), 210343#(and (<= 32 Main_y) (<= Main_y 32)), 210342#(and (<= Main_y 31) (<= 31 Main_y)), 210341#(and (<= 30 Main_y) (<= Main_y 30)), 210340#(and (<= 29 Main_y) (<= Main_y 29)), 210347#(and (<= 36 Main_y) (<= Main_y 36)), 210346#(and (<= 35 Main_y) (<= Main_y 35)), 210345#(and (<= Main_y 34) (<= 34 Main_y)), 210344#(and (<= 33 Main_y) (<= Main_y 33)), 210351#(and (<= 40 Main_y) (<= Main_y 40)), 210350#(and (<= 39 Main_y) (<= Main_y 39)), 210349#(and (<= Main_y 38) (<= 38 Main_y)), 210348#(and (<= Main_y 37) (<= 37 Main_y)), 210355#(and (<= 44 Main_y) (<= Main_y 44)), 210354#(and (<= 43 Main_y) (<= Main_y 43)), 210353#(and (<= 42 Main_y) (<= Main_y 42)), 210352#(and (<= Main_y 41) (<= 41 Main_y)), 210359#(and (<= 48 Main_y) (<= Main_y 48)), 210358#(and (<= 47 Main_y) (<= Main_y 47)), 210357#(and (<= 46 Main_y) (<= Main_y 46)), 210356#(and (<= Main_y 45) (<= 45 Main_y)), 210363#(and (<= 52 Main_y) (<= Main_y 52)), 210362#(and (<= 51 Main_y) (<= Main_y 51)), 210361#(and (<= 50 Main_y) (<= Main_y 50)), 210360#(and (<= 49 Main_y) (<= Main_y 49)), 210367#(and (<= Main_y 56) (<= 56 Main_y)), 210366#(and (<= 55 Main_y) (<= Main_y 55)), 210365#(and (<= 54 Main_y) (<= Main_y 54)), 210364#(and (<= 53 Main_y) (<= Main_y 53)), 210371#(and (<= Main_y 60) (<= 60 Main_y)), 210370#(and (<= Main_y 59) (<= 59 Main_y)), 210369#(and (<= Main_y 58) (<= 58 Main_y)), 210368#(and (<= Main_y 57) (<= 57 Main_y)), 210375#(and (<= 64 Main_y) (<= Main_y 64)), 210374#(and (<= 63 Main_y) (<= Main_y 63)), 210373#(and (<= 62 Main_y) (<= Main_y 62)), 210372#(and (<= Main_y 61) (<= 61 Main_y)), 210379#(and (<= 68 Main_y) (<= Main_y 68)), 210378#(and (<= 67 Main_y) (<= Main_y 67)), 210377#(and (<= Main_y 66) (<= 66 Main_y)), 210376#(and (<= Main_y 65) (<= 65 Main_y)), 210383#(and (<= 72 Main_y) (<= Main_y 72)), 210382#(and (<= Main_y 71) (<= 71 Main_y)), 210381#(and (<= 70 Main_y) (<= Main_y 70)), 210380#(and (<= Main_y 69) (<= 69 Main_y)), 210387#(and (<= Main_y 76) (<= 76 Main_y)), 210386#(and (<= Main_y 75) (<= 75 Main_y)), 210385#(and (<= 74 Main_y) (<= Main_y 74)), 210384#(and (<= 73 Main_y) (<= Main_y 73)), 210391#(and (<= Main_y 80) (<= 80 Main_y)), 210390#(and (<= 79 Main_y) (<= Main_y 79)), 210389#(and (<= Main_y 78) (<= 78 Main_y)), 210388#(and (<= Main_y 77) (<= 77 Main_y)), 210395#(and (<= Main_y 84) (<= 84 Main_y)), 210394#(and (<= Main_y 83) (<= 83 Main_y)), 210393#(and (<= Main_y 82) (<= 82 Main_y)), 210392#(and (<= 81 Main_y) (<= Main_y 81)), 210399#(and (<= Main_y 88) (<= 88 Main_y)), 210398#(and (<= Main_y 87) (<= 87 Main_y)), 210397#(and (<= 86 Main_y) (<= Main_y 86)), 210396#(and (<= Main_y 85) (<= 85 Main_y)), 210403#(and (<= 92 Main_y) (<= Main_y 92)), 210402#(and (<= Main_y 91) (<= 91 Main_y)), 210401#(and (<= Main_y 90) (<= 90 Main_y)), 210400#(and (<= Main_y 89) (<= 89 Main_y)), 210407#(and (<= 96 Main_y) (<= Main_y 96)), 210406#(and (<= Main_y 95) (<= 95 Main_y)), 210405#(and (<= 94 Main_y) (<= Main_y 94)), 210404#(and (<= 93 Main_y) (<= Main_y 93)), 210411#(and (<= Main_y 100) (<= 100 Main_y)), 210410#(and (<= 99 Main_y) (<= Main_y 99)), 210409#(and (<= 98 Main_y) (<= Main_y 98)), 210408#(and (<= Main_y 97) (<= 97 Main_y)), 210415#(and (<= 104 Main_y) (<= Main_y 104)), 210414#(and (<= 103 Main_y) (<= Main_y 103)), 210413#(and (<= 102 Main_y) (<= Main_y 102)), 210412#(and (<= Main_y 101) (<= 101 Main_y)), 210419#(and (<= Main_y 108) (<= 108 Main_y)), 210418#(and (<= Main_y 107) (<= 107 Main_y)), 210417#(and (<= Main_y 106) (<= 106 Main_y)), 210416#(and (<= 105 Main_y) (<= Main_y 105)), 210423#(and (<= Main_y 112) (<= 112 Main_y)), 210422#(and (<= Main_y 111) (<= 111 Main_y)), 210421#(and (<= Main_y 110) (<= 110 Main_y)), 210420#(and (<= Main_y 109) (<= 109 Main_y)), 210424#(and (<= 113 Main_y) (<= Main_y 113))] [2018-07-23 13:59:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:59:57,670 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 13:59:57,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 13:59:57,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:59:57,671 INFO L87 Difference]: Start difference. First operand 232 states and 233 transitions. Second operand 116 states. [2018-07-23 13:59:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:59:59,599 INFO L93 Difference]: Finished difference Result 350 states and 352 transitions. [2018-07-23 13:59:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 13:59:59,600 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 231 [2018-07-23 13:59:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:59:59,600 INFO L225 Difference]: With dead ends: 350 [2018-07-23 13:59:59,600 INFO L226 Difference]: Without dead ends: 347 [2018-07-23 13:59:59,600 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:59:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-07-23 13:59:59,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 234. [2018-07-23 13:59:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-07-23 13:59:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-07-23 13:59:59,871 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 231 [2018-07-23 13:59:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:59:59,871 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-07-23 13:59:59,871 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 13:59:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-07-23 13:59:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 13:59:59,871 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:59:59,872 INFO L357 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2018-07-23 13:59:59,872 INFO L414 AbstractCegarLoop]: === Iteration 341 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 13:59:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash -828109331, now seen corresponding path program 338 times [2018-07-23 13:59:59,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 6555 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:00,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:00,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 14:00:00,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:00,541 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 14:00:00,541 INFO L185 omatonBuilderFactory]: Interpolants [211595#(<= Main_x 0), 211594#false, 211593#true, 211599#(<= Main_x 4), 211598#(<= Main_x 3), 211597#(<= Main_x 2), 211596#(<= Main_x 1), 211603#(<= Main_x 8), 211602#(<= Main_x 7), 211601#(<= Main_x 6), 211600#(<= Main_x 5), 211607#(<= Main_x 12), 211606#(<= Main_x 11), 211605#(<= Main_x 10), 211604#(<= Main_x 9), 211611#(<= Main_x 16), 211610#(<= Main_x 15), 211609#(<= Main_x 14), 211608#(<= Main_x 13), 211615#(<= Main_x 20), 211614#(<= Main_x 19), 211613#(<= Main_x 18), 211612#(<= Main_x 17), 211619#(<= Main_x 24), 211618#(<= Main_x 23), 211617#(<= Main_x 22), 211616#(<= Main_x 21), 211623#(<= Main_x 28), 211622#(<= Main_x 27), 211621#(<= Main_x 26), 211620#(<= Main_x 25), 211627#(<= Main_x 32), 211626#(<= Main_x 31), 211625#(<= Main_x 30), 211624#(<= Main_x 29), 211631#(<= Main_x 36), 211630#(<= Main_x 35), 211629#(<= Main_x 34), 211628#(<= Main_x 33), 211635#(<= Main_x 40), 211634#(<= Main_x 39), 211633#(<= Main_x 38), 211632#(<= Main_x 37), 211639#(<= Main_x 44), 211638#(<= Main_x 43), 211637#(<= Main_x 42), 211636#(<= Main_x 41), 211643#(<= Main_x 48), 211642#(<= Main_x 47), 211641#(<= Main_x 46), 211640#(<= Main_x 45), 211647#(<= Main_x 52), 211646#(<= Main_x 51), 211645#(<= Main_x 50), 211644#(<= Main_x 49), 211651#(<= Main_x 56), 211650#(<= Main_x 55), 211649#(<= Main_x 54), 211648#(<= Main_x 53), 211655#(<= Main_x 60), 211654#(<= Main_x 59), 211653#(<= Main_x 58), 211652#(<= Main_x 57), 211659#(<= Main_x 64), 211658#(<= Main_x 63), 211657#(<= Main_x 62), 211656#(<= Main_x 61), 211663#(<= Main_x 68), 211662#(<= Main_x 67), 211661#(<= Main_x 66), 211660#(<= Main_x 65), 211667#(<= Main_x 72), 211666#(<= Main_x 71), 211665#(<= Main_x 70), 211664#(<= Main_x 69), 211671#(<= Main_x 76), 211670#(<= Main_x 75), 211669#(<= Main_x 74), 211668#(<= Main_x 73), 211675#(<= Main_x 80), 211674#(<= Main_x 79), 211673#(<= Main_x 78), 211672#(<= Main_x 77), 211679#(<= Main_x 84), 211678#(<= Main_x 83), 211677#(<= Main_x 82), 211676#(<= Main_x 81), 211683#(<= Main_x 88), 211682#(<= Main_x 87), 211681#(<= Main_x 86), 211680#(<= Main_x 85), 211687#(<= Main_x 92), 211686#(<= Main_x 91), 211685#(<= Main_x 90), 211684#(<= Main_x 89), 211691#(<= Main_x 96), 211690#(<= Main_x 95), 211689#(<= Main_x 94), 211688#(<= Main_x 93), 211695#(<= Main_x 100), 211694#(<= Main_x 99), 211693#(<= Main_x 98), 211692#(<= Main_x 97), 211699#(<= Main_x 104), 211698#(<= Main_x 103), 211697#(<= Main_x 102), 211696#(<= Main_x 101), 211703#(<= Main_x 108), 211702#(<= Main_x 107), 211701#(<= Main_x 106), 211700#(<= Main_x 105), 211707#(<= Main_x 112), 211706#(<= Main_x 111), 211705#(<= Main_x 110), 211704#(<= Main_x 109), 211709#(<= (+ Main_x 1) 0), 211708#(<= Main_x 113)] [2018-07-23 14:00:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 6555 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:00,542 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 14:00:00,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 14:00:00,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 14:00:00,543 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 117 states. [2018-07-23 14:00:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:01,359 INFO L93 Difference]: Finished difference Result 351 states and 353 transitions. [2018-07-23 14:00:01,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 14:00:01,359 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-23 14:00:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:01,359 INFO L225 Difference]: With dead ends: 351 [2018-07-23 14:00:01,359 INFO L226 Difference]: Without dead ends: 233 [2018-07-23 14:00:01,360 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 14:00:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-23 14:00:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-23 14:00:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 14:00:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-07-23 14:00:01,624 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 232 [2018-07-23 14:00:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:01,624 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-07-23 14:00:01,624 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 14:00:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-07-23 14:00:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 14:00:01,625 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:01,625 INFO L357 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2018-07-23 14:00:01,625 INFO L414 AbstractCegarLoop]: === Iteration 342 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1739307769, now seen corresponding path program 339 times [2018-07-23 14:00:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 6555 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:02,332 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:02,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 14:00:02,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:02,332 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 14:00:02,333 INFO L185 omatonBuilderFactory]: Interpolants [212994#(<= 114 Main_x), 212993#(<= 113 Main_x), 212992#(<= 112 Main_x), 212879#false, 212878#true, 212883#(<= 3 Main_x), 212882#(<= 2 Main_x), 212881#(<= 1 Main_x), 212880#(<= 0 Main_x), 212887#(<= 7 Main_x), 212886#(<= 6 Main_x), 212885#(<= 5 Main_x), 212884#(<= 4 Main_x), 212891#(<= 11 Main_x), 212890#(<= 10 Main_x), 212889#(<= 9 Main_x), 212888#(<= 8 Main_x), 212895#(<= 15 Main_x), 212894#(<= 14 Main_x), 212893#(<= 13 Main_x), 212892#(<= 12 Main_x), 212899#(<= 19 Main_x), 212898#(<= 18 Main_x), 212897#(<= 17 Main_x), 212896#(<= 16 Main_x), 212903#(<= 23 Main_x), 212902#(<= 22 Main_x), 212901#(<= 21 Main_x), 212900#(<= 20 Main_x), 212907#(<= 27 Main_x), 212906#(<= 26 Main_x), 212905#(<= 25 Main_x), 212904#(<= 24 Main_x), 212911#(<= 31 Main_x), 212910#(<= 30 Main_x), 212909#(<= 29 Main_x), 212908#(<= 28 Main_x), 212915#(<= 35 Main_x), 212914#(<= 34 Main_x), 212913#(<= 33 Main_x), 212912#(<= 32 Main_x), 212919#(<= 39 Main_x), 212918#(<= 38 Main_x), 212917#(<= 37 Main_x), 212916#(<= 36 Main_x), 212923#(<= 43 Main_x), 212922#(<= 42 Main_x), 212921#(<= 41 Main_x), 212920#(<= 40 Main_x), 212927#(<= 47 Main_x), 212926#(<= 46 Main_x), 212925#(<= 45 Main_x), 212924#(<= 44 Main_x), 212931#(<= 51 Main_x), 212930#(<= 50 Main_x), 212929#(<= 49 Main_x), 212928#(<= 48 Main_x), 212935#(<= 55 Main_x), 212934#(<= 54 Main_x), 212933#(<= 53 Main_x), 212932#(<= 52 Main_x), 212939#(<= 59 Main_x), 212938#(<= 58 Main_x), 212937#(<= 57 Main_x), 212936#(<= 56 Main_x), 212943#(<= 63 Main_x), 212942#(<= 62 Main_x), 212941#(<= 61 Main_x), 212940#(<= 60 Main_x), 212947#(<= 67 Main_x), 212946#(<= 66 Main_x), 212945#(<= 65 Main_x), 212944#(<= 64 Main_x), 212951#(<= 71 Main_x), 212950#(<= 70 Main_x), 212949#(<= 69 Main_x), 212948#(<= 68 Main_x), 212955#(<= 75 Main_x), 212954#(<= 74 Main_x), 212953#(<= 73 Main_x), 212952#(<= 72 Main_x), 212959#(<= 79 Main_x), 212958#(<= 78 Main_x), 212957#(<= 77 Main_x), 212956#(<= 76 Main_x), 212963#(<= 83 Main_x), 212962#(<= 82 Main_x), 212961#(<= 81 Main_x), 212960#(<= 80 Main_x), 212967#(<= 87 Main_x), 212966#(<= 86 Main_x), 212965#(<= 85 Main_x), 212964#(<= 84 Main_x), 212971#(<= 91 Main_x), 212970#(<= 90 Main_x), 212969#(<= 89 Main_x), 212968#(<= 88 Main_x), 212975#(<= 95 Main_x), 212974#(<= 94 Main_x), 212973#(<= 93 Main_x), 212972#(<= 92 Main_x), 212979#(<= 99 Main_x), 212978#(<= 98 Main_x), 212977#(<= 97 Main_x), 212976#(<= 96 Main_x), 212983#(<= 103 Main_x), 212982#(<= 102 Main_x), 212981#(<= 101 Main_x), 212980#(<= 100 Main_x), 212987#(<= 107 Main_x), 212986#(<= 106 Main_x), 212985#(<= 105 Main_x), 212984#(<= 104 Main_x), 212991#(<= 111 Main_x), 212990#(<= 110 Main_x), 212989#(<= 109 Main_x), 212988#(<= 108 Main_x)] [2018-07-23 14:00:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 6555 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:02,334 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 14:00:02,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 14:00:02,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 14:00:02,335 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 117 states. [2018-07-23 14:00:02,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:02,711 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-07-23 14:00:02,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 14:00:02,711 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-23 14:00:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:02,712 INFO L225 Difference]: With dead ends: 237 [2018-07-23 14:00:02,712 INFO L226 Difference]: Without dead ends: 234 [2018-07-23 14:00:02,713 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 14:00:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-23 14:00:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-07-23 14:00:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-07-23 14:00:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-07-23 14:00:02,981 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 232 [2018-07-23 14:00:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:02,981 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-07-23 14:00:02,981 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 14:00:02,981 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-07-23 14:00:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-07-23 14:00:02,982 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:02,982 INFO L357 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1] [2018-07-23 14:00:02,982 INFO L414 AbstractCegarLoop]: === Iteration 343 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:02,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1915972487, now seen corresponding path program 340 times [2018-07-23 14:00:02,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:03,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:03,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 14:00:03,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:03,996 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 14:00:03,996 INFO L185 omatonBuilderFactory]: Interpolants [214019#(and (<= Main_y 80) (<= 80 Main_y)), 214018#(and (<= 79 Main_y) (<= Main_y 79)), 214017#(and (<= Main_y 78) (<= 78 Main_y)), 214016#(and (<= Main_y 77) (<= 77 Main_y)), 214023#(and (<= Main_y 84) (<= 84 Main_y)), 214022#(and (<= Main_y 83) (<= 83 Main_y)), 214021#(and (<= Main_y 82) (<= 82 Main_y)), 214020#(and (<= 81 Main_y) (<= Main_y 81)), 214027#(and (<= Main_y 88) (<= 88 Main_y)), 214026#(and (<= Main_y 87) (<= 87 Main_y)), 214025#(and (<= 86 Main_y) (<= Main_y 86)), 214024#(and (<= Main_y 85) (<= 85 Main_y)), 214031#(and (<= 92 Main_y) (<= Main_y 92)), 214030#(and (<= Main_y 91) (<= 91 Main_y)), 214029#(and (<= Main_y 90) (<= 90 Main_y)), 214028#(and (<= Main_y 89) (<= 89 Main_y)), 214035#(and (<= 96 Main_y) (<= Main_y 96)), 214034#(and (<= Main_y 95) (<= 95 Main_y)), 214033#(and (<= 94 Main_y) (<= Main_y 94)), 214032#(and (<= 93 Main_y) (<= Main_y 93)), 214039#(and (<= Main_y 100) (<= 100 Main_y)), 214038#(and (<= 99 Main_y) (<= Main_y 99)), 214037#(and (<= 98 Main_y) (<= Main_y 98)), 214036#(and (<= Main_y 97) (<= 97 Main_y)), 214043#(and (<= 104 Main_y) (<= Main_y 104)), 214042#(and (<= 103 Main_y) (<= Main_y 103)), 214041#(and (<= 102 Main_y) (<= Main_y 102)), 214040#(and (<= Main_y 101) (<= 101 Main_y)), 214047#(and (<= Main_y 108) (<= 108 Main_y)), 214046#(and (<= Main_y 107) (<= 107 Main_y)), 214045#(and (<= Main_y 106) (<= 106 Main_y)), 214044#(and (<= 105 Main_y) (<= Main_y 105)), 214051#(and (<= Main_y 112) (<= 112 Main_y)), 214050#(and (<= Main_y 111) (<= 111 Main_y)), 214049#(and (<= Main_y 110) (<= 110 Main_y)), 214048#(and (<= Main_y 109) (<= 109 Main_y)), 214053#(and (<= Main_y 114) (<= 114 Main_y)), 214052#(and (<= 113 Main_y) (<= Main_y 113)), 213939#(and (<= 0 Main_y) (<= Main_y 0)), 213938#false, 213937#true, 213943#(and (<= Main_y 4) (<= 4 Main_y)), 213942#(and (<= Main_y 3) (<= 3 Main_y)), 213941#(and (<= Main_y 2) (<= 2 Main_y)), 213940#(and (<= 1 Main_y) (<= Main_y 1)), 213947#(and (<= 8 Main_y) (<= Main_y 8)), 213946#(and (<= 7 Main_y) (<= Main_y 7)), 213945#(and (<= Main_y 6) (<= 6 Main_y)), 213944#(and (<= Main_y 5) (<= 5 Main_y)), 213951#(and (<= 12 Main_y) (<= Main_y 12)), 213950#(and (<= 11 Main_y) (<= Main_y 11)), 213949#(and (<= 10 Main_y) (<= Main_y 10)), 213948#(and (<= Main_y 9) (<= 9 Main_y)), 213955#(and (<= 16 Main_y) (<= Main_y 16)), 213954#(and (<= Main_y 15) (<= 15 Main_y)), 213953#(and (<= 14 Main_y) (<= Main_y 14)), 213952#(and (<= 13 Main_y) (<= Main_y 13)), 213959#(and (<= 20 Main_y) (<= Main_y 20)), 213958#(and (<= Main_y 19) (<= 19 Main_y)), 213957#(and (<= Main_y 18) (<= 18 Main_y)), 213956#(and (<= Main_y 17) (<= 17 Main_y)), 213963#(and (<= Main_y 24) (<= 24 Main_y)), 213962#(and (<= 23 Main_y) (<= Main_y 23)), 213961#(and (<= Main_y 22) (<= 22 Main_y)), 213960#(and (<= 21 Main_y) (<= Main_y 21)), 213967#(and (<= 28 Main_y) (<= Main_y 28)), 213966#(and (<= 27 Main_y) (<= Main_y 27)), 213965#(and (<= Main_y 26) (<= 26 Main_y)), 213964#(and (<= 25 Main_y) (<= Main_y 25)), 213971#(and (<= 32 Main_y) (<= Main_y 32)), 213970#(and (<= Main_y 31) (<= 31 Main_y)), 213969#(and (<= 30 Main_y) (<= Main_y 30)), 213968#(and (<= 29 Main_y) (<= Main_y 29)), 213975#(and (<= 36 Main_y) (<= Main_y 36)), 213974#(and (<= 35 Main_y) (<= Main_y 35)), 213973#(and (<= Main_y 34) (<= 34 Main_y)), 213972#(and (<= 33 Main_y) (<= Main_y 33)), 213979#(and (<= 40 Main_y) (<= Main_y 40)), 213978#(and (<= 39 Main_y) (<= Main_y 39)), 213977#(and (<= Main_y 38) (<= 38 Main_y)), 213976#(and (<= Main_y 37) (<= 37 Main_y)), 213983#(and (<= 44 Main_y) (<= Main_y 44)), 213982#(and (<= 43 Main_y) (<= Main_y 43)), 213981#(and (<= 42 Main_y) (<= Main_y 42)), 213980#(and (<= Main_y 41) (<= 41 Main_y)), 213987#(and (<= 48 Main_y) (<= Main_y 48)), 213986#(and (<= 47 Main_y) (<= Main_y 47)), 213985#(and (<= 46 Main_y) (<= Main_y 46)), 213984#(and (<= Main_y 45) (<= 45 Main_y)), 213991#(and (<= 52 Main_y) (<= Main_y 52)), 213990#(and (<= 51 Main_y) (<= Main_y 51)), 213989#(and (<= 50 Main_y) (<= Main_y 50)), 213988#(and (<= 49 Main_y) (<= Main_y 49)), 213995#(and (<= Main_y 56) (<= 56 Main_y)), 213994#(and (<= 55 Main_y) (<= Main_y 55)), 213993#(and (<= 54 Main_y) (<= Main_y 54)), 213992#(and (<= 53 Main_y) (<= Main_y 53)), 213999#(and (<= Main_y 60) (<= 60 Main_y)), 213998#(and (<= Main_y 59) (<= 59 Main_y)), 213997#(and (<= Main_y 58) (<= 58 Main_y)), 213996#(and (<= Main_y 57) (<= 57 Main_y)), 214003#(and (<= 64 Main_y) (<= Main_y 64)), 214002#(and (<= 63 Main_y) (<= Main_y 63)), 214001#(and (<= 62 Main_y) (<= Main_y 62)), 214000#(and (<= Main_y 61) (<= 61 Main_y)), 214007#(and (<= 68 Main_y) (<= Main_y 68)), 214006#(and (<= 67 Main_y) (<= Main_y 67)), 214005#(and (<= Main_y 66) (<= 66 Main_y)), 214004#(and (<= Main_y 65) (<= 65 Main_y)), 214011#(and (<= 72 Main_y) (<= Main_y 72)), 214010#(and (<= Main_y 71) (<= 71 Main_y)), 214009#(and (<= 70 Main_y) (<= Main_y 70)), 214008#(and (<= Main_y 69) (<= 69 Main_y)), 214015#(and (<= Main_y 76) (<= 76 Main_y)), 214014#(and (<= Main_y 75) (<= 75 Main_y)), 214013#(and (<= 74 Main_y) (<= Main_y 74)), 214012#(and (<= 73 Main_y) (<= Main_y 73))] [2018-07-23 14:00:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:03,997 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 14:00:03,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 14:00:03,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 14:00:03,997 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 117 states. [2018-07-23 14:00:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:05,929 INFO L93 Difference]: Finished difference Result 353 states and 355 transitions. [2018-07-23 14:00:05,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 14:00:05,929 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 233 [2018-07-23 14:00:05,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:05,930 INFO L225 Difference]: With dead ends: 353 [2018-07-23 14:00:05,930 INFO L226 Difference]: Without dead ends: 350 [2018-07-23 14:00:05,931 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 14:00:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-07-23 14:00:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 236. [2018-07-23 14:00:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 14:00:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-07-23 14:00:06,182 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 233 [2018-07-23 14:00:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:06,182 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-07-23 14:00:06,182 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 14:00:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-07-23 14:00:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-23 14:00:06,182 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:06,183 INFO L357 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2018-07-23 14:00:06,183 INFO L414 AbstractCegarLoop]: === Iteration 344 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash -734456569, now seen corresponding path program 341 times [2018-07-23 14:00:06,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:06,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:06,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-23 14:00:06,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:06,780 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 14:00:06,780 INFO L185 omatonBuilderFactory]: Interpolants [215299#(<= Main_x 65), 215298#(<= Main_x 64), 215297#(<= Main_x 63), 215296#(<= Main_x 62), 215303#(<= Main_x 69), 215302#(<= Main_x 68), 215301#(<= Main_x 67), 215300#(<= Main_x 66), 215307#(<= Main_x 73), 215306#(<= Main_x 72), 215305#(<= Main_x 71), 215304#(<= Main_x 70), 215311#(<= Main_x 77), 215310#(<= Main_x 76), 215309#(<= Main_x 75), 215308#(<= Main_x 74), 215315#(<= Main_x 81), 215314#(<= Main_x 80), 215313#(<= Main_x 79), 215312#(<= Main_x 78), 215319#(<= Main_x 85), 215318#(<= Main_x 84), 215317#(<= Main_x 83), 215316#(<= Main_x 82), 215323#(<= Main_x 89), 215322#(<= Main_x 88), 215321#(<= Main_x 87), 215320#(<= Main_x 86), 215327#(<= Main_x 93), 215326#(<= Main_x 92), 215325#(<= Main_x 91), 215324#(<= Main_x 90), 215331#(<= Main_x 97), 215330#(<= Main_x 96), 215329#(<= Main_x 95), 215328#(<= Main_x 94), 215335#(<= Main_x 101), 215334#(<= Main_x 100), 215333#(<= Main_x 99), 215332#(<= Main_x 98), 215339#(<= Main_x 105), 215338#(<= Main_x 104), 215337#(<= Main_x 103), 215336#(<= Main_x 102), 215343#(<= Main_x 109), 215342#(<= Main_x 108), 215341#(<= Main_x 107), 215340#(<= Main_x 106), 215347#(<= Main_x 113), 215346#(<= Main_x 112), 215345#(<= Main_x 111), 215344#(<= Main_x 110), 215349#(<= (+ Main_x 1) 0), 215348#(<= Main_x 114), 215235#(<= Main_x 1), 215234#(<= Main_x 0), 215233#false, 215232#true, 215239#(<= Main_x 5), 215238#(<= Main_x 4), 215237#(<= Main_x 3), 215236#(<= Main_x 2), 215243#(<= Main_x 9), 215242#(<= Main_x 8), 215241#(<= Main_x 7), 215240#(<= Main_x 6), 215247#(<= Main_x 13), 215246#(<= Main_x 12), 215245#(<= Main_x 11), 215244#(<= Main_x 10), 215251#(<= Main_x 17), 215250#(<= Main_x 16), 215249#(<= Main_x 15), 215248#(<= Main_x 14), 215255#(<= Main_x 21), 215254#(<= Main_x 20), 215253#(<= Main_x 19), 215252#(<= Main_x 18), 215259#(<= Main_x 25), 215258#(<= Main_x 24), 215257#(<= Main_x 23), 215256#(<= Main_x 22), 215263#(<= Main_x 29), 215262#(<= Main_x 28), 215261#(<= Main_x 27), 215260#(<= Main_x 26), 215267#(<= Main_x 33), 215266#(<= Main_x 32), 215265#(<= Main_x 31), 215264#(<= Main_x 30), 215271#(<= Main_x 37), 215270#(<= Main_x 36), 215269#(<= Main_x 35), 215268#(<= Main_x 34), 215275#(<= Main_x 41), 215274#(<= Main_x 40), 215273#(<= Main_x 39), 215272#(<= Main_x 38), 215279#(<= Main_x 45), 215278#(<= Main_x 44), 215277#(<= Main_x 43), 215276#(<= Main_x 42), 215283#(<= Main_x 49), 215282#(<= Main_x 48), 215281#(<= Main_x 47), 215280#(<= Main_x 46), 215287#(<= Main_x 53), 215286#(<= Main_x 52), 215285#(<= Main_x 51), 215284#(<= Main_x 50), 215291#(<= Main_x 57), 215290#(<= Main_x 56), 215289#(<= Main_x 55), 215288#(<= Main_x 54), 215295#(<= Main_x 61), 215294#(<= Main_x 60), 215293#(<= Main_x 59), 215292#(<= Main_x 58)] [2018-07-23 14:00:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:06,780 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 14:00:06,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 14:00:06,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 14:00:06,781 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 118 states. [2018-07-23 14:00:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:07,390 INFO L93 Difference]: Finished difference Result 354 states and 356 transitions. [2018-07-23 14:00:07,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 14:00:07,390 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-23 14:00:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:07,391 INFO L225 Difference]: With dead ends: 354 [2018-07-23 14:00:07,391 INFO L226 Difference]: Without dead ends: 235 [2018-07-23 14:00:07,391 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 14:00:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-23 14:00:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-23 14:00:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-23 14:00:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-07-23 14:00:07,636 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 234 [2018-07-23 14:00:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:07,636 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-07-23 14:00:07,636 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 14:00:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-07-23 14:00:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-23 14:00:07,637 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:07,637 INFO L357 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2018-07-23 14:00:07,637 INFO L414 AbstractCegarLoop]: === Iteration 345 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1083162925, now seen corresponding path program 342 times [2018-07-23 14:00:07,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:08,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:08,274 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-23 14:00:08,274 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:08,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 14:00:08,274 INFO L185 omatonBuilderFactory]: Interpolants [216579#(<= 49 Main_x), 216578#(<= 48 Main_x), 216577#(<= 47 Main_x), 216576#(<= 46 Main_x), 216583#(<= 53 Main_x), 216582#(<= 52 Main_x), 216581#(<= 51 Main_x), 216580#(<= 50 Main_x), 216587#(<= 57 Main_x), 216586#(<= 56 Main_x), 216585#(<= 55 Main_x), 216584#(<= 54 Main_x), 216591#(<= 61 Main_x), 216590#(<= 60 Main_x), 216589#(<= 59 Main_x), 216588#(<= 58 Main_x), 216595#(<= 65 Main_x), 216594#(<= 64 Main_x), 216593#(<= 63 Main_x), 216592#(<= 62 Main_x), 216599#(<= 69 Main_x), 216598#(<= 68 Main_x), 216597#(<= 67 Main_x), 216596#(<= 66 Main_x), 216603#(<= 73 Main_x), 216602#(<= 72 Main_x), 216601#(<= 71 Main_x), 216600#(<= 70 Main_x), 216607#(<= 77 Main_x), 216606#(<= 76 Main_x), 216605#(<= 75 Main_x), 216604#(<= 74 Main_x), 216611#(<= 81 Main_x), 216610#(<= 80 Main_x), 216609#(<= 79 Main_x), 216608#(<= 78 Main_x), 216615#(<= 85 Main_x), 216614#(<= 84 Main_x), 216613#(<= 83 Main_x), 216612#(<= 82 Main_x), 216619#(<= 89 Main_x), 216618#(<= 88 Main_x), 216617#(<= 87 Main_x), 216616#(<= 86 Main_x), 216623#(<= 93 Main_x), 216622#(<= 92 Main_x), 216621#(<= 91 Main_x), 216620#(<= 90 Main_x), 216627#(<= 97 Main_x), 216626#(<= 96 Main_x), 216625#(<= 95 Main_x), 216624#(<= 94 Main_x), 216631#(<= 101 Main_x), 216630#(<= 100 Main_x), 216629#(<= 99 Main_x), 216628#(<= 98 Main_x), 216635#(<= 105 Main_x), 216634#(<= 104 Main_x), 216633#(<= 103 Main_x), 216632#(<= 102 Main_x), 216639#(<= 109 Main_x), 216638#(<= 108 Main_x), 216637#(<= 107 Main_x), 216636#(<= 106 Main_x), 216643#(<= 113 Main_x), 216642#(<= 112 Main_x), 216641#(<= 111 Main_x), 216640#(<= 110 Main_x), 216645#(<= 115 Main_x), 216644#(<= 114 Main_x), 216531#(<= 1 Main_x), 216530#(<= 0 Main_x), 216529#false, 216528#true, 216535#(<= 5 Main_x), 216534#(<= 4 Main_x), 216533#(<= 3 Main_x), 216532#(<= 2 Main_x), 216539#(<= 9 Main_x), 216538#(<= 8 Main_x), 216537#(<= 7 Main_x), 216536#(<= 6 Main_x), 216543#(<= 13 Main_x), 216542#(<= 12 Main_x), 216541#(<= 11 Main_x), 216540#(<= 10 Main_x), 216547#(<= 17 Main_x), 216546#(<= 16 Main_x), 216545#(<= 15 Main_x), 216544#(<= 14 Main_x), 216551#(<= 21 Main_x), 216550#(<= 20 Main_x), 216549#(<= 19 Main_x), 216548#(<= 18 Main_x), 216555#(<= 25 Main_x), 216554#(<= 24 Main_x), 216553#(<= 23 Main_x), 216552#(<= 22 Main_x), 216559#(<= 29 Main_x), 216558#(<= 28 Main_x), 216557#(<= 27 Main_x), 216556#(<= 26 Main_x), 216563#(<= 33 Main_x), 216562#(<= 32 Main_x), 216561#(<= 31 Main_x), 216560#(<= 30 Main_x), 216567#(<= 37 Main_x), 216566#(<= 36 Main_x), 216565#(<= 35 Main_x), 216564#(<= 34 Main_x), 216571#(<= 41 Main_x), 216570#(<= 40 Main_x), 216569#(<= 39 Main_x), 216568#(<= 38 Main_x), 216575#(<= 45 Main_x), 216574#(<= 44 Main_x), 216573#(<= 43 Main_x), 216572#(<= 42 Main_x)] [2018-07-23 14:00:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 6670 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:08,275 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 14:00:08,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 14:00:08,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 14:00:08,276 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 118 states. [2018-07-23 14:00:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:08,638 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-07-23 14:00:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 14:00:08,638 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-23 14:00:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:08,638 INFO L225 Difference]: With dead ends: 239 [2018-07-23 14:00:08,638 INFO L226 Difference]: Without dead ends: 236 [2018-07-23 14:00:08,639 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 14:00:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-07-23 14:00:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-07-23 14:00:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-23 14:00:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 237 transitions. [2018-07-23 14:00:08,883 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 237 transitions. Word has length 234 [2018-07-23 14:00:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:08,883 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 237 transitions. [2018-07-23 14:00:08,884 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 14:00:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 237 transitions. [2018-07-23 14:00:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-07-23 14:00:08,884 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:08,884 INFO L357 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1, 1, 1] [2018-07-23 14:00:08,884 INFO L414 AbstractCegarLoop]: === Iteration 346 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:08,884 INFO L82 PathProgramCache]: Analyzing trace with hash -781749215, now seen corresponding path program 343 times [2018-07-23 14:00:08,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:09,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:09,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 14:00:09,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:09,770 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 14:00:09,771 INFO L185 omatonBuilderFactory]: Interpolants [217603#(and (<= Main_y 5) (<= 5 Main_y)), 217602#(and (<= Main_y 4) (<= 4 Main_y)), 217601#(and (<= Main_y 3) (<= 3 Main_y)), 217600#(and (<= Main_y 2) (<= 2 Main_y)), 217607#(and (<= Main_y 9) (<= 9 Main_y)), 217606#(and (<= 8 Main_y) (<= Main_y 8)), 217605#(and (<= 7 Main_y) (<= Main_y 7)), 217604#(and (<= Main_y 6) (<= 6 Main_y)), 217611#(and (<= 13 Main_y) (<= Main_y 13)), 217610#(and (<= 12 Main_y) (<= Main_y 12)), 217609#(and (<= 11 Main_y) (<= Main_y 11)), 217608#(and (<= 10 Main_y) (<= Main_y 10)), 217615#(and (<= Main_y 17) (<= 17 Main_y)), 217614#(and (<= 16 Main_y) (<= Main_y 16)), 217613#(and (<= Main_y 15) (<= 15 Main_y)), 217612#(and (<= 14 Main_y) (<= Main_y 14)), 217619#(and (<= 21 Main_y) (<= Main_y 21)), 217618#(and (<= 20 Main_y) (<= Main_y 20)), 217617#(and (<= Main_y 19) (<= 19 Main_y)), 217616#(and (<= Main_y 18) (<= 18 Main_y)), 217623#(and (<= 25 Main_y) (<= Main_y 25)), 217622#(and (<= Main_y 24) (<= 24 Main_y)), 217621#(and (<= 23 Main_y) (<= Main_y 23)), 217620#(and (<= Main_y 22) (<= 22 Main_y)), 217627#(and (<= 29 Main_y) (<= Main_y 29)), 217626#(and (<= 28 Main_y) (<= Main_y 28)), 217625#(and (<= 27 Main_y) (<= Main_y 27)), 217624#(and (<= Main_y 26) (<= 26 Main_y)), 217631#(and (<= 33 Main_y) (<= Main_y 33)), 217630#(and (<= 32 Main_y) (<= Main_y 32)), 217629#(and (<= Main_y 31) (<= 31 Main_y)), 217628#(and (<= 30 Main_y) (<= Main_y 30)), 217635#(and (<= Main_y 37) (<= 37 Main_y)), 217634#(and (<= 36 Main_y) (<= Main_y 36)), 217633#(and (<= 35 Main_y) (<= Main_y 35)), 217632#(and (<= Main_y 34) (<= 34 Main_y)), 217639#(and (<= Main_y 41) (<= 41 Main_y)), 217638#(and (<= 40 Main_y) (<= Main_y 40)), 217637#(and (<= 39 Main_y) (<= Main_y 39)), 217636#(and (<= Main_y 38) (<= 38 Main_y)), 217643#(and (<= Main_y 45) (<= 45 Main_y)), 217642#(and (<= 44 Main_y) (<= Main_y 44)), 217641#(and (<= 43 Main_y) (<= Main_y 43)), 217640#(and (<= 42 Main_y) (<= Main_y 42)), 217647#(and (<= 49 Main_y) (<= Main_y 49)), 217646#(and (<= 48 Main_y) (<= Main_y 48)), 217645#(and (<= 47 Main_y) (<= Main_y 47)), 217644#(and (<= 46 Main_y) (<= Main_y 46)), 217651#(and (<= 53 Main_y) (<= Main_y 53)), 217650#(and (<= 52 Main_y) (<= Main_y 52)), 217649#(and (<= 51 Main_y) (<= Main_y 51)), 217648#(and (<= 50 Main_y) (<= Main_y 50)), 217655#(and (<= Main_y 57) (<= 57 Main_y)), 217654#(and (<= Main_y 56) (<= 56 Main_y)), 217653#(and (<= 55 Main_y) (<= Main_y 55)), 217652#(and (<= 54 Main_y) (<= Main_y 54)), 217659#(and (<= Main_y 61) (<= 61 Main_y)), 217658#(and (<= Main_y 60) (<= 60 Main_y)), 217657#(and (<= Main_y 59) (<= 59 Main_y)), 217656#(and (<= Main_y 58) (<= 58 Main_y)), 217663#(and (<= Main_y 65) (<= 65 Main_y)), 217662#(and (<= 64 Main_y) (<= Main_y 64)), 217661#(and (<= 63 Main_y) (<= Main_y 63)), 217660#(and (<= 62 Main_y) (<= Main_y 62)), 217667#(and (<= Main_y 69) (<= 69 Main_y)), 217666#(and (<= 68 Main_y) (<= Main_y 68)), 217665#(and (<= 67 Main_y) (<= Main_y 67)), 217664#(and (<= Main_y 66) (<= 66 Main_y)), 217671#(and (<= 73 Main_y) (<= Main_y 73)), 217670#(and (<= 72 Main_y) (<= Main_y 72)), 217669#(and (<= Main_y 71) (<= 71 Main_y)), 217668#(and (<= 70 Main_y) (<= Main_y 70)), 217675#(and (<= Main_y 77) (<= 77 Main_y)), 217674#(and (<= Main_y 76) (<= 76 Main_y)), 217673#(and (<= Main_y 75) (<= 75 Main_y)), 217672#(and (<= 74 Main_y) (<= Main_y 74)), 217679#(and (<= 81 Main_y) (<= Main_y 81)), 217678#(and (<= Main_y 80) (<= 80 Main_y)), 217677#(and (<= 79 Main_y) (<= Main_y 79)), 217676#(and (<= Main_y 78) (<= 78 Main_y)), 217683#(and (<= Main_y 85) (<= 85 Main_y)), 217682#(and (<= Main_y 84) (<= 84 Main_y)), 217681#(and (<= Main_y 83) (<= 83 Main_y)), 217680#(and (<= Main_y 82) (<= 82 Main_y)), 217687#(and (<= Main_y 89) (<= 89 Main_y)), 217686#(and (<= Main_y 88) (<= 88 Main_y)), 217685#(and (<= Main_y 87) (<= 87 Main_y)), 217684#(and (<= 86 Main_y) (<= Main_y 86)), 217691#(and (<= 93 Main_y) (<= Main_y 93)), 217690#(and (<= 92 Main_y) (<= Main_y 92)), 217689#(and (<= Main_y 91) (<= 91 Main_y)), 217688#(and (<= Main_y 90) (<= 90 Main_y)), 217695#(and (<= Main_y 97) (<= 97 Main_y)), 217694#(and (<= 96 Main_y) (<= Main_y 96)), 217693#(and (<= Main_y 95) (<= 95 Main_y)), 217692#(and (<= 94 Main_y) (<= Main_y 94)), 217699#(and (<= Main_y 101) (<= 101 Main_y)), 217698#(and (<= Main_y 100) (<= 100 Main_y)), 217697#(and (<= 99 Main_y) (<= Main_y 99)), 217696#(and (<= 98 Main_y) (<= Main_y 98)), 217703#(and (<= 105 Main_y) (<= Main_y 105)), 217702#(and (<= 104 Main_y) (<= Main_y 104)), 217701#(and (<= 103 Main_y) (<= Main_y 103)), 217700#(and (<= 102 Main_y) (<= Main_y 102)), 217707#(and (<= Main_y 109) (<= 109 Main_y)), 217706#(and (<= Main_y 108) (<= 108 Main_y)), 217705#(and (<= Main_y 107) (<= 107 Main_y)), 217704#(and (<= Main_y 106) (<= 106 Main_y)), 217711#(and (<= 113 Main_y) (<= Main_y 113)), 217710#(and (<= Main_y 112) (<= 112 Main_y)), 217709#(and (<= Main_y 111) (<= 111 Main_y)), 217708#(and (<= Main_y 110) (<= 110 Main_y)), 217713#(and (<= 115 Main_y) (<= Main_y 115)), 217712#(and (<= Main_y 114) (<= 114 Main_y)), 217599#(and (<= 1 Main_y) (<= Main_y 1)), 217598#(and (<= 0 Main_y) (<= Main_y 0)), 217597#false, 217596#true] [2018-07-23 14:00:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:09,771 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 14:00:09,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 14:00:09,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 14:00:09,772 INFO L87 Difference]: Start difference. First operand 236 states and 237 transitions. Second operand 118 states. [2018-07-23 14:00:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:11,783 INFO L93 Difference]: Finished difference Result 356 states and 358 transitions. [2018-07-23 14:00:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 14:00:11,784 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 235 [2018-07-23 14:00:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:11,784 INFO L225 Difference]: With dead ends: 356 [2018-07-23 14:00:11,784 INFO L226 Difference]: Without dead ends: 353 [2018-07-23 14:00:11,785 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 14:00:11,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-07-23 14:00:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 238. [2018-07-23 14:00:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-07-23 14:00:12,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2018-07-23 14:00:12,048 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 235 [2018-07-23 14:00:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:12,048 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 240 transitions. [2018-07-23 14:00:12,048 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 14:00:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 240 transitions. [2018-07-23 14:00:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-23 14:00:12,048 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:12,049 INFO L357 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2018-07-23 14:00:12,049 INFO L414 AbstractCegarLoop]: === Iteration 347 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1535516589, now seen corresponding path program 344 times [2018-07-23 14:00:12,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6786 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:12,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:12,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-23 14:00:12,659 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:12,659 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 14:00:12,659 INFO L185 omatonBuilderFactory]: Interpolants [218903#false, 218902#true, 218907#(<= Main_x 3), 218906#(<= Main_x 2), 218905#(<= Main_x 1), 218904#(<= Main_x 0), 218911#(<= Main_x 7), 218910#(<= Main_x 6), 218909#(<= Main_x 5), 218908#(<= Main_x 4), 218915#(<= Main_x 11), 218914#(<= Main_x 10), 218913#(<= Main_x 9), 218912#(<= Main_x 8), 218919#(<= Main_x 15), 218918#(<= Main_x 14), 218917#(<= Main_x 13), 218916#(<= Main_x 12), 218923#(<= Main_x 19), 218922#(<= Main_x 18), 218921#(<= Main_x 17), 218920#(<= Main_x 16), 218927#(<= Main_x 23), 218926#(<= Main_x 22), 218925#(<= Main_x 21), 218924#(<= Main_x 20), 218931#(<= Main_x 27), 218930#(<= Main_x 26), 218929#(<= Main_x 25), 218928#(<= Main_x 24), 218935#(<= Main_x 31), 218934#(<= Main_x 30), 218933#(<= Main_x 29), 218932#(<= Main_x 28), 218939#(<= Main_x 35), 218938#(<= Main_x 34), 218937#(<= Main_x 33), 218936#(<= Main_x 32), 218943#(<= Main_x 39), 218942#(<= Main_x 38), 218941#(<= Main_x 37), 218940#(<= Main_x 36), 218947#(<= Main_x 43), 218946#(<= Main_x 42), 218945#(<= Main_x 41), 218944#(<= Main_x 40), 218951#(<= Main_x 47), 218950#(<= Main_x 46), 218949#(<= Main_x 45), 218948#(<= Main_x 44), 218955#(<= Main_x 51), 218954#(<= Main_x 50), 218953#(<= Main_x 49), 218952#(<= Main_x 48), 218959#(<= Main_x 55), 218958#(<= Main_x 54), 218957#(<= Main_x 53), 218956#(<= Main_x 52), 218963#(<= Main_x 59), 218962#(<= Main_x 58), 218961#(<= Main_x 57), 218960#(<= Main_x 56), 218967#(<= Main_x 63), 218966#(<= Main_x 62), 218965#(<= Main_x 61), 218964#(<= Main_x 60), 218971#(<= Main_x 67), 218970#(<= Main_x 66), 218969#(<= Main_x 65), 218968#(<= Main_x 64), 218975#(<= Main_x 71), 218974#(<= Main_x 70), 218973#(<= Main_x 69), 218972#(<= Main_x 68), 218979#(<= Main_x 75), 218978#(<= Main_x 74), 218977#(<= Main_x 73), 218976#(<= Main_x 72), 218983#(<= Main_x 79), 218982#(<= Main_x 78), 218981#(<= Main_x 77), 218980#(<= Main_x 76), 218987#(<= Main_x 83), 218986#(<= Main_x 82), 218985#(<= Main_x 81), 218984#(<= Main_x 80), 218991#(<= Main_x 87), 218990#(<= Main_x 86), 218989#(<= Main_x 85), 218988#(<= Main_x 84), 218995#(<= Main_x 91), 218994#(<= Main_x 90), 218993#(<= Main_x 89), 218992#(<= Main_x 88), 218999#(<= Main_x 95), 218998#(<= Main_x 94), 218997#(<= Main_x 93), 218996#(<= Main_x 92), 219003#(<= Main_x 99), 219002#(<= Main_x 98), 219001#(<= Main_x 97), 219000#(<= Main_x 96), 219007#(<= Main_x 103), 219006#(<= Main_x 102), 219005#(<= Main_x 101), 219004#(<= Main_x 100), 219011#(<= Main_x 107), 219010#(<= Main_x 106), 219009#(<= Main_x 105), 219008#(<= Main_x 104), 219015#(<= Main_x 111), 219014#(<= Main_x 110), 219013#(<= Main_x 109), 219012#(<= Main_x 108), 219019#(<= Main_x 115), 219018#(<= Main_x 114), 219017#(<= Main_x 113), 219016#(<= Main_x 112), 219020#(<= (+ Main_x 1) 0)] [2018-07-23 14:00:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6786 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:12,660 INFO L450 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-23 14:00:12,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-23 14:00:12,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 14:00:12,661 INFO L87 Difference]: Start difference. First operand 238 states and 240 transitions. Second operand 119 states. [2018-07-23 14:00:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:13,387 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2018-07-23 14:00:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-23 14:00:13,387 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-23 14:00:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:13,388 INFO L225 Difference]: With dead ends: 357 [2018-07-23 14:00:13,388 INFO L226 Difference]: Without dead ends: 237 [2018-07-23 14:00:13,389 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 14:00:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-23 14:00:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-23 14:00:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-23 14:00:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-07-23 14:00:13,637 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 236 [2018-07-23 14:00:13,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:13,637 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-07-23 14:00:13,637 INFO L472 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-23 14:00:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-07-23 14:00:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-23 14:00:13,638 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:13,638 INFO L357 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2018-07-23 14:00:13,638 INFO L414 AbstractCegarLoop]: === Iteration 348 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2047146055, now seen corresponding path program 345 times [2018-07-23 14:00:13,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 14:00:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 14:00:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6786 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:14,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 14:00:14,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-23 14:00:14,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 14:00:14,294 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 14:00:14,294 INFO L185 omatonBuilderFactory]: Interpolants [220211#(<= 0 Main_x), 220210#false, 220209#true, 220215#(<= 4 Main_x), 220214#(<= 3 Main_x), 220213#(<= 2 Main_x), 220212#(<= 1 Main_x), 220219#(<= 8 Main_x), 220218#(<= 7 Main_x), 220217#(<= 6 Main_x), 220216#(<= 5 Main_x), 220223#(<= 12 Main_x), 220222#(<= 11 Main_x), 220221#(<= 10 Main_x), 220220#(<= 9 Main_x), 220227#(<= 16 Main_x), 220226#(<= 15 Main_x), 220225#(<= 14 Main_x), 220224#(<= 13 Main_x), 220231#(<= 20 Main_x), 220230#(<= 19 Main_x), 220229#(<= 18 Main_x), 220228#(<= 17 Main_x), 220235#(<= 24 Main_x), 220234#(<= 23 Main_x), 220233#(<= 22 Main_x), 220232#(<= 21 Main_x), 220239#(<= 28 Main_x), 220238#(<= 27 Main_x), 220237#(<= 26 Main_x), 220236#(<= 25 Main_x), 220243#(<= 32 Main_x), 220242#(<= 31 Main_x), 220241#(<= 30 Main_x), 220240#(<= 29 Main_x), 220247#(<= 36 Main_x), 220246#(<= 35 Main_x), 220245#(<= 34 Main_x), 220244#(<= 33 Main_x), 220251#(<= 40 Main_x), 220250#(<= 39 Main_x), 220249#(<= 38 Main_x), 220248#(<= 37 Main_x), 220255#(<= 44 Main_x), 220254#(<= 43 Main_x), 220253#(<= 42 Main_x), 220252#(<= 41 Main_x), 220259#(<= 48 Main_x), 220258#(<= 47 Main_x), 220257#(<= 46 Main_x), 220256#(<= 45 Main_x), 220263#(<= 52 Main_x), 220262#(<= 51 Main_x), 220261#(<= 50 Main_x), 220260#(<= 49 Main_x), 220267#(<= 56 Main_x), 220266#(<= 55 Main_x), 220265#(<= 54 Main_x), 220264#(<= 53 Main_x), 220271#(<= 60 Main_x), 220270#(<= 59 Main_x), 220269#(<= 58 Main_x), 220268#(<= 57 Main_x), 220275#(<= 64 Main_x), 220274#(<= 63 Main_x), 220273#(<= 62 Main_x), 220272#(<= 61 Main_x), 220279#(<= 68 Main_x), 220278#(<= 67 Main_x), 220277#(<= 66 Main_x), 220276#(<= 65 Main_x), 220283#(<= 72 Main_x), 220282#(<= 71 Main_x), 220281#(<= 70 Main_x), 220280#(<= 69 Main_x), 220287#(<= 76 Main_x), 220286#(<= 75 Main_x), 220285#(<= 74 Main_x), 220284#(<= 73 Main_x), 220291#(<= 80 Main_x), 220290#(<= 79 Main_x), 220289#(<= 78 Main_x), 220288#(<= 77 Main_x), 220295#(<= 84 Main_x), 220294#(<= 83 Main_x), 220293#(<= 82 Main_x), 220292#(<= 81 Main_x), 220299#(<= 88 Main_x), 220298#(<= 87 Main_x), 220297#(<= 86 Main_x), 220296#(<= 85 Main_x), 220303#(<= 92 Main_x), 220302#(<= 91 Main_x), 220301#(<= 90 Main_x), 220300#(<= 89 Main_x), 220307#(<= 96 Main_x), 220306#(<= 95 Main_x), 220305#(<= 94 Main_x), 220304#(<= 93 Main_x), 220311#(<= 100 Main_x), 220310#(<= 99 Main_x), 220309#(<= 98 Main_x), 220308#(<= 97 Main_x), 220315#(<= 104 Main_x), 220314#(<= 103 Main_x), 220313#(<= 102 Main_x), 220312#(<= 101 Main_x), 220319#(<= 108 Main_x), 220318#(<= 107 Main_x), 220317#(<= 106 Main_x), 220316#(<= 105 Main_x), 220323#(<= 112 Main_x), 220322#(<= 111 Main_x), 220321#(<= 110 Main_x), 220320#(<= 109 Main_x), 220327#(<= 116 Main_x), 220326#(<= 115 Main_x), 220325#(<= 114 Main_x), 220324#(<= 113 Main_x)] [2018-07-23 14:00:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 6786 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 14:00:14,295 INFO L450 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-23 14:00:14,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-23 14:00:14,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 14:00:14,296 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 119 states. [2018-07-23 14:00:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 14:00:14,638 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-07-23 14:00:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-23 14:00:14,638 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-23 14:00:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 14:00:14,638 INFO L225 Difference]: With dead ends: 241 [2018-07-23 14:00:14,638 INFO L226 Difference]: Without dead ends: 238 [2018-07-23 14:00:14,639 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 14:00:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-23 14:00:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-07-23 14:00:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-07-23 14:00:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 239 transitions. [2018-07-23 14:00:14,923 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 239 transitions. Word has length 236 [2018-07-23 14:00:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 14:00:14,923 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 239 transitions. [2018-07-23 14:00:14,923 INFO L472 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-23 14:00:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 239 transitions. [2018-07-23 14:00:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-07-23 14:00:14,923 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 14:00:14,924 INFO L357 BasicCegarLoop]: trace histogram [116, 116, 1, 1, 1, 1, 1] [2018-07-23 14:00:14,924 INFO L414 AbstractCegarLoop]: === Iteration 349 === [MainErr0AssertViolationASSERT, MainErr1AssertViolationASSERT]=== [2018-07-23 14:00:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash -963043257, now seen corresponding path program 346 times [2018-07-23 14:00:14,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2018-07-23 14:00:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-07-23 14:00:15,252 INFO L282 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-07-23 14:00:15,252 INFO L423 BasicCegarLoop]: Counterexample might be feasible [2018-07-23 14:00:15,281 WARN L205 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-07-23 14:00:15,281 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 02:00:15 BoogieIcfgContainer [2018-07-23 14:00:15,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 14:00:15,282 INFO L168 Benchmark]: Toolchain (without parser) took 254287.98 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 727.2 MB. Max. memory is 7.1 GB. [2018-07-23 14:00:15,284 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 14:00:15,284 INFO L168 Benchmark]: Boogie Preprocessor took 52.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 14:00:15,284 INFO L168 Benchmark]: RCFGBuilder took 243.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 14:00:15,285 INFO L168 Benchmark]: TraceAbstraction took 253986.79 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 716.7 MB. Max. memory is 7.1 GB. [2018-07-23 14:00:15,286 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 243.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253986.79 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 716.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 24]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L13] x := 0; [L14] y := 0; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [?] COND TRUE * [L16] x := x + 1; [L17] y := y + 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND TRUE x != 0 [L20] x := x - 1; [L21] y := y - 1; [L19] COND FALSE !(x != 0) [L23] assert x == 0; [L24] assert y == 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. UNKNOWN Result, 253.9s OverallTime, 349 OverallIterations, 116 TraceHistogramMax, 130.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1394 SDtfs, 3907 SDslu, 24154 SDs, 0 SdLazy, 1231370 SolverSat, 7597 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40830 GetRequests, 20126 SyntacticMatches, 115 SemanticMatches, 20589 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13340 ImplicationChecksByTransitivity, 43.4s Time, 0.3s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 533831/1574351 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 34.2s AutomataMinimizationTime, 348 MinimizatonAttempts, 6670 StatesRemovedByMinimization, 115 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 25.8s SatisfiabilityAnalysisTime, 55.8s InterpolantComputationTime, 42227 NumberOfCodeBlocks, 42227 NumberOfCodeBlocksAsserted, 349 NumberOfCheckSat, 41642 ConstructedInterpolants, 0 QuantifiedInterpolants, 28200890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 348 InterpolantComputations, 3 PerfectInterpolantSequences, 533831/1574351 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/doubleLoopUniformIterations.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_14-00-15-295.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/doubleLoopUniformIterations.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_14-00-15-295.csv Completed graceful shutdown