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/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:41:14,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:41:14,643 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:41:14,655 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:41:14,655 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:41:14,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:41:14,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:41:14,659 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:41:14,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:41:14,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:41:14,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:41:14,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:41:14,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:41:14,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:41:14,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:41:14,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:41:14,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:41:14,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:41:14,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:41:14,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:41:14,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:41:14,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:41:14,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:41:14,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:41:14,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:41:14,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:41:14,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:41:14,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:41:14,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:41:14,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:41:14,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:41:14,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:41:14,686 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:41:14,686 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:41:14,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:41:14,688 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:41:14,688 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:41:14,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:41:14,703 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:41:14,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:41:14,704 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:41:14,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:41:14,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:41:14,705 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:41:14,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:41:14,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:41:14,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:41:14,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:41:14,776 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:41:14,777 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:41:14,777 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-07-23 13:41:14,778 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-07-23 13:41:14,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:41:14,832 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:41:14,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:41:14,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:41:14,833 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:41:14,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:41:14,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:41:14,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:41:14,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:41:14,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/1) ... [2018-07-23 13:41:14,969 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-23 13:41:14,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:41:14,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:41:15,102 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:41:15,103 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:41:15 BoogieIcfgContainer [2018-07-23 13:41:15,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:41:15,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:41:15,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:41:15,108 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:41:15,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:41:14" (1/2) ... [2018-07-23 13:41:15,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2d5019 and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:41:15, skipping insertion in model container [2018-07-23 13:41:15,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:41:15" (2/2) ... [2018-07-23 13:41:15,113 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-07-23 13:41:15,123 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:41:15,131 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:41:15,182 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:41:15,183 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:41:15,183 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:41:15,183 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:41:15,183 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:41:15,184 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:41:15,184 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:41:15,184 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:41:15,184 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:41:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-07-23 13:41:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-23 13:41:15,210 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,211 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-23 13:41:15,211 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,217 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-07-23 13:41:15,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,311 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:41:15,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:41:15,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,315 INFO L185 omatonBuilderFactory]: Interpolants [8#true, 9#false, 10#(<= ULTIMATE.start_main_~x~4 0)] [2018-07-23 13:41:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,316 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:41:15,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:41:15,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:41:15,337 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-07-23 13:41:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,399 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-07-23 13:41:15,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:41:15,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-23 13:41:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,420 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:41:15,421 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:41:15,426 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:41:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:41:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-07-23 13:41:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 13:41:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-07-23 13:41:15,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-07-23 13:41:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,478 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-07-23 13:41:15,478 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:41:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-07-23 13:41:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-23 13:41:15,479 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,479 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-23 13:41:15,480 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,480 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-07-23 13:41:15,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,497 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:41:15,498 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:41:15,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:41:15,498 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,499 INFO L185 omatonBuilderFactory]: Interpolants [45#true, 46#false, 47#(<= ULTIMATE.start_main_~y~4 0)] [2018-07-23 13:41:15,499 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:41:15,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:41:15,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:41:15,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:41:15,502 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-07-23 13:41:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,517 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-07-23 13:41:15,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:41:15,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-07-23 13:41:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,518 INFO L225 Difference]: With dead ends: 11 [2018-07-23 13:41:15,519 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 13:41:15,520 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:41:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 13:41:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 13:41:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 13:41:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-07-23 13:41:15,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-07-23 13:41:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,524 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-07-23 13:41:15,524 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:41:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-07-23 13:41:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 13:41:15,525 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,525 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-23 13:41:15,525 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,526 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-07-23 13:41:15,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,550 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:15,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:41:15,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,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:41:15,551 INFO L185 omatonBuilderFactory]: Interpolants [84#true, 85#false, 86#(<= ULTIMATE.start_main_~y~4 0), 87#(<= ULTIMATE.start_main_~y~4 1)] [2018-07-23 13:41:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,552 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:41:15,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:41:15,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:41:15,553 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-07-23 13:41:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,568 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-07-23 13:41:15,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:41:15,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 13:41:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,569 INFO L225 Difference]: With dead ends: 13 [2018-07-23 13:41:15,569 INFO L226 Difference]: Without dead ends: 8 [2018-07-23 13:41:15,570 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:41:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-23 13:41:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-23 13:41:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-23 13:41:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-07-23 13:41:15,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-07-23 13:41:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,574 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-07-23 13:41:15,574 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:41:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-07-23 13:41:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 13:41:15,575 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,575 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-07-23 13:41:15,575 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-07-23 13:41:15,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:41:15,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:15,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 13:41:15,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,625 INFO L185 omatonBuilderFactory]: Interpolants [130#true, 131#false, 132#(<= ULTIMATE.start_main_~x~4 0), 133#(<= ULTIMATE.start_main_~x~4 1)] [2018-07-23 13:41:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-07-23 13:41:15,626 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:41:15,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:41:15,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:41:15,627 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-07-23 13:41:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,650 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-07-23 13:41:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:41:15,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-07-23 13:41:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,652 INFO L225 Difference]: With dead ends: 17 [2018-07-23 13:41:15,652 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 13:41:15,653 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:41:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 13:41:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-07-23 13:41:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-23 13:41:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-07-23 13:41:15,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-07-23 13:41:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,658 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-07-23 13:41:15,659 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:41:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-07-23 13:41:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-23 13:41:15,659 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,660 INFO L357 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-07-23 13:41:15,660 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,660 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-07-23 13:41:15,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,691 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-23 13:41:15,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:15,692 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:41:15,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:15,692 INFO L185 omatonBuilderFactory]: Interpolants [192#true, 193#false, 194#(<= ULTIMATE.start_main_~y~4 0), 195#(<= ULTIMATE.start_main_~y~4 1), 196#(<= ULTIMATE.start_main_~y~4 2)] [2018-07-23 13:41:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-23 13:41:15,693 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:41:15,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:41:15,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:41:15,694 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-07-23 13:41:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,724 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-07-23 13:41:15,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:41:15,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-07-23 13:41:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,726 INFO L225 Difference]: With dead ends: 21 [2018-07-23 13:41:15,726 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 13:41:15,726 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:41:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 13:41:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-23 13:41:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-23 13:41:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-07-23 13:41:15,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-07-23 13:41:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,732 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-07-23 13:41:15,732 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:41:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-07-23 13:41:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:41:15,733 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,733 INFO L357 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-07-23 13:41:15,733 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-07-23 13:41:15,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-23 13:41:15,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:15,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:41:15,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,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 13:41:15,780 INFO L185 omatonBuilderFactory]: Interpolants [272#(<= ULTIMATE.start_main_~y~4 3), 267#true, 268#false, 269#(<= ULTIMATE.start_main_~y~4 0), 270#(<= ULTIMATE.start_main_~y~4 1), 271#(<= ULTIMATE.start_main_~y~4 2)] [2018-07-23 13:41:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-23 13:41:15,781 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:41:15,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:41:15,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:41:15,782 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-07-23 13:41:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,798 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-07-23 13:41:15,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:41:15,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-07-23 13:41:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,800 INFO L225 Difference]: With dead ends: 24 [2018-07-23 13:41:15,800 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:41:15,801 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:41:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:41:15,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:41:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:41:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-07-23 13:41:15,806 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-07-23 13:41:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,807 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-07-23 13:41:15,807 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:41:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-07-23 13:41:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-23 13:41:15,808 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,808 INFO L357 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-07-23 13:41:15,808 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-07-23 13:41:15,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-07-23 13:41:15,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:15,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:41:15,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:15,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:41:15,856 INFO L185 omatonBuilderFactory]: Interpolants [353#true, 354#false, 355#(<= ULTIMATE.start_main_~x~4 0), 356#(<= ULTIMATE.start_main_~x~4 1), 357#(<= ULTIMATE.start_main_~x~4 2)] [2018-07-23 13:41:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-07-23 13:41:15,856 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:41:15,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:41:15,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:41:15,857 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-07-23 13:41:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:15,894 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-07-23 13:41:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:41:15,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-07-23 13:41:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:15,899 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:41:15,899 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 13:41:15,900 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:41:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 13:41:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-07-23 13:41:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-23 13:41:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-07-23 13:41:15,916 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 15 [2018-07-23 13:41:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:15,917 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-07-23 13:41:15,917 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:41:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-07-23 13:41:15,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-23 13:41:15,918 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:15,918 INFO L357 BasicCegarLoop]: trace histogram [12, 3, 3, 1, 1, 1] [2018-07-23 13:41:15,919 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:15,919 INFO L82 PathProgramCache]: Analyzing trace with hash -569669823, now seen corresponding path program 6 times [2018-07-23 13:41:15,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-23 13:41:16,015 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,015 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:41:16,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:16,016 INFO L185 omatonBuilderFactory]: Interpolants [464#(<= ULTIMATE.start_main_~x~4 2), 465#(<= ULTIMATE.start_main_~x~4 3), 460#true, 461#false, 462#(<= ULTIMATE.start_main_~x~4 0), 463#(<= ULTIMATE.start_main_~x~4 1)] [2018-07-23 13:41:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-07-23 13:41:16,017 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:41:16,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:41:16,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:41:16,021 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-07-23 13:41:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,074 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-07-23 13:41:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:41:16,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-07-23 13:41:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,076 INFO L225 Difference]: With dead ends: 35 [2018-07-23 13:41:16,076 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 13:41:16,077 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:41:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 13:41:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-07-23 13:41:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-23 13:41:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-07-23 13:41:16,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 21 [2018-07-23 13:41:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,095 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-07-23 13:41:16,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:41:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-07-23 13:41:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-23 13:41:16,097 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,098 INFO L357 BasicCegarLoop]: trace histogram [16, 4, 4, 1, 1, 1] [2018-07-23 13:41:16,098 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,098 INFO L82 PathProgramCache]: Analyzing trace with hash -384158805, now seen corresponding path program 7 times [2018-07-23 13:41:16,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-07-23 13:41:16,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:41:16,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,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:41:16,156 INFO L185 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(<= ULTIMATE.start_main_~y~4 0), 595#(<= ULTIMATE.start_main_~y~4 1), 596#(<= ULTIMATE.start_main_~y~4 2), 597#(<= ULTIMATE.start_main_~y~4 3), 598#(<= ULTIMATE.start_main_~y~4 4)] [2018-07-23 13:41:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-07-23 13:41:16,157 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:41:16,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:41:16,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:41:16,158 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2018-07-23 13:41:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,199 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-07-23 13:41:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:41:16,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-07-23 13:41:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,201 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:41:16,201 INFO L226 Difference]: Without dead ends: 32 [2018-07-23 13:41:16,204 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:41:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-23 13:41:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-23 13:41:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-23 13:41:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-07-23 13:41:16,217 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2018-07-23 13:41:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,218 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-07-23 13:41:16,218 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:41:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-07-23 13:41:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-23 13:41:16,220 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,220 INFO L357 BasicCegarLoop]: trace histogram [20, 4, 4, 1, 1, 1] [2018-07-23 13:41:16,221 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1897277373, now seen corresponding path program 8 times [2018-07-23 13:41:16,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-07-23 13:41:16,296 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,296 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:41:16,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,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:41:16,299 INFO L185 omatonBuilderFactory]: Interpolants [769#true, 770#false, 771#(<= ULTIMATE.start_main_~y~4 0), 772#(<= ULTIMATE.start_main_~y~4 1), 773#(<= ULTIMATE.start_main_~y~4 2), 774#(<= ULTIMATE.start_main_~y~4 3), 775#(<= ULTIMATE.start_main_~y~4 4), 776#(<= ULTIMATE.start_main_~y~4 5)] [2018-07-23 13:41:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 112 proven. 15 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-07-23 13:41:16,301 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:41:16,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:41:16,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:41:16,302 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-07-23 13:41:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,342 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-07-23 13:41:16,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:41:16,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-07-23 13:41:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,343 INFO L225 Difference]: With dead ends: 60 [2018-07-23 13:41:16,343 INFO L226 Difference]: Without dead ends: 36 [2018-07-23 13:41:16,344 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:41:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-23 13:41:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-23 13:41:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-23 13:41:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-07-23 13:41:16,353 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 31 [2018-07-23 13:41:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,354 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-07-23 13:41:16,354 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:41:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-07-23 13:41:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:41:16,355 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,355 INFO L357 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-07-23 13:41:16,356 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 9 times [2018-07-23 13:41:16,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,395 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-07-23 13:41:16,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:41:16,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:16,397 INFO L185 omatonBuilderFactory]: Interpolants [976#(<= ULTIMATE.start_main_~y~4 5), 977#(<= ULTIMATE.start_main_~y~4 6), 969#true, 970#false, 971#(<= ULTIMATE.start_main_~y~4 0), 972#(<= ULTIMATE.start_main_~y~4 1), 973#(<= ULTIMATE.start_main_~y~4 2), 974#(<= ULTIMATE.start_main_~y~4 3), 975#(<= ULTIMATE.start_main_~y~4 4)] [2018-07-23 13:41:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-07-23 13:41:16,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:41:16,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:41:16,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:41:16,400 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-07-23 13:41:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,418 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-07-23 13:41:16,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:41:16,418 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-07-23 13:41:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,419 INFO L225 Difference]: With dead ends: 67 [2018-07-23 13:41:16,419 INFO L226 Difference]: Without dead ends: 40 [2018-07-23 13:41:16,420 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:41:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-23 13:41:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-23 13:41:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-23 13:41:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-07-23 13:41:16,429 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-07-23 13:41:16,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,429 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-07-23 13:41:16,430 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:41:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-07-23 13:41:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-23 13:41:16,431 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,431 INFO L357 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-07-23 13:41:16,431 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 10 times [2018-07-23 13:41:16,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-07-23 13:41:16,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:41:16,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:16,500 INFO L185 omatonBuilderFactory]: Interpolants [1192#true, 1193#false, 1194#(<= ULTIMATE.start_main_~x~4 0), 1195#(<= ULTIMATE.start_main_~x~4 1), 1196#(<= ULTIMATE.start_main_~x~4 2), 1197#(<= ULTIMATE.start_main_~x~4 3), 1198#(<= ULTIMATE.start_main_~x~4 4)] [2018-07-23 13:41:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-07-23 13:41:16,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:41:16,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:41:16,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:41:16,502 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2018-07-23 13:41:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,545 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-07-23 13:41:16,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 13:41:16,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-07-23 13:41:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,548 INFO L225 Difference]: With dead ends: 59 [2018-07-23 13:41:16,548 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:41:16,549 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:41:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:41:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-07-23 13:41:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:41:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-07-23 13:41:16,575 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 39 [2018-07-23 13:41:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,575 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-07-23 13:41:16,575 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:41:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-07-23 13:41:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 13:41:16,577 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,577 INFO L357 BasicCegarLoop]: trace histogram [35, 5, 5, 1, 1, 1] [2018-07-23 13:41:16,578 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1933961390, now seen corresponding path program 11 times [2018-07-23 13:41:16,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 655 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-07-23 13:41:16,672 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,672 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:41:16,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:16,673 INFO L185 omatonBuilderFactory]: Interpolants [1415#true, 1416#false, 1417#(<= ULTIMATE.start_main_~x~4 0), 1418#(<= ULTIMATE.start_main_~x~4 1), 1419#(<= ULTIMATE.start_main_~x~4 2), 1420#(<= ULTIMATE.start_main_~x~4 3), 1421#(<= ULTIMATE.start_main_~x~4 4), 1422#(<= ULTIMATE.start_main_~x~4 5)] [2018-07-23 13:41:16,674 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 655 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-07-23 13:41:16,674 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 13:41:16,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 13:41:16,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:41:16,676 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-07-23 13:41:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,708 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-07-23 13:41:16,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:41:16,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-07-23 13:41:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,709 INFO L225 Difference]: With dead ends: 68 [2018-07-23 13:41:16,710 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 13:41:16,710 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:41:16,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 13:41:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2018-07-23 13:41:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-23 13:41:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-07-23 13:41:16,724 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 48 [2018-07-23 13:41:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,725 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-07-23 13:41:16,725 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 13:41:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-07-23 13:41:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-23 13:41:16,730 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,730 INFO L357 BasicCegarLoop]: trace histogram [42, 6, 6, 1, 1, 1] [2018-07-23 13:41:16,730 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash -529480157, now seen corresponding path program 12 times [2018-07-23 13:41:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 0 proven. 981 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-07-23 13:41:16,790 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,790 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 13:41:16,790 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:16,791 INFO L185 omatonBuilderFactory]: Interpolants [1680#(<= ULTIMATE.start_main_~x~4 3), 1681#(<= ULTIMATE.start_main_~x~4 4), 1682#(<= ULTIMATE.start_main_~x~4 5), 1683#(<= ULTIMATE.start_main_~x~4 6), 1675#true, 1676#false, 1677#(<= ULTIMATE.start_main_~x~4 0), 1678#(<= ULTIMATE.start_main_~x~4 1), 1679#(<= ULTIMATE.start_main_~x~4 2)] [2018-07-23 13:41:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1149 backedges. 0 proven. 981 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-07-23 13:41:16,793 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 13:41:16,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 13:41:16,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:41:16,794 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 9 states. [2018-07-23 13:41:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,821 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-07-23 13:41:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 13:41:16,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-07-23 13:41:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,823 INFO L225 Difference]: With dead ends: 77 [2018-07-23 13:41:16,823 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 13:41:16,824 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 13:41:16,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 13:41:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2018-07-23 13:41:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 13:41:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-07-23 13:41:16,839 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 57 [2018-07-23 13:41:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,840 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-07-23 13:41:16,840 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 13:41:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-07-23 13:41:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 13:41:16,842 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,842 INFO L357 BasicCegarLoop]: trace histogram [49, 7, 7, 1, 1, 1] [2018-07-23 13:41:16,842 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1363198898, now seen corresponding path program 13 times [2018-07-23 13:41:16,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 391 proven. 28 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-07-23 13:41:16,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:16,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:41:16,891 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:16,892 INFO L185 omatonBuilderFactory]: Interpolants [1972#true, 1973#false, 1974#(<= ULTIMATE.start_main_~y~4 0), 1975#(<= ULTIMATE.start_main_~y~4 1), 1976#(<= ULTIMATE.start_main_~y~4 2), 1977#(<= ULTIMATE.start_main_~y~4 3), 1978#(<= ULTIMATE.start_main_~y~4 4), 1979#(<= ULTIMATE.start_main_~y~4 5), 1980#(<= ULTIMATE.start_main_~y~4 6), 1981#(<= ULTIMATE.start_main_~y~4 7)] [2018-07-23 13:41:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 391 proven. 28 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-07-23 13:41:16,893 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:41:16,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:41:16,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:41:16,894 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 10 states. [2018-07-23 13:41:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:16,915 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2018-07-23 13:41:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:41:16,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-07-23 13:41:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:16,917 INFO L225 Difference]: With dead ends: 131 [2018-07-23 13:41:16,917 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 13:41:16,918 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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:41:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 13:41:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-23 13:41:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-23 13:41:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-07-23 13:41:16,933 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 66 [2018-07-23 13:41:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:16,933 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-07-23 13:41:16,933 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:41:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-07-23 13:41:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:41:16,935 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:16,935 INFO L357 BasicCegarLoop]: trace histogram [56, 7, 7, 1, 1, 1] [2018-07-23 13:41:16,935 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:16,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1515039575, now seen corresponding path program 14 times [2018-07-23 13:41:16,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-07-23 13:41:17,012 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:17,013 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 13:41:17,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:17,014 INFO L185 omatonBuilderFactory]: Interpolants [2400#(<= ULTIMATE.start_main_~x~4 6), 2401#(<= ULTIMATE.start_main_~x~4 7), 2392#true, 2393#false, 2394#(<= ULTIMATE.start_main_~x~4 0), 2395#(<= ULTIMATE.start_main_~x~4 1), 2396#(<= ULTIMATE.start_main_~x~4 2), 2397#(<= ULTIMATE.start_main_~x~4 3), 2398#(<= ULTIMATE.start_main_~x~4 4), 2399#(<= ULTIMATE.start_main_~x~4 5)] [2018-07-23 13:41:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1981 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-07-23 13:41:17,016 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 13:41:17,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 13:41:17,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:41:17,017 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 10 states. [2018-07-23 13:41:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,047 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-07-23 13:41:17,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 13:41:17,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-07-23 13:41:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,049 INFO L225 Difference]: With dead ends: 95 [2018-07-23 13:41:17,049 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 13:41:17,050 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 13:41:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 13:41:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-07-23 13:41:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-23 13:41:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-07-23 13:41:17,069 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 73 [2018-07-23 13:41:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,070 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-07-23 13:41:17,070 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 13:41:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-07-23 13:41:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:41:17,072 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,072 INFO L357 BasicCegarLoop]: trace histogram [64, 8, 8, 1, 1, 1] [2018-07-23 13:41:17,072 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash -603639725, now seen corresponding path program 15 times [2018-07-23 13:41:17,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 575 proven. 36 refuted. 0 times theorem prover too weak. 1981 trivial. 0 not checked. [2018-07-23 13:41:17,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:17,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:41:17,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:17,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:17,134 INFO L185 omatonBuilderFactory]: Interpolants [2768#(<= ULTIMATE.start_main_~y~4 6), 2769#(<= ULTIMATE.start_main_~y~4 7), 2770#(<= ULTIMATE.start_main_~y~4 8), 2760#true, 2761#false, 2762#(<= ULTIMATE.start_main_~y~4 0), 2763#(<= ULTIMATE.start_main_~y~4 1), 2764#(<= ULTIMATE.start_main_~y~4 2), 2765#(<= ULTIMATE.start_main_~y~4 3), 2766#(<= ULTIMATE.start_main_~y~4 4), 2767#(<= ULTIMATE.start_main_~y~4 5)] [2018-07-23 13:41:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 575 proven. 36 refuted. 0 times theorem prover too weak. 1981 trivial. 0 not checked. [2018-07-23 13:41:17,136 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:41:17,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:41:17,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:41:17,137 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 11 states. [2018-07-23 13:41:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,161 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2018-07-23 13:41:17,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:41:17,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-07-23 13:41:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,163 INFO L225 Difference]: With dead ends: 165 [2018-07-23 13:41:17,163 INFO L226 Difference]: Without dead ends: 92 [2018-07-23 13:41:17,164 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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:41:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-23 13:41:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-23 13:41:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-23 13:41:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-07-23 13:41:17,184 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 83 [2018-07-23 13:41:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,184 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-07-23 13:41:17,184 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:41:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-07-23 13:41:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-23 13:41:17,186 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,186 INFO L357 BasicCegarLoop]: trace histogram [72, 8, 8, 1, 1, 1] [2018-07-23 13:41:17,187 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1521070467, now seen corresponding path program 16 times [2018-07-23 13:41:17,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 2443 trivial. 0 not checked. [2018-07-23 13:41:17,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:17,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:41:17,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:17,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:41:17,255 INFO L185 omatonBuilderFactory]: Interpolants [3296#(<= ULTIMATE.start_main_~y~4 9), 3285#true, 3286#false, 3287#(<= ULTIMATE.start_main_~y~4 0), 3288#(<= ULTIMATE.start_main_~y~4 1), 3289#(<= ULTIMATE.start_main_~y~4 2), 3290#(<= ULTIMATE.start_main_~y~4 3), 3291#(<= ULTIMATE.start_main_~y~4 4), 3292#(<= ULTIMATE.start_main_~y~4 5), 3293#(<= ULTIMATE.start_main_~y~4 6), 3294#(<= ULTIMATE.start_main_~y~4 7), 3295#(<= ULTIMATE.start_main_~y~4 8)] [2018-07-23 13:41:17,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 2443 trivial. 0 not checked. [2018-07-23 13:41:17,257 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:41:17,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:41:17,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:17,258 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 12 states. [2018-07-23 13:41:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,286 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2018-07-23 13:41:17,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:41:17,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2018-07-23 13:41:17,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,287 INFO L225 Difference]: With dead ends: 180 [2018-07-23 13:41:17,287 INFO L226 Difference]: Without dead ends: 100 [2018-07-23 13:41:17,288 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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:41:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-23 13:41:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-23 13:41:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-23 13:41:17,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-07-23 13:41:17,311 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 91 [2018-07-23 13:41:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,312 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-07-23 13:41:17,312 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:41:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-07-23 13:41:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-23 13:41:17,314 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,314 INFO L357 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-07-23 13:41:17,314 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,314 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 17 times [2018-07-23 13:41:17,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-07-23 13:41:17,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:17,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 13:41:17,425 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:17,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:17,425 INFO L185 omatonBuilderFactory]: Interpolants [3857#true, 3858#false, 3859#(<= ULTIMATE.start_main_~x~4 0), 3860#(<= ULTIMATE.start_main_~x~4 1), 3861#(<= ULTIMATE.start_main_~x~4 2), 3862#(<= ULTIMATE.start_main_~x~4 3), 3863#(<= ULTIMATE.start_main_~x~4 4), 3864#(<= ULTIMATE.start_main_~x~4 5), 3865#(<= ULTIMATE.start_main_~x~4 6), 3866#(<= ULTIMATE.start_main_~x~4 7), 3867#(<= ULTIMATE.start_main_~x~4 8)] [2018-07-23 13:41:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-07-23 13:41:17,429 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 13:41:17,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 13:41:17,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:41:17,430 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-07-23 13:41:17,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,466 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-07-23 13:41:17,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 13:41:17,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-07-23 13:41:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,468 INFO L225 Difference]: With dead ends: 125 [2018-07-23 13:41:17,468 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 13:41:17,469 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 13:41:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 13:41:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-07-23 13:41:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-23 13:41:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-07-23 13:41:17,489 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-07-23 13:41:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,490 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-07-23 13:41:17,490 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 13:41:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-07-23 13:41:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-23 13:41:17,492 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,492 INFO L357 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-07-23 13:41:17,492 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 18 times [2018-07-23 13:41:17,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-07-23 13:41:17,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:17,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 13:41:17,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:17,605 INFO L185 omatonBuilderFactory]: Interpolants [4352#(<= ULTIMATE.start_main_~x~4 8), 4353#(<= ULTIMATE.start_main_~x~4 9), 4342#true, 4343#false, 4344#(<= ULTIMATE.start_main_~x~4 0), 4345#(<= ULTIMATE.start_main_~x~4 1), 4346#(<= ULTIMATE.start_main_~x~4 2), 4347#(<= ULTIMATE.start_main_~x~4 3), 4348#(<= ULTIMATE.start_main_~x~4 4), 4349#(<= ULTIMATE.start_main_~x~4 5), 4350#(<= ULTIMATE.start_main_~x~4 6), 4351#(<= ULTIMATE.start_main_~x~4 7)] [2018-07-23 13:41:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-07-23 13:41:17,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 13:41:17,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 13:41:17,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:17,618 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-07-23 13:41:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,661 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-07-23 13:41:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 13:41:17,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-07-23 13:41:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,662 INFO L225 Difference]: With dead ends: 137 [2018-07-23 13:41:17,663 INFO L226 Difference]: Without dead ends: 135 [2018-07-23 13:41:17,663 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 13:41:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-23 13:41:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-07-23 13:41:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-23 13:41:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-07-23 13:41:17,688 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-07-23 13:41:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,688 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-07-23 13:41:17,688 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 13:41:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-07-23 13:41:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-23 13:41:17,690 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,690 INFO L357 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-07-23 13:41:17,690 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 19 times [2018-07-23 13:41:17,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-07-23 13:41:17,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:17,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 13:41:17,826 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:17,827 INFO L185 omatonBuilderFactory]: Interpolants [4876#true, 4877#false, 4878#(<= ULTIMATE.start_main_~x~4 0), 4879#(<= ULTIMATE.start_main_~x~4 1), 4880#(<= ULTIMATE.start_main_~x~4 2), 4881#(<= ULTIMATE.start_main_~x~4 3), 4882#(<= ULTIMATE.start_main_~x~4 4), 4883#(<= ULTIMATE.start_main_~x~4 5), 4884#(<= ULTIMATE.start_main_~x~4 6), 4885#(<= ULTIMATE.start_main_~x~4 7), 4886#(<= ULTIMATE.start_main_~x~4 8), 4887#(<= ULTIMATE.start_main_~x~4 9), 4888#(<= ULTIMATE.start_main_~x~4 10)] [2018-07-23 13:41:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-07-23 13:41:17,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 13:41:17,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 13:41:17,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:41:17,832 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-07-23 13:41:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:17,881 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-07-23 13:41:17,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 13:41:17,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-07-23 13:41:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:17,883 INFO L225 Difference]: With dead ends: 149 [2018-07-23 13:41:17,883 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 13:41:17,884 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 13:41:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 13:41:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-07-23 13:41:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-23 13:41:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-07-23 13:41:17,915 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-07-23 13:41:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:17,915 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-07-23 13:41:17,915 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 13:41:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-07-23 13:41:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-23 13:41:17,917 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:17,917 INFO L357 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-07-23 13:41:17,917 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 20 times [2018-07-23 13:41:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-07-23 13:41:18,058 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:18,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 13:41:18,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:18,063 INFO L185 omatonBuilderFactory]: Interpolants [5472#(<= ULTIMATE.start_main_~x~4 11), 5459#true, 5460#false, 5461#(<= ULTIMATE.start_main_~x~4 0), 5462#(<= ULTIMATE.start_main_~x~4 1), 5463#(<= ULTIMATE.start_main_~x~4 2), 5464#(<= ULTIMATE.start_main_~x~4 3), 5465#(<= ULTIMATE.start_main_~x~4 4), 5466#(<= ULTIMATE.start_main_~x~4 5), 5467#(<= ULTIMATE.start_main_~x~4 6), 5468#(<= ULTIMATE.start_main_~x~4 7), 5469#(<= ULTIMATE.start_main_~x~4 8), 5470#(<= ULTIMATE.start_main_~x~4 9), 5471#(<= ULTIMATE.start_main_~x~4 10)] [2018-07-23 13:41:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-07-23 13:41:18,064 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 13:41:18,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 13:41:18,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:41:18,065 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-07-23 13:41:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:18,123 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-07-23 13:41:18,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 13:41:18,125 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-07-23 13:41:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:18,127 INFO L225 Difference]: With dead ends: 161 [2018-07-23 13:41:18,127 INFO L226 Difference]: Without dead ends: 159 [2018-07-23 13:41:18,128 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 13:41:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-23 13:41:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-07-23 13:41:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-23 13:41:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-07-23 13:41:18,169 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-07-23 13:41:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:18,170 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-07-23 13:41:18,170 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 13:41:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-07-23 13:41:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-23 13:41:18,172 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:18,172 INFO L357 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-07-23 13:41:18,172 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 21 times [2018-07-23 13:41:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-07-23 13:41:18,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:18,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 13:41:18,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:18,376 INFO L185 omatonBuilderFactory]: Interpolants [6091#true, 6092#false, 6093#(<= ULTIMATE.start_main_~x~4 0), 6094#(<= ULTIMATE.start_main_~x~4 1), 6095#(<= ULTIMATE.start_main_~x~4 2), 6096#(<= ULTIMATE.start_main_~x~4 3), 6097#(<= ULTIMATE.start_main_~x~4 4), 6098#(<= ULTIMATE.start_main_~x~4 5), 6099#(<= ULTIMATE.start_main_~x~4 6), 6100#(<= ULTIMATE.start_main_~x~4 7), 6101#(<= ULTIMATE.start_main_~x~4 8), 6102#(<= ULTIMATE.start_main_~x~4 9), 6103#(<= ULTIMATE.start_main_~x~4 10), 6104#(<= ULTIMATE.start_main_~x~4 11), 6105#(<= ULTIMATE.start_main_~x~4 12)] [2018-07-23 13:41:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-07-23 13:41:18,378 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 13:41:18,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 13:41:18,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:41:18,379 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-07-23 13:41:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:18,452 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-07-23 13:41:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 13:41:18,453 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-07-23 13:41:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:18,455 INFO L225 Difference]: With dead ends: 173 [2018-07-23 13:41:18,455 INFO L226 Difference]: Without dead ends: 171 [2018-07-23 13:41:18,455 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 13:41:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-23 13:41:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-07-23 13:41:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-23 13:41:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-07-23 13:41:18,501 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-07-23 13:41:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:18,502 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-07-23 13:41:18,502 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 13:41:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-07-23 13:41:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-23 13:41:18,504 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:18,504 INFO L357 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-07-23 13:41:18,504 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:18,504 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 22 times [2018-07-23 13:41:18,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-07-23 13:41:18,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:18,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 13:41:18,734 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:18,734 INFO L185 omatonBuilderFactory]: Interpolants [6784#(<= ULTIMATE.start_main_~x~4 10), 6785#(<= ULTIMATE.start_main_~x~4 11), 6786#(<= ULTIMATE.start_main_~x~4 12), 6787#(<= ULTIMATE.start_main_~x~4 13), 6772#true, 6773#false, 6774#(<= ULTIMATE.start_main_~x~4 0), 6775#(<= ULTIMATE.start_main_~x~4 1), 6776#(<= ULTIMATE.start_main_~x~4 2), 6777#(<= ULTIMATE.start_main_~x~4 3), 6778#(<= ULTIMATE.start_main_~x~4 4), 6779#(<= ULTIMATE.start_main_~x~4 5), 6780#(<= ULTIMATE.start_main_~x~4 6), 6781#(<= ULTIMATE.start_main_~x~4 7), 6782#(<= ULTIMATE.start_main_~x~4 8), 6783#(<= ULTIMATE.start_main_~x~4 9)] [2018-07-23 13:41:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-07-23 13:41:18,736 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 13:41:18,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 13:41:18,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:41:18,736 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-07-23 13:41:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:18,800 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-07-23 13:41:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 13:41:18,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-07-23 13:41:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:18,802 INFO L225 Difference]: With dead ends: 185 [2018-07-23 13:41:18,802 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 13:41:18,803 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 13:41:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 13:41:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-07-23 13:41:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-23 13:41:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-07-23 13:41:18,843 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-07-23 13:41:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:18,844 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-07-23 13:41:18,844 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 13:41:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-07-23 13:41:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-23 13:41:18,846 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:18,846 INFO L357 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-07-23 13:41:18,846 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 23 times [2018-07-23 13:41:18,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-07-23 13:41:18,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:18,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 13:41:18,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:18,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:41:18,985 INFO L185 omatonBuilderFactory]: Interpolants [7502#true, 7503#false, 7504#(<= ULTIMATE.start_main_~x~4 0), 7505#(<= ULTIMATE.start_main_~x~4 1), 7506#(<= ULTIMATE.start_main_~x~4 2), 7507#(<= ULTIMATE.start_main_~x~4 3), 7508#(<= ULTIMATE.start_main_~x~4 4), 7509#(<= ULTIMATE.start_main_~x~4 5), 7510#(<= ULTIMATE.start_main_~x~4 6), 7511#(<= ULTIMATE.start_main_~x~4 7), 7512#(<= ULTIMATE.start_main_~x~4 8), 7513#(<= ULTIMATE.start_main_~x~4 9), 7514#(<= ULTIMATE.start_main_~x~4 10), 7515#(<= ULTIMATE.start_main_~x~4 11), 7516#(<= ULTIMATE.start_main_~x~4 12), 7517#(<= ULTIMATE.start_main_~x~4 13), 7518#(<= ULTIMATE.start_main_~x~4 14)] [2018-07-23 13:41:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-07-23 13:41:18,987 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 13:41:18,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 13:41:18,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:41:18,988 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-07-23 13:41:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:19,066 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-07-23 13:41:19,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 13:41:19,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-07-23 13:41:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:19,068 INFO L225 Difference]: With dead ends: 197 [2018-07-23 13:41:19,068 INFO L226 Difference]: Without dead ends: 195 [2018-07-23 13:41:19,069 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 13:41:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-23 13:41:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-07-23 13:41:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-23 13:41:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-07-23 13:41:19,117 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-07-23 13:41:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:19,118 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-07-23 13:41:19,118 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 13:41:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-07-23 13:41:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-23 13:41:19,120 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:19,120 INFO L357 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-07-23 13:41:19,120 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:19,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 24 times [2018-07-23 13:41:19,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-07-23 13:41:19,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:19,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 13:41:19,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:19,289 INFO L185 omatonBuilderFactory]: Interpolants [8288#(<= ULTIMATE.start_main_~x~4 5), 8289#(<= ULTIMATE.start_main_~x~4 6), 8290#(<= ULTIMATE.start_main_~x~4 7), 8291#(<= ULTIMATE.start_main_~x~4 8), 8292#(<= ULTIMATE.start_main_~x~4 9), 8293#(<= ULTIMATE.start_main_~x~4 10), 8294#(<= ULTIMATE.start_main_~x~4 11), 8295#(<= ULTIMATE.start_main_~x~4 12), 8296#(<= ULTIMATE.start_main_~x~4 13), 8297#(<= ULTIMATE.start_main_~x~4 14), 8298#(<= ULTIMATE.start_main_~x~4 15), 8281#true, 8282#false, 8283#(<= ULTIMATE.start_main_~x~4 0), 8284#(<= ULTIMATE.start_main_~x~4 1), 8285#(<= ULTIMATE.start_main_~x~4 2), 8286#(<= ULTIMATE.start_main_~x~4 3), 8287#(<= ULTIMATE.start_main_~x~4 4)] [2018-07-23 13:41:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-07-23 13:41:19,290 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 13:41:19,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 13:41:19,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:41:19,291 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-07-23 13:41:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:19,379 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-07-23 13:41:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 13:41:19,380 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-07-23 13:41:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:19,381 INFO L225 Difference]: With dead ends: 209 [2018-07-23 13:41:19,381 INFO L226 Difference]: Without dead ends: 207 [2018-07-23 13:41:19,382 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 13:41:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-23 13:41:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-07-23 13:41:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-23 13:41:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-07-23 13:41:19,433 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-07-23 13:41:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:19,434 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-07-23 13:41:19,434 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 13:41:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-07-23 13:41:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-23 13:41:19,436 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:19,436 INFO L357 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-07-23 13:41:19,436 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 25 times [2018-07-23 13:41:19,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-07-23 13:41:19,598 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:19,599 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 13:41:19,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:19,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:41:19,600 INFO L185 omatonBuilderFactory]: Interpolants [9120#(<= ULTIMATE.start_main_~x~4 9), 9121#(<= ULTIMATE.start_main_~x~4 10), 9122#(<= ULTIMATE.start_main_~x~4 11), 9123#(<= ULTIMATE.start_main_~x~4 12), 9124#(<= ULTIMATE.start_main_~x~4 13), 9125#(<= ULTIMATE.start_main_~x~4 14), 9126#(<= ULTIMATE.start_main_~x~4 15), 9127#(<= ULTIMATE.start_main_~x~4 16), 9109#true, 9110#false, 9111#(<= ULTIMATE.start_main_~x~4 0), 9112#(<= ULTIMATE.start_main_~x~4 1), 9113#(<= ULTIMATE.start_main_~x~4 2), 9114#(<= ULTIMATE.start_main_~x~4 3), 9115#(<= ULTIMATE.start_main_~x~4 4), 9116#(<= ULTIMATE.start_main_~x~4 5), 9117#(<= ULTIMATE.start_main_~x~4 6), 9118#(<= ULTIMATE.start_main_~x~4 7), 9119#(<= ULTIMATE.start_main_~x~4 8)] [2018-07-23 13:41:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-07-23 13:41:19,601 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 13:41:19,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 13:41:19,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:41:19,602 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-07-23 13:41:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:19,688 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-07-23 13:41:19,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 13:41:19,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-07-23 13:41:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:19,690 INFO L225 Difference]: With dead ends: 221 [2018-07-23 13:41:19,690 INFO L226 Difference]: Without dead ends: 219 [2018-07-23 13:41:19,691 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 13:41:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-23 13:41:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-07-23 13:41:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-23 13:41:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-07-23 13:41:19,750 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-07-23 13:41:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:19,750 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-07-23 13:41:19,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 13:41:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-07-23 13:41:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-23 13:41:19,753 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:19,753 INFO L357 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-07-23 13:41:19,753 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 26 times [2018-07-23 13:41:19,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-07-23 13:41:19,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:19,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 13:41:19,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:19,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:19,929 INFO L185 omatonBuilderFactory]: Interpolants [9986#true, 9987#false, 9988#(<= ULTIMATE.start_main_~x~4 0), 9989#(<= ULTIMATE.start_main_~x~4 1), 9990#(<= ULTIMATE.start_main_~x~4 2), 9991#(<= ULTIMATE.start_main_~x~4 3), 9992#(<= ULTIMATE.start_main_~x~4 4), 9993#(<= ULTIMATE.start_main_~x~4 5), 9994#(<= ULTIMATE.start_main_~x~4 6), 9995#(<= ULTIMATE.start_main_~x~4 7), 9996#(<= ULTIMATE.start_main_~x~4 8), 9997#(<= ULTIMATE.start_main_~x~4 9), 9998#(<= ULTIMATE.start_main_~x~4 10), 9999#(<= ULTIMATE.start_main_~x~4 11), 10000#(<= ULTIMATE.start_main_~x~4 12), 10001#(<= ULTIMATE.start_main_~x~4 13), 10002#(<= ULTIMATE.start_main_~x~4 14), 10003#(<= ULTIMATE.start_main_~x~4 15), 10004#(<= ULTIMATE.start_main_~x~4 16), 10005#(<= ULTIMATE.start_main_~x~4 17)] [2018-07-23 13:41:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-07-23 13:41:19,931 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 13:41:19,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 13:41:19,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:41:19,932 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-07-23 13:41:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:20,029 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-07-23 13:41:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 13:41:20,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-07-23 13:41:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:20,031 INFO L225 Difference]: With dead ends: 233 [2018-07-23 13:41:20,031 INFO L226 Difference]: Without dead ends: 231 [2018-07-23 13:41:20,032 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 13:41:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-23 13:41:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-07-23 13:41:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-07-23 13:41:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-07-23 13:41:20,093 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-07-23 13:41:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:20,094 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-07-23 13:41:20,094 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 13:41:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-07-23 13:41:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-07-23 13:41:20,096 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:20,097 INFO L357 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-07-23 13:41:20,097 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 27 times [2018-07-23 13:41:20,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-07-23 13:41:20,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:20,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 13:41:20,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:20,314 INFO L185 omatonBuilderFactory]: Interpolants [10912#true, 10913#false, 10914#(<= ULTIMATE.start_main_~x~4 0), 10915#(<= ULTIMATE.start_main_~x~4 1), 10916#(<= ULTIMATE.start_main_~x~4 2), 10917#(<= ULTIMATE.start_main_~x~4 3), 10918#(<= ULTIMATE.start_main_~x~4 4), 10919#(<= ULTIMATE.start_main_~x~4 5), 10920#(<= ULTIMATE.start_main_~x~4 6), 10921#(<= ULTIMATE.start_main_~x~4 7), 10922#(<= ULTIMATE.start_main_~x~4 8), 10923#(<= ULTIMATE.start_main_~x~4 9), 10924#(<= ULTIMATE.start_main_~x~4 10), 10925#(<= ULTIMATE.start_main_~x~4 11), 10926#(<= ULTIMATE.start_main_~x~4 12), 10927#(<= ULTIMATE.start_main_~x~4 13), 10928#(<= ULTIMATE.start_main_~x~4 14), 10929#(<= ULTIMATE.start_main_~x~4 15), 10930#(<= ULTIMATE.start_main_~x~4 16), 10931#(<= ULTIMATE.start_main_~x~4 17), 10932#(<= ULTIMATE.start_main_~x~4 18)] [2018-07-23 13:41:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-07-23 13:41:20,317 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 13:41:20,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 13:41:20,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:41:20,318 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-07-23 13:41:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:20,438 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-07-23 13:41:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 13:41:20,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-07-23 13:41:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:20,441 INFO L225 Difference]: With dead ends: 245 [2018-07-23 13:41:20,441 INFO L226 Difference]: Without dead ends: 243 [2018-07-23 13:41:20,442 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 13:41:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-23 13:41:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-07-23 13:41:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-07-23 13:41:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-07-23 13:41:20,529 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-07-23 13:41:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:20,530 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-07-23 13:41:20,530 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 13:41:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-07-23 13:41:20,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-07-23 13:41:20,533 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:20,534 INFO L357 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-07-23 13:41:20,534 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:20,534 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 28 times [2018-07-23 13:41:20,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-07-23 13:41:20,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:20,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 13:41:20,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:20,794 INFO L185 omatonBuilderFactory]: Interpolants [11904#(<= ULTIMATE.start_main_~x~4 15), 11905#(<= ULTIMATE.start_main_~x~4 16), 11906#(<= ULTIMATE.start_main_~x~4 17), 11907#(<= ULTIMATE.start_main_~x~4 18), 11908#(<= ULTIMATE.start_main_~x~4 19), 11887#true, 11888#false, 11889#(<= ULTIMATE.start_main_~x~4 0), 11890#(<= ULTIMATE.start_main_~x~4 1), 11891#(<= ULTIMATE.start_main_~x~4 2), 11892#(<= ULTIMATE.start_main_~x~4 3), 11893#(<= ULTIMATE.start_main_~x~4 4), 11894#(<= ULTIMATE.start_main_~x~4 5), 11895#(<= ULTIMATE.start_main_~x~4 6), 11896#(<= ULTIMATE.start_main_~x~4 7), 11897#(<= ULTIMATE.start_main_~x~4 8), 11898#(<= ULTIMATE.start_main_~x~4 9), 11899#(<= ULTIMATE.start_main_~x~4 10), 11900#(<= ULTIMATE.start_main_~x~4 11), 11901#(<= ULTIMATE.start_main_~x~4 12), 11902#(<= ULTIMATE.start_main_~x~4 13), 11903#(<= ULTIMATE.start_main_~x~4 14)] [2018-07-23 13:41:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-07-23 13:41:20,798 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 13:41:20,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 13:41:20,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:41:20,799 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-07-23 13:41:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:20,914 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-07-23 13:41:20,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 13:41:20,914 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-07-23 13:41:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:20,916 INFO L225 Difference]: With dead ends: 257 [2018-07-23 13:41:20,916 INFO L226 Difference]: Without dead ends: 255 [2018-07-23 13:41:20,917 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 13:41:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-23 13:41:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-07-23 13:41:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-07-23 13:41:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-07-23 13:41:21,001 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-07-23 13:41:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:21,001 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-07-23 13:41:21,002 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 13:41:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-07-23 13:41:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-07-23 13:41:21,004 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:21,005 INFO L357 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-07-23 13:41:21,005 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 29 times [2018-07-23 13:41:21,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-07-23 13:41:21,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:21,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 13:41:21,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:21,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:41:21,223 INFO L185 omatonBuilderFactory]: Interpolants [12928#(<= ULTIMATE.start_main_~x~4 15), 12929#(<= ULTIMATE.start_main_~x~4 16), 12930#(<= ULTIMATE.start_main_~x~4 17), 12931#(<= ULTIMATE.start_main_~x~4 18), 12932#(<= ULTIMATE.start_main_~x~4 19), 12933#(<= ULTIMATE.start_main_~x~4 20), 12911#true, 12912#false, 12913#(<= ULTIMATE.start_main_~x~4 0), 12914#(<= ULTIMATE.start_main_~x~4 1), 12915#(<= ULTIMATE.start_main_~x~4 2), 12916#(<= ULTIMATE.start_main_~x~4 3), 12917#(<= ULTIMATE.start_main_~x~4 4), 12918#(<= ULTIMATE.start_main_~x~4 5), 12919#(<= ULTIMATE.start_main_~x~4 6), 12920#(<= ULTIMATE.start_main_~x~4 7), 12921#(<= ULTIMATE.start_main_~x~4 8), 12922#(<= ULTIMATE.start_main_~x~4 9), 12923#(<= ULTIMATE.start_main_~x~4 10), 12924#(<= ULTIMATE.start_main_~x~4 11), 12925#(<= ULTIMATE.start_main_~x~4 12), 12926#(<= ULTIMATE.start_main_~x~4 13), 12927#(<= ULTIMATE.start_main_~x~4 14)] [2018-07-23 13:41:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-07-23 13:41:21,227 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 13:41:21,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 13:41:21,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:41:21,228 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-07-23 13:41:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:21,351 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-07-23 13:41:21,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 13:41:21,351 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-07-23 13:41:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:21,353 INFO L225 Difference]: With dead ends: 269 [2018-07-23 13:41:21,353 INFO L226 Difference]: Without dead ends: 267 [2018-07-23 13:41:21,354 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 13:41:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-23 13:41:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-07-23 13:41:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-23 13:41:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-07-23 13:41:21,440 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-07-23 13:41:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:21,441 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-07-23 13:41:21,441 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 13:41:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-07-23 13:41:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-07-23 13:41:21,443 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:21,444 INFO L357 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-07-23 13:41:21,444 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 30 times [2018-07-23 13:41:21,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-07-23 13:41:21,651 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:21,651 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 13:41:21,651 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:21,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:41:21,652 INFO L185 omatonBuilderFactory]: Interpolants [13984#true, 13985#false, 13986#(<= ULTIMATE.start_main_~x~4 0), 13987#(<= ULTIMATE.start_main_~x~4 1), 13988#(<= ULTIMATE.start_main_~x~4 2), 13989#(<= ULTIMATE.start_main_~x~4 3), 13990#(<= ULTIMATE.start_main_~x~4 4), 13991#(<= ULTIMATE.start_main_~x~4 5), 13992#(<= ULTIMATE.start_main_~x~4 6), 13993#(<= ULTIMATE.start_main_~x~4 7), 13994#(<= ULTIMATE.start_main_~x~4 8), 13995#(<= ULTIMATE.start_main_~x~4 9), 13996#(<= ULTIMATE.start_main_~x~4 10), 13997#(<= ULTIMATE.start_main_~x~4 11), 13998#(<= ULTIMATE.start_main_~x~4 12), 13999#(<= ULTIMATE.start_main_~x~4 13), 14000#(<= ULTIMATE.start_main_~x~4 14), 14001#(<= ULTIMATE.start_main_~x~4 15), 14002#(<= ULTIMATE.start_main_~x~4 16), 14003#(<= ULTIMATE.start_main_~x~4 17), 14004#(<= ULTIMATE.start_main_~x~4 18), 14005#(<= ULTIMATE.start_main_~x~4 19), 14006#(<= ULTIMATE.start_main_~x~4 20), 14007#(<= ULTIMATE.start_main_~x~4 21)] [2018-07-23 13:41:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-07-23 13:41:21,655 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 13:41:21,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 13:41:21,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:41:21,656 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-07-23 13:41:21,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:21,782 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-07-23 13:41:21,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 13:41:21,782 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-07-23 13:41:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:21,784 INFO L225 Difference]: With dead ends: 281 [2018-07-23 13:41:21,784 INFO L226 Difference]: Without dead ends: 279 [2018-07-23 13:41:21,785 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 13:41:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-23 13:41:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-07-23 13:41:21,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-07-23 13:41:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-07-23 13:41:21,880 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-07-23 13:41:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:21,881 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-07-23 13:41:21,881 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 13:41:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-07-23 13:41:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-07-23 13:41:21,885 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:21,886 INFO L357 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-07-23 13:41:21,886 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 31 times [2018-07-23 13:41:21,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-07-23 13:41:22,137 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:22,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 13:41:22,137 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:22,138 INFO L185 omatonBuilderFactory]: Interpolants [15106#true, 15107#false, 15108#(<= ULTIMATE.start_main_~x~4 0), 15109#(<= ULTIMATE.start_main_~x~4 1), 15110#(<= ULTIMATE.start_main_~x~4 2), 15111#(<= ULTIMATE.start_main_~x~4 3), 15112#(<= ULTIMATE.start_main_~x~4 4), 15113#(<= ULTIMATE.start_main_~x~4 5), 15114#(<= ULTIMATE.start_main_~x~4 6), 15115#(<= ULTIMATE.start_main_~x~4 7), 15116#(<= ULTIMATE.start_main_~x~4 8), 15117#(<= ULTIMATE.start_main_~x~4 9), 15118#(<= ULTIMATE.start_main_~x~4 10), 15119#(<= ULTIMATE.start_main_~x~4 11), 15120#(<= ULTIMATE.start_main_~x~4 12), 15121#(<= ULTIMATE.start_main_~x~4 13), 15122#(<= ULTIMATE.start_main_~x~4 14), 15123#(<= ULTIMATE.start_main_~x~4 15), 15124#(<= ULTIMATE.start_main_~x~4 16), 15125#(<= ULTIMATE.start_main_~x~4 17), 15126#(<= ULTIMATE.start_main_~x~4 18), 15127#(<= ULTIMATE.start_main_~x~4 19), 15128#(<= ULTIMATE.start_main_~x~4 20), 15129#(<= ULTIMATE.start_main_~x~4 21), 15130#(<= ULTIMATE.start_main_~x~4 22)] [2018-07-23 13:41:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-07-23 13:41:22,144 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 13:41:22,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 13:41:22,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:41:22,145 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-07-23 13:41:22,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:22,283 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-07-23 13:41:22,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 13:41:22,283 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-07-23 13:41:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:22,285 INFO L225 Difference]: With dead ends: 293 [2018-07-23 13:41:22,285 INFO L226 Difference]: Without dead ends: 291 [2018-07-23 13:41:22,286 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 13:41:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-23 13:41:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-07-23 13:41:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-07-23 13:41:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-07-23 13:41:22,387 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-07-23 13:41:22,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:22,388 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-07-23 13:41:22,389 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 13:41:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-07-23 13:41:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-07-23 13:41:22,393 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:22,393 INFO L357 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-07-23 13:41:22,393 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:22,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 32 times [2018-07-23 13:41:22,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-07-23 13:41:22,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:22,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 13:41:22,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:22,707 INFO L185 omatonBuilderFactory]: Interpolants [16277#true, 16278#false, 16279#(<= ULTIMATE.start_main_~x~4 0), 16280#(<= ULTIMATE.start_main_~x~4 1), 16281#(<= ULTIMATE.start_main_~x~4 2), 16282#(<= ULTIMATE.start_main_~x~4 3), 16283#(<= ULTIMATE.start_main_~x~4 4), 16284#(<= ULTIMATE.start_main_~x~4 5), 16285#(<= ULTIMATE.start_main_~x~4 6), 16286#(<= ULTIMATE.start_main_~x~4 7), 16287#(<= ULTIMATE.start_main_~x~4 8), 16288#(<= ULTIMATE.start_main_~x~4 9), 16289#(<= ULTIMATE.start_main_~x~4 10), 16290#(<= ULTIMATE.start_main_~x~4 11), 16291#(<= ULTIMATE.start_main_~x~4 12), 16292#(<= ULTIMATE.start_main_~x~4 13), 16293#(<= ULTIMATE.start_main_~x~4 14), 16294#(<= ULTIMATE.start_main_~x~4 15), 16295#(<= ULTIMATE.start_main_~x~4 16), 16296#(<= ULTIMATE.start_main_~x~4 17), 16297#(<= ULTIMATE.start_main_~x~4 18), 16298#(<= ULTIMATE.start_main_~x~4 19), 16299#(<= ULTIMATE.start_main_~x~4 20), 16300#(<= ULTIMATE.start_main_~x~4 21), 16301#(<= ULTIMATE.start_main_~x~4 22), 16302#(<= ULTIMATE.start_main_~x~4 23)] [2018-07-23 13:41:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-07-23 13:41:22,710 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 13:41:22,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 13:41:22,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:41:22,711 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-07-23 13:41:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:22,884 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-07-23 13:41:22,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 13:41:22,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-07-23 13:41:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:22,887 INFO L225 Difference]: With dead ends: 305 [2018-07-23 13:41:22,887 INFO L226 Difference]: Without dead ends: 303 [2018-07-23 13:41:22,888 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 13:41:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-23 13:41:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-07-23 13:41:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-07-23 13:41:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-07-23 13:41:23,055 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-07-23 13:41:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:23,056 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-07-23 13:41:23,056 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 13:41:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-07-23 13:41:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-07-23 13:41:23,061 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:23,061 INFO L357 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-07-23 13:41:23,061 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 33 times [2018-07-23 13:41:23,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-07-23 13:41:23,292 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:23,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 13:41:23,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:23,293 INFO L185 omatonBuilderFactory]: Interpolants [17497#true, 17498#false, 17499#(<= ULTIMATE.start_main_~x~4 0), 17500#(<= ULTIMATE.start_main_~x~4 1), 17501#(<= ULTIMATE.start_main_~x~4 2), 17502#(<= ULTIMATE.start_main_~x~4 3), 17503#(<= ULTIMATE.start_main_~x~4 4), 17504#(<= ULTIMATE.start_main_~x~4 5), 17505#(<= ULTIMATE.start_main_~x~4 6), 17506#(<= ULTIMATE.start_main_~x~4 7), 17507#(<= ULTIMATE.start_main_~x~4 8), 17508#(<= ULTIMATE.start_main_~x~4 9), 17509#(<= ULTIMATE.start_main_~x~4 10), 17510#(<= ULTIMATE.start_main_~x~4 11), 17511#(<= ULTIMATE.start_main_~x~4 12), 17512#(<= ULTIMATE.start_main_~x~4 13), 17513#(<= ULTIMATE.start_main_~x~4 14), 17514#(<= ULTIMATE.start_main_~x~4 15), 17515#(<= ULTIMATE.start_main_~x~4 16), 17516#(<= ULTIMATE.start_main_~x~4 17), 17517#(<= ULTIMATE.start_main_~x~4 18), 17518#(<= ULTIMATE.start_main_~x~4 19), 17519#(<= ULTIMATE.start_main_~x~4 20), 17520#(<= ULTIMATE.start_main_~x~4 21), 17521#(<= ULTIMATE.start_main_~x~4 22), 17522#(<= ULTIMATE.start_main_~x~4 23), 17523#(<= ULTIMATE.start_main_~x~4 24)] [2018-07-23 13:41:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-07-23 13:41:23,297 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 13:41:23,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 13:41:23,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:41:23,298 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-07-23 13:41:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:23,457 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-07-23 13:41:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 13:41:23,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-07-23 13:41:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:23,460 INFO L225 Difference]: With dead ends: 317 [2018-07-23 13:41:23,460 INFO L226 Difference]: Without dead ends: 315 [2018-07-23 13:41:23,461 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 13:41:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-23 13:41:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-07-23 13:41:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-07-23 13:41:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-07-23 13:41:23,575 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-07-23 13:41:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:23,576 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-07-23 13:41:23,576 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 13:41:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-07-23 13:41:23,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-07-23 13:41:23,580 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:23,580 INFO L357 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-07-23 13:41:23,580 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:23,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 34 times [2018-07-23 13:41:23,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-07-23 13:41:23,835 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:23,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 13:41:23,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:23,836 INFO L185 omatonBuilderFactory]: Interpolants [18766#true, 18767#false, 18768#(<= ULTIMATE.start_main_~x~4 0), 18769#(<= ULTIMATE.start_main_~x~4 1), 18770#(<= ULTIMATE.start_main_~x~4 2), 18771#(<= ULTIMATE.start_main_~x~4 3), 18772#(<= ULTIMATE.start_main_~x~4 4), 18773#(<= ULTIMATE.start_main_~x~4 5), 18774#(<= ULTIMATE.start_main_~x~4 6), 18775#(<= ULTIMATE.start_main_~x~4 7), 18776#(<= ULTIMATE.start_main_~x~4 8), 18777#(<= ULTIMATE.start_main_~x~4 9), 18778#(<= ULTIMATE.start_main_~x~4 10), 18779#(<= ULTIMATE.start_main_~x~4 11), 18780#(<= ULTIMATE.start_main_~x~4 12), 18781#(<= ULTIMATE.start_main_~x~4 13), 18782#(<= ULTIMATE.start_main_~x~4 14), 18783#(<= ULTIMATE.start_main_~x~4 15), 18784#(<= ULTIMATE.start_main_~x~4 16), 18785#(<= ULTIMATE.start_main_~x~4 17), 18786#(<= ULTIMATE.start_main_~x~4 18), 18787#(<= ULTIMATE.start_main_~x~4 19), 18788#(<= ULTIMATE.start_main_~x~4 20), 18789#(<= ULTIMATE.start_main_~x~4 21), 18790#(<= ULTIMATE.start_main_~x~4 22), 18791#(<= ULTIMATE.start_main_~x~4 23), 18792#(<= ULTIMATE.start_main_~x~4 24), 18793#(<= ULTIMATE.start_main_~x~4 25)] [2018-07-23 13:41:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-07-23 13:41:23,839 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 13:41:23,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 13:41:23,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 13:41:23,841 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-07-23 13:41:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:24,011 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-07-23 13:41:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 13:41:24,012 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-07-23 13:41:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:24,014 INFO L225 Difference]: With dead ends: 329 [2018-07-23 13:41:24,014 INFO L226 Difference]: Without dead ends: 327 [2018-07-23 13:41:24,015 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 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:41:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-07-23 13:41:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-07-23 13:41:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-07-23 13:41:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-07-23 13:41:24,135 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-07-23 13:41:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:24,136 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-07-23 13:41:24,136 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 13:41:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-07-23 13:41:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-07-23 13:41:24,140 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:24,140 INFO L357 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-07-23 13:41:24,141 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 35 times [2018-07-23 13:41:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-07-23 13:41:24,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:24,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 13:41:24,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:24,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:41:24,410 INFO L185 omatonBuilderFactory]: Interpolants [20096#(<= ULTIMATE.start_main_~x~4 10), 20097#(<= ULTIMATE.start_main_~x~4 11), 20098#(<= ULTIMATE.start_main_~x~4 12), 20099#(<= ULTIMATE.start_main_~x~4 13), 20100#(<= ULTIMATE.start_main_~x~4 14), 20101#(<= ULTIMATE.start_main_~x~4 15), 20102#(<= ULTIMATE.start_main_~x~4 16), 20103#(<= ULTIMATE.start_main_~x~4 17), 20104#(<= ULTIMATE.start_main_~x~4 18), 20105#(<= ULTIMATE.start_main_~x~4 19), 20106#(<= ULTIMATE.start_main_~x~4 20), 20107#(<= ULTIMATE.start_main_~x~4 21), 20108#(<= ULTIMATE.start_main_~x~4 22), 20109#(<= ULTIMATE.start_main_~x~4 23), 20110#(<= ULTIMATE.start_main_~x~4 24), 20111#(<= ULTIMATE.start_main_~x~4 25), 20112#(<= ULTIMATE.start_main_~x~4 26), 20084#true, 20085#false, 20086#(<= ULTIMATE.start_main_~x~4 0), 20087#(<= ULTIMATE.start_main_~x~4 1), 20088#(<= ULTIMATE.start_main_~x~4 2), 20089#(<= ULTIMATE.start_main_~x~4 3), 20090#(<= ULTIMATE.start_main_~x~4 4), 20091#(<= ULTIMATE.start_main_~x~4 5), 20092#(<= ULTIMATE.start_main_~x~4 6), 20093#(<= ULTIMATE.start_main_~x~4 7), 20094#(<= ULTIMATE.start_main_~x~4 8), 20095#(<= ULTIMATE.start_main_~x~4 9)] [2018-07-23 13:41:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-07-23 13:41:24,413 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 13:41:24,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 13:41:24,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 13:41:24,414 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-07-23 13:41:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:24,596 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-07-23 13:41:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 13:41:24,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-07-23 13:41:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:24,599 INFO L225 Difference]: With dead ends: 341 [2018-07-23 13:41:24,599 INFO L226 Difference]: Without dead ends: 339 [2018-07-23 13:41:24,600 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 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:41:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-23 13:41:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-07-23 13:41:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-07-23 13:41:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-07-23 13:41:24,749 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-07-23 13:41:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:24,750 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-07-23 13:41:24,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 13:41:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-07-23 13:41:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-07-23 13:41:24,759 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:24,759 INFO L357 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-07-23 13:41:24,760 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:24,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 36 times [2018-07-23 13:41:24,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:25,170 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-07-23 13:41:25,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:25,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 13:41:25,171 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:25,172 INFO L185 omatonBuilderFactory]: Interpolants [21451#true, 21452#false, 21453#(<= ULTIMATE.start_main_~x~4 0), 21454#(<= ULTIMATE.start_main_~x~4 1), 21455#(<= ULTIMATE.start_main_~x~4 2), 21456#(<= ULTIMATE.start_main_~x~4 3), 21457#(<= ULTIMATE.start_main_~x~4 4), 21458#(<= ULTIMATE.start_main_~x~4 5), 21459#(<= ULTIMATE.start_main_~x~4 6), 21460#(<= ULTIMATE.start_main_~x~4 7), 21461#(<= ULTIMATE.start_main_~x~4 8), 21462#(<= ULTIMATE.start_main_~x~4 9), 21463#(<= ULTIMATE.start_main_~x~4 10), 21464#(<= ULTIMATE.start_main_~x~4 11), 21465#(<= ULTIMATE.start_main_~x~4 12), 21466#(<= ULTIMATE.start_main_~x~4 13), 21467#(<= ULTIMATE.start_main_~x~4 14), 21468#(<= ULTIMATE.start_main_~x~4 15), 21469#(<= ULTIMATE.start_main_~x~4 16), 21470#(<= ULTIMATE.start_main_~x~4 17), 21471#(<= ULTIMATE.start_main_~x~4 18), 21472#(<= ULTIMATE.start_main_~x~4 19), 21473#(<= ULTIMATE.start_main_~x~4 20), 21474#(<= ULTIMATE.start_main_~x~4 21), 21475#(<= ULTIMATE.start_main_~x~4 22), 21476#(<= ULTIMATE.start_main_~x~4 23), 21477#(<= ULTIMATE.start_main_~x~4 24), 21478#(<= ULTIMATE.start_main_~x~4 25), 21479#(<= ULTIMATE.start_main_~x~4 26), 21480#(<= ULTIMATE.start_main_~x~4 27)] [2018-07-23 13:41:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-07-23 13:41:25,176 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 13:41:25,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 13:41:25,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 13:41:25,177 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-07-23 13:41:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:25,370 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-07-23 13:41:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 13:41:25,370 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-07-23 13:41:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:25,373 INFO L225 Difference]: With dead ends: 353 [2018-07-23 13:41:25,373 INFO L226 Difference]: Without dead ends: 351 [2018-07-23 13:41:25,376 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 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:41:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-23 13:41:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-07-23 13:41:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-07-23 13:41:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-07-23 13:41:25,510 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-07-23 13:41:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:25,511 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-07-23 13:41:25,511 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 13:41:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-07-23 13:41:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-07-23 13:41:25,516 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:25,516 INFO L357 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-07-23 13:41:25,516 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 37 times [2018-07-23 13:41:25,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-07-23 13:41:25,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:25,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 13:41:25,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:25,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:41:25,809 INFO L185 omatonBuilderFactory]: Interpolants [22867#true, 22868#false, 22869#(<= ULTIMATE.start_main_~x~4 0), 22870#(<= ULTIMATE.start_main_~x~4 1), 22871#(<= ULTIMATE.start_main_~x~4 2), 22872#(<= ULTIMATE.start_main_~x~4 3), 22873#(<= ULTIMATE.start_main_~x~4 4), 22874#(<= ULTIMATE.start_main_~x~4 5), 22875#(<= ULTIMATE.start_main_~x~4 6), 22876#(<= ULTIMATE.start_main_~x~4 7), 22877#(<= ULTIMATE.start_main_~x~4 8), 22878#(<= ULTIMATE.start_main_~x~4 9), 22879#(<= ULTIMATE.start_main_~x~4 10), 22880#(<= ULTIMATE.start_main_~x~4 11), 22881#(<= ULTIMATE.start_main_~x~4 12), 22882#(<= ULTIMATE.start_main_~x~4 13), 22883#(<= ULTIMATE.start_main_~x~4 14), 22884#(<= ULTIMATE.start_main_~x~4 15), 22885#(<= ULTIMATE.start_main_~x~4 16), 22886#(<= ULTIMATE.start_main_~x~4 17), 22887#(<= ULTIMATE.start_main_~x~4 18), 22888#(<= ULTIMATE.start_main_~x~4 19), 22889#(<= ULTIMATE.start_main_~x~4 20), 22890#(<= ULTIMATE.start_main_~x~4 21), 22891#(<= ULTIMATE.start_main_~x~4 22), 22892#(<= ULTIMATE.start_main_~x~4 23), 22893#(<= ULTIMATE.start_main_~x~4 24), 22894#(<= ULTIMATE.start_main_~x~4 25), 22895#(<= ULTIMATE.start_main_~x~4 26), 22896#(<= ULTIMATE.start_main_~x~4 27), 22897#(<= ULTIMATE.start_main_~x~4 28)] [2018-07-23 13:41:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-07-23 13:41:25,812 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 13:41:25,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 13:41:25,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 13:41:25,813 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-07-23 13:41:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:26,012 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-07-23 13:41:26,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 13:41:26,012 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-07-23 13:41:26,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:26,015 INFO L225 Difference]: With dead ends: 365 [2018-07-23 13:41:26,015 INFO L226 Difference]: Without dead ends: 363 [2018-07-23 13:41:26,015 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 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:41:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-07-23 13:41:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-07-23 13:41:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-07-23 13:41:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-07-23 13:41:26,174 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-07-23 13:41:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:26,175 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-07-23 13:41:26,175 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 13:41:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-07-23 13:41:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-07-23 13:41:26,182 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:26,182 INFO L357 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-07-23 13:41:26,183 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 38 times [2018-07-23 13:41:26,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-07-23 13:41:26,493 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:26,494 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 13:41:26,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:26,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:41:26,495 INFO L185 omatonBuilderFactory]: Interpolants [24332#true, 24333#false, 24334#(<= ULTIMATE.start_main_~x~4 0), 24335#(<= ULTIMATE.start_main_~x~4 1), 24336#(<= ULTIMATE.start_main_~x~4 2), 24337#(<= ULTIMATE.start_main_~x~4 3), 24338#(<= ULTIMATE.start_main_~x~4 4), 24339#(<= ULTIMATE.start_main_~x~4 5), 24340#(<= ULTIMATE.start_main_~x~4 6), 24341#(<= ULTIMATE.start_main_~x~4 7), 24342#(<= ULTIMATE.start_main_~x~4 8), 24343#(<= ULTIMATE.start_main_~x~4 9), 24344#(<= ULTIMATE.start_main_~x~4 10), 24345#(<= ULTIMATE.start_main_~x~4 11), 24346#(<= ULTIMATE.start_main_~x~4 12), 24347#(<= ULTIMATE.start_main_~x~4 13), 24348#(<= ULTIMATE.start_main_~x~4 14), 24349#(<= ULTIMATE.start_main_~x~4 15), 24350#(<= ULTIMATE.start_main_~x~4 16), 24351#(<= ULTIMATE.start_main_~x~4 17), 24352#(<= ULTIMATE.start_main_~x~4 18), 24353#(<= ULTIMATE.start_main_~x~4 19), 24354#(<= ULTIMATE.start_main_~x~4 20), 24355#(<= ULTIMATE.start_main_~x~4 21), 24356#(<= ULTIMATE.start_main_~x~4 22), 24357#(<= ULTIMATE.start_main_~x~4 23), 24358#(<= ULTIMATE.start_main_~x~4 24), 24359#(<= ULTIMATE.start_main_~x~4 25), 24360#(<= ULTIMATE.start_main_~x~4 26), 24361#(<= ULTIMATE.start_main_~x~4 27), 24362#(<= ULTIMATE.start_main_~x~4 28), 24363#(<= ULTIMATE.start_main_~x~4 29)] [2018-07-23 13:41:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-07-23 13:41:26,498 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 13:41:26,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 13:41:26,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 13:41:26,499 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-07-23 13:41:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:26,710 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-07-23 13:41:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 13:41:26,711 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-07-23 13:41:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:26,714 INFO L225 Difference]: With dead ends: 377 [2018-07-23 13:41:26,714 INFO L226 Difference]: Without dead ends: 375 [2018-07-23 13:41:26,715 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 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:41:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-23 13:41:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-07-23 13:41:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-07-23 13:41:26,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-07-23 13:41:26,872 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-07-23 13:41:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:26,875 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-07-23 13:41:26,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 13:41:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-07-23 13:41:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-07-23 13:41:26,880 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:26,881 INFO L357 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-07-23 13:41:26,881 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 39 times [2018-07-23 13:41:26,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-07-23 13:41:27,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:27,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 13:41:27,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:27,215 INFO L185 omatonBuilderFactory]: Interpolants [25856#(<= ULTIMATE.start_main_~x~4 8), 25857#(<= ULTIMATE.start_main_~x~4 9), 25858#(<= ULTIMATE.start_main_~x~4 10), 25859#(<= ULTIMATE.start_main_~x~4 11), 25860#(<= ULTIMATE.start_main_~x~4 12), 25861#(<= ULTIMATE.start_main_~x~4 13), 25862#(<= ULTIMATE.start_main_~x~4 14), 25863#(<= ULTIMATE.start_main_~x~4 15), 25864#(<= ULTIMATE.start_main_~x~4 16), 25865#(<= ULTIMATE.start_main_~x~4 17), 25866#(<= ULTIMATE.start_main_~x~4 18), 25867#(<= ULTIMATE.start_main_~x~4 19), 25868#(<= ULTIMATE.start_main_~x~4 20), 25869#(<= ULTIMATE.start_main_~x~4 21), 25870#(<= ULTIMATE.start_main_~x~4 22), 25871#(<= ULTIMATE.start_main_~x~4 23), 25872#(<= ULTIMATE.start_main_~x~4 24), 25873#(<= ULTIMATE.start_main_~x~4 25), 25874#(<= ULTIMATE.start_main_~x~4 26), 25875#(<= ULTIMATE.start_main_~x~4 27), 25876#(<= ULTIMATE.start_main_~x~4 28), 25877#(<= ULTIMATE.start_main_~x~4 29), 25878#(<= ULTIMATE.start_main_~x~4 30), 25846#true, 25847#false, 25848#(<= ULTIMATE.start_main_~x~4 0), 25849#(<= ULTIMATE.start_main_~x~4 1), 25850#(<= ULTIMATE.start_main_~x~4 2), 25851#(<= ULTIMATE.start_main_~x~4 3), 25852#(<= ULTIMATE.start_main_~x~4 4), 25853#(<= ULTIMATE.start_main_~x~4 5), 25854#(<= ULTIMATE.start_main_~x~4 6), 25855#(<= ULTIMATE.start_main_~x~4 7)] [2018-07-23 13:41:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-07-23 13:41:27,219 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 13:41:27,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 13:41:27,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 13:41:27,260 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-07-23 13:41:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:27,516 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-07-23 13:41:27,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 13:41:27,516 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-07-23 13:41:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:27,519 INFO L225 Difference]: With dead ends: 389 [2018-07-23 13:41:27,520 INFO L226 Difference]: Without dead ends: 387 [2018-07-23 13:41:27,521 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 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:41:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-07-23 13:41:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-07-23 13:41:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-07-23 13:41:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-07-23 13:41:27,737 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-07-23 13:41:27,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:27,738 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-07-23 13:41:27,738 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 13:41:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-07-23 13:41:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-07-23 13:41:27,746 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:27,746 INFO L357 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-07-23 13:41:27,746 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 40 times [2018-07-23 13:41:27,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-07-23 13:41:28,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:28,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 13:41:28,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:28,103 INFO L185 omatonBuilderFactory]: Interpolants [27409#true, 27410#false, 27411#(<= ULTIMATE.start_main_~x~4 0), 27412#(<= ULTIMATE.start_main_~x~4 1), 27413#(<= ULTIMATE.start_main_~x~4 2), 27414#(<= ULTIMATE.start_main_~x~4 3), 27415#(<= ULTIMATE.start_main_~x~4 4), 27416#(<= ULTIMATE.start_main_~x~4 5), 27417#(<= ULTIMATE.start_main_~x~4 6), 27418#(<= ULTIMATE.start_main_~x~4 7), 27419#(<= ULTIMATE.start_main_~x~4 8), 27420#(<= ULTIMATE.start_main_~x~4 9), 27421#(<= ULTIMATE.start_main_~x~4 10), 27422#(<= ULTIMATE.start_main_~x~4 11), 27423#(<= ULTIMATE.start_main_~x~4 12), 27424#(<= ULTIMATE.start_main_~x~4 13), 27425#(<= ULTIMATE.start_main_~x~4 14), 27426#(<= ULTIMATE.start_main_~x~4 15), 27427#(<= ULTIMATE.start_main_~x~4 16), 27428#(<= ULTIMATE.start_main_~x~4 17), 27429#(<= ULTIMATE.start_main_~x~4 18), 27430#(<= ULTIMATE.start_main_~x~4 19), 27431#(<= ULTIMATE.start_main_~x~4 20), 27432#(<= ULTIMATE.start_main_~x~4 21), 27433#(<= ULTIMATE.start_main_~x~4 22), 27434#(<= ULTIMATE.start_main_~x~4 23), 27435#(<= ULTIMATE.start_main_~x~4 24), 27436#(<= ULTIMATE.start_main_~x~4 25), 27437#(<= ULTIMATE.start_main_~x~4 26), 27438#(<= ULTIMATE.start_main_~x~4 27), 27439#(<= ULTIMATE.start_main_~x~4 28), 27440#(<= ULTIMATE.start_main_~x~4 29), 27441#(<= ULTIMATE.start_main_~x~4 30), 27442#(<= ULTIMATE.start_main_~x~4 31)] [2018-07-23 13:41:28,107 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-07-23 13:41:28,107 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 13:41:28,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 13:41:28,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 13:41:28,109 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-07-23 13:41:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:28,358 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-07-23 13:41:28,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 13:41:28,358 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-07-23 13:41:28,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:28,361 INFO L225 Difference]: With dead ends: 401 [2018-07-23 13:41:28,362 INFO L226 Difference]: Without dead ends: 399 [2018-07-23 13:41:28,362 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 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:41:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-07-23 13:41:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-07-23 13:41:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-07-23 13:41:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-07-23 13:41:28,577 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-07-23 13:41:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:28,578 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-07-23 13:41:28,578 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 13:41:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-07-23 13:41:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-07-23 13:41:28,585 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:28,586 INFO L357 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-07-23 13:41:28,586 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:28,586 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 41 times [2018-07-23 13:41:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-07-23 13:41:28,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:28,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 13:41:28,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:28,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:41:28,948 INFO L185 omatonBuilderFactory]: Interpolants [29021#true, 29022#false, 29023#(<= ULTIMATE.start_main_~x~4 0), 29024#(<= ULTIMATE.start_main_~x~4 1), 29025#(<= ULTIMATE.start_main_~x~4 2), 29026#(<= ULTIMATE.start_main_~x~4 3), 29027#(<= ULTIMATE.start_main_~x~4 4), 29028#(<= ULTIMATE.start_main_~x~4 5), 29029#(<= ULTIMATE.start_main_~x~4 6), 29030#(<= ULTIMATE.start_main_~x~4 7), 29031#(<= ULTIMATE.start_main_~x~4 8), 29032#(<= ULTIMATE.start_main_~x~4 9), 29033#(<= ULTIMATE.start_main_~x~4 10), 29034#(<= ULTIMATE.start_main_~x~4 11), 29035#(<= ULTIMATE.start_main_~x~4 12), 29036#(<= ULTIMATE.start_main_~x~4 13), 29037#(<= ULTIMATE.start_main_~x~4 14), 29038#(<= ULTIMATE.start_main_~x~4 15), 29039#(<= ULTIMATE.start_main_~x~4 16), 29040#(<= ULTIMATE.start_main_~x~4 17), 29041#(<= ULTIMATE.start_main_~x~4 18), 29042#(<= ULTIMATE.start_main_~x~4 19), 29043#(<= ULTIMATE.start_main_~x~4 20), 29044#(<= ULTIMATE.start_main_~x~4 21), 29045#(<= ULTIMATE.start_main_~x~4 22), 29046#(<= ULTIMATE.start_main_~x~4 23), 29047#(<= ULTIMATE.start_main_~x~4 24), 29048#(<= ULTIMATE.start_main_~x~4 25), 29049#(<= ULTIMATE.start_main_~x~4 26), 29050#(<= ULTIMATE.start_main_~x~4 27), 29051#(<= ULTIMATE.start_main_~x~4 28), 29052#(<= ULTIMATE.start_main_~x~4 29), 29053#(<= ULTIMATE.start_main_~x~4 30), 29054#(<= ULTIMATE.start_main_~x~4 31), 29055#(<= ULTIMATE.start_main_~x~4 32)] [2018-07-23 13:41:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-07-23 13:41:28,952 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 13:41:28,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 13:41:28,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 13:41:28,953 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-07-23 13:41:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:29,224 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-07-23 13:41:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 13:41:29,225 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-07-23 13:41:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:29,229 INFO L225 Difference]: With dead ends: 413 [2018-07-23 13:41:29,230 INFO L226 Difference]: Without dead ends: 411 [2018-07-23 13:41:29,231 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 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:41:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-07-23 13:41:29,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-07-23 13:41:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-07-23 13:41:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-07-23 13:41:29,465 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-07-23 13:41:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:29,466 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-07-23 13:41:29,466 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 13:41:29,466 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-07-23 13:41:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-07-23 13:41:29,473 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:29,473 INFO L357 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-07-23 13:41:29,474 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:29,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 42 times [2018-07-23 13:41:29,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-07-23 13:41:29,911 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:29,911 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 13:41:29,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:29,913 INFO L185 omatonBuilderFactory]: Interpolants [30682#true, 30683#false, 30684#(<= ULTIMATE.start_main_~x~4 0), 30685#(<= ULTIMATE.start_main_~x~4 1), 30686#(<= ULTIMATE.start_main_~x~4 2), 30687#(<= ULTIMATE.start_main_~x~4 3), 30688#(<= ULTIMATE.start_main_~x~4 4), 30689#(<= ULTIMATE.start_main_~x~4 5), 30690#(<= ULTIMATE.start_main_~x~4 6), 30691#(<= ULTIMATE.start_main_~x~4 7), 30692#(<= ULTIMATE.start_main_~x~4 8), 30693#(<= ULTIMATE.start_main_~x~4 9), 30694#(<= ULTIMATE.start_main_~x~4 10), 30695#(<= ULTIMATE.start_main_~x~4 11), 30696#(<= ULTIMATE.start_main_~x~4 12), 30697#(<= ULTIMATE.start_main_~x~4 13), 30698#(<= ULTIMATE.start_main_~x~4 14), 30699#(<= ULTIMATE.start_main_~x~4 15), 30700#(<= ULTIMATE.start_main_~x~4 16), 30701#(<= ULTIMATE.start_main_~x~4 17), 30702#(<= ULTIMATE.start_main_~x~4 18), 30703#(<= ULTIMATE.start_main_~x~4 19), 30704#(<= ULTIMATE.start_main_~x~4 20), 30705#(<= ULTIMATE.start_main_~x~4 21), 30706#(<= ULTIMATE.start_main_~x~4 22), 30707#(<= ULTIMATE.start_main_~x~4 23), 30708#(<= ULTIMATE.start_main_~x~4 24), 30709#(<= ULTIMATE.start_main_~x~4 25), 30710#(<= ULTIMATE.start_main_~x~4 26), 30711#(<= ULTIMATE.start_main_~x~4 27), 30712#(<= ULTIMATE.start_main_~x~4 28), 30713#(<= ULTIMATE.start_main_~x~4 29), 30714#(<= ULTIMATE.start_main_~x~4 30), 30715#(<= ULTIMATE.start_main_~x~4 31), 30716#(<= ULTIMATE.start_main_~x~4 32), 30717#(<= ULTIMATE.start_main_~x~4 33)] [2018-07-23 13:41:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-07-23 13:41:29,918 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 13:41:29,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 13:41:29,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 13:41:29,920 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-07-23 13:41:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:30,244 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-07-23 13:41:30,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 13:41:30,244 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-07-23 13:41:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:30,247 INFO L225 Difference]: With dead ends: 425 [2018-07-23 13:41:30,247 INFO L226 Difference]: Without dead ends: 423 [2018-07-23 13:41:30,249 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 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:41:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-07-23 13:41:30,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-07-23 13:41:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-07-23 13:41:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-07-23 13:41:30,544 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-07-23 13:41:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:30,545 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-07-23 13:41:30,545 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 13:41:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-07-23 13:41:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-07-23 13:41:30,551 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:30,551 INFO L357 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-07-23 13:41:30,551 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 43 times [2018-07-23 13:41:30,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-07-23 13:41:30,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:30,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 13:41:30,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:30,925 INFO L185 omatonBuilderFactory]: Interpolants [32392#true, 32393#false, 32394#(<= ULTIMATE.start_main_~x~4 0), 32395#(<= ULTIMATE.start_main_~x~4 1), 32396#(<= ULTIMATE.start_main_~x~4 2), 32397#(<= ULTIMATE.start_main_~x~4 3), 32398#(<= ULTIMATE.start_main_~x~4 4), 32399#(<= ULTIMATE.start_main_~x~4 5), 32400#(<= ULTIMATE.start_main_~x~4 6), 32401#(<= ULTIMATE.start_main_~x~4 7), 32402#(<= ULTIMATE.start_main_~x~4 8), 32403#(<= ULTIMATE.start_main_~x~4 9), 32404#(<= ULTIMATE.start_main_~x~4 10), 32405#(<= ULTIMATE.start_main_~x~4 11), 32406#(<= ULTIMATE.start_main_~x~4 12), 32407#(<= ULTIMATE.start_main_~x~4 13), 32408#(<= ULTIMATE.start_main_~x~4 14), 32409#(<= ULTIMATE.start_main_~x~4 15), 32410#(<= ULTIMATE.start_main_~x~4 16), 32411#(<= ULTIMATE.start_main_~x~4 17), 32412#(<= ULTIMATE.start_main_~x~4 18), 32413#(<= ULTIMATE.start_main_~x~4 19), 32414#(<= ULTIMATE.start_main_~x~4 20), 32415#(<= ULTIMATE.start_main_~x~4 21), 32416#(<= ULTIMATE.start_main_~x~4 22), 32417#(<= ULTIMATE.start_main_~x~4 23), 32418#(<= ULTIMATE.start_main_~x~4 24), 32419#(<= ULTIMATE.start_main_~x~4 25), 32420#(<= ULTIMATE.start_main_~x~4 26), 32421#(<= ULTIMATE.start_main_~x~4 27), 32422#(<= ULTIMATE.start_main_~x~4 28), 32423#(<= ULTIMATE.start_main_~x~4 29), 32424#(<= ULTIMATE.start_main_~x~4 30), 32425#(<= ULTIMATE.start_main_~x~4 31), 32426#(<= ULTIMATE.start_main_~x~4 32), 32427#(<= ULTIMATE.start_main_~x~4 33), 32428#(<= ULTIMATE.start_main_~x~4 34)] [2018-07-23 13:41:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-07-23 13:41:30,929 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 13:41:30,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 13:41:30,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 13:41:30,930 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-07-23 13:41:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:31,228 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-07-23 13:41:31,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 13:41:31,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-07-23 13:41:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:31,231 INFO L225 Difference]: With dead ends: 437 [2018-07-23 13:41:31,231 INFO L226 Difference]: Without dead ends: 435 [2018-07-23 13:41:31,233 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 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:41:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-07-23 13:41:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-07-23 13:41:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-07-23 13:41:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-07-23 13:41:31,471 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-07-23 13:41:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:31,472 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-07-23 13:41:31,472 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 13:41:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-07-23 13:41:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-07-23 13:41:31,479 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:31,479 INFO L357 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-07-23 13:41:31,479 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:31,479 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 44 times [2018-07-23 13:41:31,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-07-23 13:41:31,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:31,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 13:41:31,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:31,846 INFO L185 omatonBuilderFactory]: Interpolants [34176#(<= ULTIMATE.start_main_~x~4 23), 34177#(<= ULTIMATE.start_main_~x~4 24), 34178#(<= ULTIMATE.start_main_~x~4 25), 34179#(<= ULTIMATE.start_main_~x~4 26), 34180#(<= ULTIMATE.start_main_~x~4 27), 34181#(<= ULTIMATE.start_main_~x~4 28), 34182#(<= ULTIMATE.start_main_~x~4 29), 34183#(<= ULTIMATE.start_main_~x~4 30), 34184#(<= ULTIMATE.start_main_~x~4 31), 34185#(<= ULTIMATE.start_main_~x~4 32), 34186#(<= ULTIMATE.start_main_~x~4 33), 34187#(<= ULTIMATE.start_main_~x~4 34), 34188#(<= ULTIMATE.start_main_~x~4 35), 34151#true, 34152#false, 34153#(<= ULTIMATE.start_main_~x~4 0), 34154#(<= ULTIMATE.start_main_~x~4 1), 34155#(<= ULTIMATE.start_main_~x~4 2), 34156#(<= ULTIMATE.start_main_~x~4 3), 34157#(<= ULTIMATE.start_main_~x~4 4), 34158#(<= ULTIMATE.start_main_~x~4 5), 34159#(<= ULTIMATE.start_main_~x~4 6), 34160#(<= ULTIMATE.start_main_~x~4 7), 34161#(<= ULTIMATE.start_main_~x~4 8), 34162#(<= ULTIMATE.start_main_~x~4 9), 34163#(<= ULTIMATE.start_main_~x~4 10), 34164#(<= ULTIMATE.start_main_~x~4 11), 34165#(<= ULTIMATE.start_main_~x~4 12), 34166#(<= ULTIMATE.start_main_~x~4 13), 34167#(<= ULTIMATE.start_main_~x~4 14), 34168#(<= ULTIMATE.start_main_~x~4 15), 34169#(<= ULTIMATE.start_main_~x~4 16), 34170#(<= ULTIMATE.start_main_~x~4 17), 34171#(<= ULTIMATE.start_main_~x~4 18), 34172#(<= ULTIMATE.start_main_~x~4 19), 34173#(<= ULTIMATE.start_main_~x~4 20), 34174#(<= ULTIMATE.start_main_~x~4 21), 34175#(<= ULTIMATE.start_main_~x~4 22)] [2018-07-23 13:41:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-07-23 13:41:31,850 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 13:41:31,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 13:41:31,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 13:41:31,852 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-07-23 13:41:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:32,172 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-07-23 13:41:32,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 13:41:32,172 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-07-23 13:41:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:32,176 INFO L225 Difference]: With dead ends: 449 [2018-07-23 13:41:32,176 INFO L226 Difference]: Without dead ends: 447 [2018-07-23 13:41:32,177 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 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:41:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-07-23 13:41:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-07-23 13:41:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-07-23 13:41:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-07-23 13:41:32,459 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-07-23 13:41:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:32,460 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-07-23 13:41:32,460 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 13:41:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-07-23 13:41:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-07-23 13:41:32,464 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:32,464 INFO L357 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-07-23 13:41:32,465 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 45 times [2018-07-23 13:41:32,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-07-23 13:41:32,869 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:32,869 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 13:41:32,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:32,871 INFO L185 omatonBuilderFactory]: Interpolants [35968#(<= ULTIMATE.start_main_~x~4 7), 35969#(<= ULTIMATE.start_main_~x~4 8), 35970#(<= ULTIMATE.start_main_~x~4 9), 35971#(<= ULTIMATE.start_main_~x~4 10), 35972#(<= ULTIMATE.start_main_~x~4 11), 35973#(<= ULTIMATE.start_main_~x~4 12), 35974#(<= ULTIMATE.start_main_~x~4 13), 35975#(<= ULTIMATE.start_main_~x~4 14), 35976#(<= ULTIMATE.start_main_~x~4 15), 35977#(<= ULTIMATE.start_main_~x~4 16), 35978#(<= ULTIMATE.start_main_~x~4 17), 35979#(<= ULTIMATE.start_main_~x~4 18), 35980#(<= ULTIMATE.start_main_~x~4 19), 35981#(<= ULTIMATE.start_main_~x~4 20), 35982#(<= ULTIMATE.start_main_~x~4 21), 35983#(<= ULTIMATE.start_main_~x~4 22), 35984#(<= ULTIMATE.start_main_~x~4 23), 35985#(<= ULTIMATE.start_main_~x~4 24), 35986#(<= ULTIMATE.start_main_~x~4 25), 35987#(<= ULTIMATE.start_main_~x~4 26), 35988#(<= ULTIMATE.start_main_~x~4 27), 35989#(<= ULTIMATE.start_main_~x~4 28), 35990#(<= ULTIMATE.start_main_~x~4 29), 35991#(<= ULTIMATE.start_main_~x~4 30), 35992#(<= ULTIMATE.start_main_~x~4 31), 35993#(<= ULTIMATE.start_main_~x~4 32), 35994#(<= ULTIMATE.start_main_~x~4 33), 35995#(<= ULTIMATE.start_main_~x~4 34), 35996#(<= ULTIMATE.start_main_~x~4 35), 35997#(<= ULTIMATE.start_main_~x~4 36), 35959#true, 35960#false, 35961#(<= ULTIMATE.start_main_~x~4 0), 35962#(<= ULTIMATE.start_main_~x~4 1), 35963#(<= ULTIMATE.start_main_~x~4 2), 35964#(<= ULTIMATE.start_main_~x~4 3), 35965#(<= ULTIMATE.start_main_~x~4 4), 35966#(<= ULTIMATE.start_main_~x~4 5), 35967#(<= ULTIMATE.start_main_~x~4 6)] [2018-07-23 13:41:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-07-23 13:41:32,875 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 13:41:32,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 13:41:32,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 13:41:32,877 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-07-23 13:41:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:33,226 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-07-23 13:41:33,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 13:41:33,226 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-07-23 13:41:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:33,230 INFO L225 Difference]: With dead ends: 461 [2018-07-23 13:41:33,230 INFO L226 Difference]: Without dead ends: 459 [2018-07-23 13:41:33,231 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 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:41:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-07-23 13:41:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-07-23 13:41:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-07-23 13:41:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-07-23 13:41:33,494 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-07-23 13:41:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:33,495 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-07-23 13:41:33,495 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 13:41:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-07-23 13:41:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-07-23 13:41:33,498 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:33,498 INFO L357 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-07-23 13:41:33,498 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:33,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 46 times [2018-07-23 13:41:33,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-07-23 13:41:33,909 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:33,909 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 13:41:33,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:33,910 INFO L185 omatonBuilderFactory]: Interpolants [37824#(<= ULTIMATE.start_main_~x~4 6), 37825#(<= ULTIMATE.start_main_~x~4 7), 37826#(<= ULTIMATE.start_main_~x~4 8), 37827#(<= ULTIMATE.start_main_~x~4 9), 37828#(<= ULTIMATE.start_main_~x~4 10), 37829#(<= ULTIMATE.start_main_~x~4 11), 37830#(<= ULTIMATE.start_main_~x~4 12), 37831#(<= ULTIMATE.start_main_~x~4 13), 37832#(<= ULTIMATE.start_main_~x~4 14), 37833#(<= ULTIMATE.start_main_~x~4 15), 37834#(<= ULTIMATE.start_main_~x~4 16), 37835#(<= ULTIMATE.start_main_~x~4 17), 37836#(<= ULTIMATE.start_main_~x~4 18), 37837#(<= ULTIMATE.start_main_~x~4 19), 37838#(<= ULTIMATE.start_main_~x~4 20), 37839#(<= ULTIMATE.start_main_~x~4 21), 37840#(<= ULTIMATE.start_main_~x~4 22), 37841#(<= ULTIMATE.start_main_~x~4 23), 37842#(<= ULTIMATE.start_main_~x~4 24), 37843#(<= ULTIMATE.start_main_~x~4 25), 37844#(<= ULTIMATE.start_main_~x~4 26), 37845#(<= ULTIMATE.start_main_~x~4 27), 37846#(<= ULTIMATE.start_main_~x~4 28), 37847#(<= ULTIMATE.start_main_~x~4 29), 37848#(<= ULTIMATE.start_main_~x~4 30), 37849#(<= ULTIMATE.start_main_~x~4 31), 37850#(<= ULTIMATE.start_main_~x~4 32), 37851#(<= ULTIMATE.start_main_~x~4 33), 37852#(<= ULTIMATE.start_main_~x~4 34), 37853#(<= ULTIMATE.start_main_~x~4 35), 37854#(<= ULTIMATE.start_main_~x~4 36), 37855#(<= ULTIMATE.start_main_~x~4 37), 37816#true, 37817#false, 37818#(<= ULTIMATE.start_main_~x~4 0), 37819#(<= ULTIMATE.start_main_~x~4 1), 37820#(<= ULTIMATE.start_main_~x~4 2), 37821#(<= ULTIMATE.start_main_~x~4 3), 37822#(<= ULTIMATE.start_main_~x~4 4), 37823#(<= ULTIMATE.start_main_~x~4 5)] [2018-07-23 13:41:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-07-23 13:41:33,914 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 13:41:33,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 13:41:33,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 13:41:33,916 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-07-23 13:41:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:34,238 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-07-23 13:41:34,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 13:41:34,238 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-07-23 13:41:34,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:34,243 INFO L225 Difference]: With dead ends: 473 [2018-07-23 13:41:34,243 INFO L226 Difference]: Without dead ends: 471 [2018-07-23 13:41:34,244 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 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:41:34,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-07-23 13:41:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-07-23 13:41:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-07-23 13:41:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-07-23 13:41:34,548 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-07-23 13:41:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:34,549 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-07-23 13:41:34,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 13:41:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-07-23 13:41:34,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-07-23 13:41:34,552 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:34,552 INFO L357 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-07-23 13:41:34,553 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 47 times [2018-07-23 13:41:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-07-23 13:41:34,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:34,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 13:41:34,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:34,968 INFO L185 omatonBuilderFactory]: Interpolants [39744#(<= ULTIMATE.start_main_~x~4 20), 39745#(<= ULTIMATE.start_main_~x~4 21), 39746#(<= ULTIMATE.start_main_~x~4 22), 39747#(<= ULTIMATE.start_main_~x~4 23), 39748#(<= ULTIMATE.start_main_~x~4 24), 39749#(<= ULTIMATE.start_main_~x~4 25), 39750#(<= ULTIMATE.start_main_~x~4 26), 39751#(<= ULTIMATE.start_main_~x~4 27), 39752#(<= ULTIMATE.start_main_~x~4 28), 39753#(<= ULTIMATE.start_main_~x~4 29), 39754#(<= ULTIMATE.start_main_~x~4 30), 39755#(<= ULTIMATE.start_main_~x~4 31), 39756#(<= ULTIMATE.start_main_~x~4 32), 39757#(<= ULTIMATE.start_main_~x~4 33), 39758#(<= ULTIMATE.start_main_~x~4 34), 39759#(<= ULTIMATE.start_main_~x~4 35), 39760#(<= ULTIMATE.start_main_~x~4 36), 39761#(<= ULTIMATE.start_main_~x~4 37), 39762#(<= ULTIMATE.start_main_~x~4 38), 39722#true, 39723#false, 39724#(<= ULTIMATE.start_main_~x~4 0), 39725#(<= ULTIMATE.start_main_~x~4 1), 39726#(<= ULTIMATE.start_main_~x~4 2), 39727#(<= ULTIMATE.start_main_~x~4 3), 39728#(<= ULTIMATE.start_main_~x~4 4), 39729#(<= ULTIMATE.start_main_~x~4 5), 39730#(<= ULTIMATE.start_main_~x~4 6), 39731#(<= ULTIMATE.start_main_~x~4 7), 39732#(<= ULTIMATE.start_main_~x~4 8), 39733#(<= ULTIMATE.start_main_~x~4 9), 39734#(<= ULTIMATE.start_main_~x~4 10), 39735#(<= ULTIMATE.start_main_~x~4 11), 39736#(<= ULTIMATE.start_main_~x~4 12), 39737#(<= ULTIMATE.start_main_~x~4 13), 39738#(<= ULTIMATE.start_main_~x~4 14), 39739#(<= ULTIMATE.start_main_~x~4 15), 39740#(<= ULTIMATE.start_main_~x~4 16), 39741#(<= ULTIMATE.start_main_~x~4 17), 39742#(<= ULTIMATE.start_main_~x~4 18), 39743#(<= ULTIMATE.start_main_~x~4 19)] [2018-07-23 13:41:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-07-23 13:41:34,973 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 13:41:34,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 13:41:34,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 13:41:34,975 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-07-23 13:41:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:35,324 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-07-23 13:41:35,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 13:41:35,324 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-07-23 13:41:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:35,327 INFO L225 Difference]: With dead ends: 485 [2018-07-23 13:41:35,328 INFO L226 Difference]: Without dead ends: 483 [2018-07-23 13:41:35,330 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 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:41:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-07-23 13:41:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-07-23 13:41:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-07-23 13:41:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-07-23 13:41:35,650 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-07-23 13:41:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:35,652 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-07-23 13:41:35,652 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 13:41:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-07-23 13:41:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-07-23 13:41:35,655 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:35,655 INFO L357 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-07-23 13:41:35,656 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:35,656 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 48 times [2018-07-23 13:41:35,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-07-23 13:41:36,147 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:36,147 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 13:41:36,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:36,148 INFO L185 omatonBuilderFactory]: Interpolants [41677#true, 41678#false, 41679#(<= ULTIMATE.start_main_~x~4 0), 41680#(<= ULTIMATE.start_main_~x~4 1), 41681#(<= ULTIMATE.start_main_~x~4 2), 41682#(<= ULTIMATE.start_main_~x~4 3), 41683#(<= ULTIMATE.start_main_~x~4 4), 41684#(<= ULTIMATE.start_main_~x~4 5), 41685#(<= ULTIMATE.start_main_~x~4 6), 41686#(<= ULTIMATE.start_main_~x~4 7), 41687#(<= ULTIMATE.start_main_~x~4 8), 41688#(<= ULTIMATE.start_main_~x~4 9), 41689#(<= ULTIMATE.start_main_~x~4 10), 41690#(<= ULTIMATE.start_main_~x~4 11), 41691#(<= ULTIMATE.start_main_~x~4 12), 41692#(<= ULTIMATE.start_main_~x~4 13), 41693#(<= ULTIMATE.start_main_~x~4 14), 41694#(<= ULTIMATE.start_main_~x~4 15), 41695#(<= ULTIMATE.start_main_~x~4 16), 41696#(<= ULTIMATE.start_main_~x~4 17), 41697#(<= ULTIMATE.start_main_~x~4 18), 41698#(<= ULTIMATE.start_main_~x~4 19), 41699#(<= ULTIMATE.start_main_~x~4 20), 41700#(<= ULTIMATE.start_main_~x~4 21), 41701#(<= ULTIMATE.start_main_~x~4 22), 41702#(<= ULTIMATE.start_main_~x~4 23), 41703#(<= ULTIMATE.start_main_~x~4 24), 41704#(<= ULTIMATE.start_main_~x~4 25), 41705#(<= ULTIMATE.start_main_~x~4 26), 41706#(<= ULTIMATE.start_main_~x~4 27), 41707#(<= ULTIMATE.start_main_~x~4 28), 41708#(<= ULTIMATE.start_main_~x~4 29), 41709#(<= ULTIMATE.start_main_~x~4 30), 41710#(<= ULTIMATE.start_main_~x~4 31), 41711#(<= ULTIMATE.start_main_~x~4 32), 41712#(<= ULTIMATE.start_main_~x~4 33), 41713#(<= ULTIMATE.start_main_~x~4 34), 41714#(<= ULTIMATE.start_main_~x~4 35), 41715#(<= ULTIMATE.start_main_~x~4 36), 41716#(<= ULTIMATE.start_main_~x~4 37), 41717#(<= ULTIMATE.start_main_~x~4 38), 41718#(<= ULTIMATE.start_main_~x~4 39)] [2018-07-23 13:41:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-07-23 13:41:36,152 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 13:41:36,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 13:41:36,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 13:41:36,154 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-07-23 13:41:36,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:36,601 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-07-23 13:41:36,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 13:41:36,602 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-07-23 13:41:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:36,605 INFO L225 Difference]: With dead ends: 497 [2018-07-23 13:41:36,605 INFO L226 Difference]: Without dead ends: 495 [2018-07-23 13:41:36,606 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 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:41:36,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-07-23 13:41:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-07-23 13:41:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-07-23 13:41:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-07-23 13:41:36,910 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-07-23 13:41:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:36,911 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-07-23 13:41:36,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 13:41:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-07-23 13:41:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-07-23 13:41:36,915 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:36,915 INFO L357 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-07-23 13:41:36,915 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:36,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 49 times [2018-07-23 13:41:36,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-07-23 13:41:37,337 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:37,337 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 13:41:37,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:37,338 INFO L185 omatonBuilderFactory]: Interpolants [43712#(<= ULTIMATE.start_main_~x~4 29), 43713#(<= ULTIMATE.start_main_~x~4 30), 43714#(<= ULTIMATE.start_main_~x~4 31), 43715#(<= ULTIMATE.start_main_~x~4 32), 43716#(<= ULTIMATE.start_main_~x~4 33), 43717#(<= ULTIMATE.start_main_~x~4 34), 43718#(<= ULTIMATE.start_main_~x~4 35), 43719#(<= ULTIMATE.start_main_~x~4 36), 43720#(<= ULTIMATE.start_main_~x~4 37), 43721#(<= ULTIMATE.start_main_~x~4 38), 43722#(<= ULTIMATE.start_main_~x~4 39), 43723#(<= ULTIMATE.start_main_~x~4 40), 43681#true, 43682#false, 43683#(<= ULTIMATE.start_main_~x~4 0), 43684#(<= ULTIMATE.start_main_~x~4 1), 43685#(<= ULTIMATE.start_main_~x~4 2), 43686#(<= ULTIMATE.start_main_~x~4 3), 43687#(<= ULTIMATE.start_main_~x~4 4), 43688#(<= ULTIMATE.start_main_~x~4 5), 43689#(<= ULTIMATE.start_main_~x~4 6), 43690#(<= ULTIMATE.start_main_~x~4 7), 43691#(<= ULTIMATE.start_main_~x~4 8), 43692#(<= ULTIMATE.start_main_~x~4 9), 43693#(<= ULTIMATE.start_main_~x~4 10), 43694#(<= ULTIMATE.start_main_~x~4 11), 43695#(<= ULTIMATE.start_main_~x~4 12), 43696#(<= ULTIMATE.start_main_~x~4 13), 43697#(<= ULTIMATE.start_main_~x~4 14), 43698#(<= ULTIMATE.start_main_~x~4 15), 43699#(<= ULTIMATE.start_main_~x~4 16), 43700#(<= ULTIMATE.start_main_~x~4 17), 43701#(<= ULTIMATE.start_main_~x~4 18), 43702#(<= ULTIMATE.start_main_~x~4 19), 43703#(<= ULTIMATE.start_main_~x~4 20), 43704#(<= ULTIMATE.start_main_~x~4 21), 43705#(<= ULTIMATE.start_main_~x~4 22), 43706#(<= ULTIMATE.start_main_~x~4 23), 43707#(<= ULTIMATE.start_main_~x~4 24), 43708#(<= ULTIMATE.start_main_~x~4 25), 43709#(<= ULTIMATE.start_main_~x~4 26), 43710#(<= ULTIMATE.start_main_~x~4 27), 43711#(<= ULTIMATE.start_main_~x~4 28)] [2018-07-23 13:41:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-07-23 13:41:37,343 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 13:41:37,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 13:41:37,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 13:41:37,345 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-07-23 13:41:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:37,719 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-07-23 13:41:37,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 13:41:37,719 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-07-23 13:41:37,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:37,723 INFO L225 Difference]: With dead ends: 509 [2018-07-23 13:41:37,724 INFO L226 Difference]: Without dead ends: 507 [2018-07-23 13:41:37,725 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 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:41:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-07-23 13:41:38,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-07-23 13:41:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-07-23 13:41:38,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-07-23 13:41:38,080 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-07-23 13:41:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:38,081 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-07-23 13:41:38,081 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 13:41:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-07-23 13:41:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-07-23 13:41:38,087 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:38,087 INFO L357 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-07-23 13:41:38,087 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:38,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 50 times [2018-07-23 13:41:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-07-23 13:41:38,486 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:38,486 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 13:41:38,487 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:38,487 INFO L185 omatonBuilderFactory]: Interpolants [45760#(<= ULTIMATE.start_main_~x~4 24), 45761#(<= ULTIMATE.start_main_~x~4 25), 45762#(<= ULTIMATE.start_main_~x~4 26), 45763#(<= ULTIMATE.start_main_~x~4 27), 45764#(<= ULTIMATE.start_main_~x~4 28), 45765#(<= ULTIMATE.start_main_~x~4 29), 45766#(<= ULTIMATE.start_main_~x~4 30), 45767#(<= ULTIMATE.start_main_~x~4 31), 45768#(<= ULTIMATE.start_main_~x~4 32), 45769#(<= ULTIMATE.start_main_~x~4 33), 45770#(<= ULTIMATE.start_main_~x~4 34), 45771#(<= ULTIMATE.start_main_~x~4 35), 45772#(<= ULTIMATE.start_main_~x~4 36), 45773#(<= ULTIMATE.start_main_~x~4 37), 45774#(<= ULTIMATE.start_main_~x~4 38), 45775#(<= ULTIMATE.start_main_~x~4 39), 45776#(<= ULTIMATE.start_main_~x~4 40), 45777#(<= ULTIMATE.start_main_~x~4 41), 45734#true, 45735#false, 45736#(<= ULTIMATE.start_main_~x~4 0), 45737#(<= ULTIMATE.start_main_~x~4 1), 45738#(<= ULTIMATE.start_main_~x~4 2), 45739#(<= ULTIMATE.start_main_~x~4 3), 45740#(<= ULTIMATE.start_main_~x~4 4), 45741#(<= ULTIMATE.start_main_~x~4 5), 45742#(<= ULTIMATE.start_main_~x~4 6), 45743#(<= ULTIMATE.start_main_~x~4 7), 45744#(<= ULTIMATE.start_main_~x~4 8), 45745#(<= ULTIMATE.start_main_~x~4 9), 45746#(<= ULTIMATE.start_main_~x~4 10), 45747#(<= ULTIMATE.start_main_~x~4 11), 45748#(<= ULTIMATE.start_main_~x~4 12), 45749#(<= ULTIMATE.start_main_~x~4 13), 45750#(<= ULTIMATE.start_main_~x~4 14), 45751#(<= ULTIMATE.start_main_~x~4 15), 45752#(<= ULTIMATE.start_main_~x~4 16), 45753#(<= ULTIMATE.start_main_~x~4 17), 45754#(<= ULTIMATE.start_main_~x~4 18), 45755#(<= ULTIMATE.start_main_~x~4 19), 45756#(<= ULTIMATE.start_main_~x~4 20), 45757#(<= ULTIMATE.start_main_~x~4 21), 45758#(<= ULTIMATE.start_main_~x~4 22), 45759#(<= ULTIMATE.start_main_~x~4 23)] [2018-07-23 13:41:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-07-23 13:41:38,492 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 13:41:38,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 13:41:38,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 13:41:38,493 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-07-23 13:41:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:38,898 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-07-23 13:41:38,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 13:41:38,899 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-07-23 13:41:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:38,903 INFO L225 Difference]: With dead ends: 521 [2018-07-23 13:41:38,903 INFO L226 Difference]: Without dead ends: 519 [2018-07-23 13:41:38,904 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 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:41:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-07-23 13:41:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-07-23 13:41:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-07-23 13:41:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-07-23 13:41:39,283 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-07-23 13:41:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:39,284 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-07-23 13:41:39,284 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 13:41:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-07-23 13:41:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-07-23 13:41:39,288 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:39,288 INFO L357 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-07-23 13:41:39,288 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 51 times [2018-07-23 13:41:39,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-07-23 13:41:39,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:39,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 13:41:39,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:39,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:41:39,809 INFO L185 omatonBuilderFactory]: Interpolants [47872#(<= ULTIMATE.start_main_~x~4 34), 47873#(<= ULTIMATE.start_main_~x~4 35), 47874#(<= ULTIMATE.start_main_~x~4 36), 47875#(<= ULTIMATE.start_main_~x~4 37), 47876#(<= ULTIMATE.start_main_~x~4 38), 47877#(<= ULTIMATE.start_main_~x~4 39), 47878#(<= ULTIMATE.start_main_~x~4 40), 47879#(<= ULTIMATE.start_main_~x~4 41), 47880#(<= ULTIMATE.start_main_~x~4 42), 47836#true, 47837#false, 47838#(<= ULTIMATE.start_main_~x~4 0), 47839#(<= ULTIMATE.start_main_~x~4 1), 47840#(<= ULTIMATE.start_main_~x~4 2), 47841#(<= ULTIMATE.start_main_~x~4 3), 47842#(<= ULTIMATE.start_main_~x~4 4), 47843#(<= ULTIMATE.start_main_~x~4 5), 47844#(<= ULTIMATE.start_main_~x~4 6), 47845#(<= ULTIMATE.start_main_~x~4 7), 47846#(<= ULTIMATE.start_main_~x~4 8), 47847#(<= ULTIMATE.start_main_~x~4 9), 47848#(<= ULTIMATE.start_main_~x~4 10), 47849#(<= ULTIMATE.start_main_~x~4 11), 47850#(<= ULTIMATE.start_main_~x~4 12), 47851#(<= ULTIMATE.start_main_~x~4 13), 47852#(<= ULTIMATE.start_main_~x~4 14), 47853#(<= ULTIMATE.start_main_~x~4 15), 47854#(<= ULTIMATE.start_main_~x~4 16), 47855#(<= ULTIMATE.start_main_~x~4 17), 47856#(<= ULTIMATE.start_main_~x~4 18), 47857#(<= ULTIMATE.start_main_~x~4 19), 47858#(<= ULTIMATE.start_main_~x~4 20), 47859#(<= ULTIMATE.start_main_~x~4 21), 47860#(<= ULTIMATE.start_main_~x~4 22), 47861#(<= ULTIMATE.start_main_~x~4 23), 47862#(<= ULTIMATE.start_main_~x~4 24), 47863#(<= ULTIMATE.start_main_~x~4 25), 47864#(<= ULTIMATE.start_main_~x~4 26), 47865#(<= ULTIMATE.start_main_~x~4 27), 47866#(<= ULTIMATE.start_main_~x~4 28), 47867#(<= ULTIMATE.start_main_~x~4 29), 47868#(<= ULTIMATE.start_main_~x~4 30), 47869#(<= ULTIMATE.start_main_~x~4 31), 47870#(<= ULTIMATE.start_main_~x~4 32), 47871#(<= ULTIMATE.start_main_~x~4 33)] [2018-07-23 13:41:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-07-23 13:41:39,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 13:41:39,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 13:41:39,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 13:41:39,817 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-07-23 13:41:40,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:40,126 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-07-23 13:41:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 13:41:40,126 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-07-23 13:41:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:40,129 INFO L225 Difference]: With dead ends: 533 [2018-07-23 13:41:40,129 INFO L226 Difference]: Without dead ends: 531 [2018-07-23 13:41:40,130 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 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:41:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-07-23 13:41:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-07-23 13:41:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-07-23 13:41:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-07-23 13:41:40,520 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-07-23 13:41:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:40,521 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-07-23 13:41:40,521 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 13:41:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-07-23 13:41:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-07-23 13:41:40,526 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:40,526 INFO L357 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-07-23 13:41:40,527 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:40,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 52 times [2018-07-23 13:41:40,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-07-23 13:41:41,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:41,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 13:41:41,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:41,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:41:41,008 INFO L185 omatonBuilderFactory]: Interpolants [49987#true, 49988#false, 49989#(<= ULTIMATE.start_main_~x~4 0), 49990#(<= ULTIMATE.start_main_~x~4 1), 49991#(<= ULTIMATE.start_main_~x~4 2), 49992#(<= ULTIMATE.start_main_~x~4 3), 49993#(<= ULTIMATE.start_main_~x~4 4), 49994#(<= ULTIMATE.start_main_~x~4 5), 49995#(<= ULTIMATE.start_main_~x~4 6), 49996#(<= ULTIMATE.start_main_~x~4 7), 49997#(<= ULTIMATE.start_main_~x~4 8), 49998#(<= ULTIMATE.start_main_~x~4 9), 49999#(<= ULTIMATE.start_main_~x~4 10), 50000#(<= ULTIMATE.start_main_~x~4 11), 50001#(<= ULTIMATE.start_main_~x~4 12), 50002#(<= ULTIMATE.start_main_~x~4 13), 50003#(<= ULTIMATE.start_main_~x~4 14), 50004#(<= ULTIMATE.start_main_~x~4 15), 50005#(<= ULTIMATE.start_main_~x~4 16), 50006#(<= ULTIMATE.start_main_~x~4 17), 50007#(<= ULTIMATE.start_main_~x~4 18), 50008#(<= ULTIMATE.start_main_~x~4 19), 50009#(<= ULTIMATE.start_main_~x~4 20), 50010#(<= ULTIMATE.start_main_~x~4 21), 50011#(<= ULTIMATE.start_main_~x~4 22), 50012#(<= ULTIMATE.start_main_~x~4 23), 50013#(<= ULTIMATE.start_main_~x~4 24), 50014#(<= ULTIMATE.start_main_~x~4 25), 50015#(<= ULTIMATE.start_main_~x~4 26), 50016#(<= ULTIMATE.start_main_~x~4 27), 50017#(<= ULTIMATE.start_main_~x~4 28), 50018#(<= ULTIMATE.start_main_~x~4 29), 50019#(<= ULTIMATE.start_main_~x~4 30), 50020#(<= ULTIMATE.start_main_~x~4 31), 50021#(<= ULTIMATE.start_main_~x~4 32), 50022#(<= ULTIMATE.start_main_~x~4 33), 50023#(<= ULTIMATE.start_main_~x~4 34), 50024#(<= ULTIMATE.start_main_~x~4 35), 50025#(<= ULTIMATE.start_main_~x~4 36), 50026#(<= ULTIMATE.start_main_~x~4 37), 50027#(<= ULTIMATE.start_main_~x~4 38), 50028#(<= ULTIMATE.start_main_~x~4 39), 50029#(<= ULTIMATE.start_main_~x~4 40), 50030#(<= ULTIMATE.start_main_~x~4 41), 50031#(<= ULTIMATE.start_main_~x~4 42), 50032#(<= ULTIMATE.start_main_~x~4 43)] [2018-07-23 13:41:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-07-23 13:41:41,015 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 13:41:41,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 13:41:41,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 13:41:41,016 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-07-23 13:41:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:41,430 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-07-23 13:41:41,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 13:41:41,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-07-23 13:41:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:41,433 INFO L225 Difference]: With dead ends: 545 [2018-07-23 13:41:41,434 INFO L226 Difference]: Without dead ends: 543 [2018-07-23 13:41:41,435 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 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:41:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-07-23 13:41:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-07-23 13:41:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-07-23 13:41:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-07-23 13:41:41,755 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-07-23 13:41:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:41,756 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-07-23 13:41:41,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 13:41:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-07-23 13:41:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-07-23 13:41:41,759 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:41,760 INFO L357 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-07-23 13:41:41,760 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 53 times [2018-07-23 13:41:41,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-07-23 13:41:42,289 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:42,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 13:41:42,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:42,291 INFO L185 omatonBuilderFactory]: Interpolants [52224#(<= ULTIMATE.start_main_~x~4 35), 52225#(<= ULTIMATE.start_main_~x~4 36), 52226#(<= ULTIMATE.start_main_~x~4 37), 52227#(<= ULTIMATE.start_main_~x~4 38), 52228#(<= ULTIMATE.start_main_~x~4 39), 52229#(<= ULTIMATE.start_main_~x~4 40), 52230#(<= ULTIMATE.start_main_~x~4 41), 52231#(<= ULTIMATE.start_main_~x~4 42), 52232#(<= ULTIMATE.start_main_~x~4 43), 52233#(<= ULTIMATE.start_main_~x~4 44), 52187#true, 52188#false, 52189#(<= ULTIMATE.start_main_~x~4 0), 52190#(<= ULTIMATE.start_main_~x~4 1), 52191#(<= ULTIMATE.start_main_~x~4 2), 52192#(<= ULTIMATE.start_main_~x~4 3), 52193#(<= ULTIMATE.start_main_~x~4 4), 52194#(<= ULTIMATE.start_main_~x~4 5), 52195#(<= ULTIMATE.start_main_~x~4 6), 52196#(<= ULTIMATE.start_main_~x~4 7), 52197#(<= ULTIMATE.start_main_~x~4 8), 52198#(<= ULTIMATE.start_main_~x~4 9), 52199#(<= ULTIMATE.start_main_~x~4 10), 52200#(<= ULTIMATE.start_main_~x~4 11), 52201#(<= ULTIMATE.start_main_~x~4 12), 52202#(<= ULTIMATE.start_main_~x~4 13), 52203#(<= ULTIMATE.start_main_~x~4 14), 52204#(<= ULTIMATE.start_main_~x~4 15), 52205#(<= ULTIMATE.start_main_~x~4 16), 52206#(<= ULTIMATE.start_main_~x~4 17), 52207#(<= ULTIMATE.start_main_~x~4 18), 52208#(<= ULTIMATE.start_main_~x~4 19), 52209#(<= ULTIMATE.start_main_~x~4 20), 52210#(<= ULTIMATE.start_main_~x~4 21), 52211#(<= ULTIMATE.start_main_~x~4 22), 52212#(<= ULTIMATE.start_main_~x~4 23), 52213#(<= ULTIMATE.start_main_~x~4 24), 52214#(<= ULTIMATE.start_main_~x~4 25), 52215#(<= ULTIMATE.start_main_~x~4 26), 52216#(<= ULTIMATE.start_main_~x~4 27), 52217#(<= ULTIMATE.start_main_~x~4 28), 52218#(<= ULTIMATE.start_main_~x~4 29), 52219#(<= ULTIMATE.start_main_~x~4 30), 52220#(<= ULTIMATE.start_main_~x~4 31), 52221#(<= ULTIMATE.start_main_~x~4 32), 52222#(<= ULTIMATE.start_main_~x~4 33), 52223#(<= ULTIMATE.start_main_~x~4 34)] [2018-07-23 13:41:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-07-23 13:41:42,299 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 13:41:42,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 13:41:42,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 13:41:42,300 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-07-23 13:41:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:42,703 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-07-23 13:41:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 13:41:42,703 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-07-23 13:41:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:42,706 INFO L225 Difference]: With dead ends: 557 [2018-07-23 13:41:42,707 INFO L226 Difference]: Without dead ends: 555 [2018-07-23 13:41:42,707 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 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:41:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-07-23 13:41:43,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-07-23 13:41:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-07-23 13:41:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-07-23 13:41:43,018 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-07-23 13:41:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:43,019 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-07-23 13:41:43,020 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 13:41:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-07-23 13:41:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-07-23 13:41:43,025 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:43,025 INFO L357 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-07-23 13:41:43,025 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 54 times [2018-07-23 13:41:43,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-07-23 13:41:43,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:43,552 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 13:41:43,552 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:43,553 INFO L185 omatonBuilderFactory]: Interpolants [54464#(<= ULTIMATE.start_main_~x~4 26), 54465#(<= ULTIMATE.start_main_~x~4 27), 54466#(<= ULTIMATE.start_main_~x~4 28), 54467#(<= ULTIMATE.start_main_~x~4 29), 54468#(<= ULTIMATE.start_main_~x~4 30), 54469#(<= ULTIMATE.start_main_~x~4 31), 54470#(<= ULTIMATE.start_main_~x~4 32), 54471#(<= ULTIMATE.start_main_~x~4 33), 54472#(<= ULTIMATE.start_main_~x~4 34), 54473#(<= ULTIMATE.start_main_~x~4 35), 54474#(<= ULTIMATE.start_main_~x~4 36), 54475#(<= ULTIMATE.start_main_~x~4 37), 54476#(<= ULTIMATE.start_main_~x~4 38), 54477#(<= ULTIMATE.start_main_~x~4 39), 54478#(<= ULTIMATE.start_main_~x~4 40), 54479#(<= ULTIMATE.start_main_~x~4 41), 54480#(<= ULTIMATE.start_main_~x~4 42), 54481#(<= ULTIMATE.start_main_~x~4 43), 54482#(<= ULTIMATE.start_main_~x~4 44), 54483#(<= ULTIMATE.start_main_~x~4 45), 54436#true, 54437#false, 54438#(<= ULTIMATE.start_main_~x~4 0), 54439#(<= ULTIMATE.start_main_~x~4 1), 54440#(<= ULTIMATE.start_main_~x~4 2), 54441#(<= ULTIMATE.start_main_~x~4 3), 54442#(<= ULTIMATE.start_main_~x~4 4), 54443#(<= ULTIMATE.start_main_~x~4 5), 54444#(<= ULTIMATE.start_main_~x~4 6), 54445#(<= ULTIMATE.start_main_~x~4 7), 54446#(<= ULTIMATE.start_main_~x~4 8), 54447#(<= ULTIMATE.start_main_~x~4 9), 54448#(<= ULTIMATE.start_main_~x~4 10), 54449#(<= ULTIMATE.start_main_~x~4 11), 54450#(<= ULTIMATE.start_main_~x~4 12), 54451#(<= ULTIMATE.start_main_~x~4 13), 54452#(<= ULTIMATE.start_main_~x~4 14), 54453#(<= ULTIMATE.start_main_~x~4 15), 54454#(<= ULTIMATE.start_main_~x~4 16), 54455#(<= ULTIMATE.start_main_~x~4 17), 54456#(<= ULTIMATE.start_main_~x~4 18), 54457#(<= ULTIMATE.start_main_~x~4 19), 54458#(<= ULTIMATE.start_main_~x~4 20), 54459#(<= ULTIMATE.start_main_~x~4 21), 54460#(<= ULTIMATE.start_main_~x~4 22), 54461#(<= ULTIMATE.start_main_~x~4 23), 54462#(<= ULTIMATE.start_main_~x~4 24), 54463#(<= ULTIMATE.start_main_~x~4 25)] [2018-07-23 13:41:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-07-23 13:41:43,558 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 13:41:43,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 13:41:43,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 13:41:43,559 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-07-23 13:41:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:44,004 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-07-23 13:41:44,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 13:41:44,004 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-07-23 13:41:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:44,007 INFO L225 Difference]: With dead ends: 569 [2018-07-23 13:41:44,008 INFO L226 Difference]: Without dead ends: 567 [2018-07-23 13:41:44,008 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 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:41:44,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-07-23 13:41:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-07-23 13:41:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-07-23 13:41:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-07-23 13:41:44,416 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-07-23 13:41:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:44,416 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-07-23 13:41:44,416 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 13:41:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-07-23 13:41:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-07-23 13:41:44,420 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:44,421 INFO L357 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-07-23 13:41:44,421 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:44,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 55 times [2018-07-23 13:41:44,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-07-23 13:41:44,949 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:44,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 13:41:44,950 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:44,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:41:44,951 INFO L185 omatonBuilderFactory]: Interpolants [56734#true, 56735#false, 56736#(<= ULTIMATE.start_main_~x~4 0), 56737#(<= ULTIMATE.start_main_~x~4 1), 56738#(<= ULTIMATE.start_main_~x~4 2), 56739#(<= ULTIMATE.start_main_~x~4 3), 56740#(<= ULTIMATE.start_main_~x~4 4), 56741#(<= ULTIMATE.start_main_~x~4 5), 56742#(<= ULTIMATE.start_main_~x~4 6), 56743#(<= ULTIMATE.start_main_~x~4 7), 56744#(<= ULTIMATE.start_main_~x~4 8), 56745#(<= ULTIMATE.start_main_~x~4 9), 56746#(<= ULTIMATE.start_main_~x~4 10), 56747#(<= ULTIMATE.start_main_~x~4 11), 56748#(<= ULTIMATE.start_main_~x~4 12), 56749#(<= ULTIMATE.start_main_~x~4 13), 56750#(<= ULTIMATE.start_main_~x~4 14), 56751#(<= ULTIMATE.start_main_~x~4 15), 56752#(<= ULTIMATE.start_main_~x~4 16), 56753#(<= ULTIMATE.start_main_~x~4 17), 56754#(<= ULTIMATE.start_main_~x~4 18), 56755#(<= ULTIMATE.start_main_~x~4 19), 56756#(<= ULTIMATE.start_main_~x~4 20), 56757#(<= ULTIMATE.start_main_~x~4 21), 56758#(<= ULTIMATE.start_main_~x~4 22), 56759#(<= ULTIMATE.start_main_~x~4 23), 56760#(<= ULTIMATE.start_main_~x~4 24), 56761#(<= ULTIMATE.start_main_~x~4 25), 56762#(<= ULTIMATE.start_main_~x~4 26), 56763#(<= ULTIMATE.start_main_~x~4 27), 56764#(<= ULTIMATE.start_main_~x~4 28), 56765#(<= ULTIMATE.start_main_~x~4 29), 56766#(<= ULTIMATE.start_main_~x~4 30), 56767#(<= ULTIMATE.start_main_~x~4 31), 56768#(<= ULTIMATE.start_main_~x~4 32), 56769#(<= ULTIMATE.start_main_~x~4 33), 56770#(<= ULTIMATE.start_main_~x~4 34), 56771#(<= ULTIMATE.start_main_~x~4 35), 56772#(<= ULTIMATE.start_main_~x~4 36), 56773#(<= ULTIMATE.start_main_~x~4 37), 56774#(<= ULTIMATE.start_main_~x~4 38), 56775#(<= ULTIMATE.start_main_~x~4 39), 56776#(<= ULTIMATE.start_main_~x~4 40), 56777#(<= ULTIMATE.start_main_~x~4 41), 56778#(<= ULTIMATE.start_main_~x~4 42), 56779#(<= ULTIMATE.start_main_~x~4 43), 56780#(<= ULTIMATE.start_main_~x~4 44), 56781#(<= ULTIMATE.start_main_~x~4 45), 56782#(<= ULTIMATE.start_main_~x~4 46)] [2018-07-23 13:41:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-07-23 13:41:44,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 13:41:44,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 13:41:44,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 13:41:44,959 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-07-23 13:41:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:45,372 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-07-23 13:41:45,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 13:41:45,372 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-07-23 13:41:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:45,375 INFO L225 Difference]: With dead ends: 581 [2018-07-23 13:41:45,375 INFO L226 Difference]: Without dead ends: 579 [2018-07-23 13:41:45,376 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 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:41:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-07-23 13:41:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-07-23 13:41:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-07-23 13:41:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-07-23 13:41:45,634 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-07-23 13:41:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:45,635 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-07-23 13:41:45,635 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 13:41:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-07-23 13:41:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-07-23 13:41:45,639 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:45,639 INFO L357 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-07-23 13:41:45,639 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 56 times [2018-07-23 13:41:45,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-07-23 13:41:46,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:46,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 13:41:46,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:46,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:41:46,144 INFO L185 omatonBuilderFactory]: Interpolants [59081#true, 59082#false, 59083#(<= ULTIMATE.start_main_~x~4 0), 59084#(<= ULTIMATE.start_main_~x~4 1), 59085#(<= ULTIMATE.start_main_~x~4 2), 59086#(<= ULTIMATE.start_main_~x~4 3), 59087#(<= ULTIMATE.start_main_~x~4 4), 59088#(<= ULTIMATE.start_main_~x~4 5), 59089#(<= ULTIMATE.start_main_~x~4 6), 59090#(<= ULTIMATE.start_main_~x~4 7), 59091#(<= ULTIMATE.start_main_~x~4 8), 59092#(<= ULTIMATE.start_main_~x~4 9), 59093#(<= ULTIMATE.start_main_~x~4 10), 59094#(<= ULTIMATE.start_main_~x~4 11), 59095#(<= ULTIMATE.start_main_~x~4 12), 59096#(<= ULTIMATE.start_main_~x~4 13), 59097#(<= ULTIMATE.start_main_~x~4 14), 59098#(<= ULTIMATE.start_main_~x~4 15), 59099#(<= ULTIMATE.start_main_~x~4 16), 59100#(<= ULTIMATE.start_main_~x~4 17), 59101#(<= ULTIMATE.start_main_~x~4 18), 59102#(<= ULTIMATE.start_main_~x~4 19), 59103#(<= ULTIMATE.start_main_~x~4 20), 59104#(<= ULTIMATE.start_main_~x~4 21), 59105#(<= ULTIMATE.start_main_~x~4 22), 59106#(<= ULTIMATE.start_main_~x~4 23), 59107#(<= ULTIMATE.start_main_~x~4 24), 59108#(<= ULTIMATE.start_main_~x~4 25), 59109#(<= ULTIMATE.start_main_~x~4 26), 59110#(<= ULTIMATE.start_main_~x~4 27), 59111#(<= ULTIMATE.start_main_~x~4 28), 59112#(<= ULTIMATE.start_main_~x~4 29), 59113#(<= ULTIMATE.start_main_~x~4 30), 59114#(<= ULTIMATE.start_main_~x~4 31), 59115#(<= ULTIMATE.start_main_~x~4 32), 59116#(<= ULTIMATE.start_main_~x~4 33), 59117#(<= ULTIMATE.start_main_~x~4 34), 59118#(<= ULTIMATE.start_main_~x~4 35), 59119#(<= ULTIMATE.start_main_~x~4 36), 59120#(<= ULTIMATE.start_main_~x~4 37), 59121#(<= ULTIMATE.start_main_~x~4 38), 59122#(<= ULTIMATE.start_main_~x~4 39), 59123#(<= ULTIMATE.start_main_~x~4 40), 59124#(<= ULTIMATE.start_main_~x~4 41), 59125#(<= ULTIMATE.start_main_~x~4 42), 59126#(<= ULTIMATE.start_main_~x~4 43), 59127#(<= ULTIMATE.start_main_~x~4 44), 59128#(<= ULTIMATE.start_main_~x~4 45), 59129#(<= ULTIMATE.start_main_~x~4 46), 59130#(<= ULTIMATE.start_main_~x~4 47)] [2018-07-23 13:41:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-07-23 13:41:46,148 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 13:41:46,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 13:41:46,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 13:41:46,149 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-07-23 13:41:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:46,495 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-07-23 13:41:46,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 13:41:46,495 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-07-23 13:41:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:46,498 INFO L225 Difference]: With dead ends: 593 [2018-07-23 13:41:46,498 INFO L226 Difference]: Without dead ends: 591 [2018-07-23 13:41:46,499 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 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:41:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-07-23 13:41:46,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-07-23 13:41:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-07-23 13:41:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-07-23 13:41:46,817 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-07-23 13:41:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:46,817 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-07-23 13:41:46,818 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 13:41:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-07-23 13:41:46,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-07-23 13:41:46,821 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:46,821 INFO L357 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-07-23 13:41:46,822 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:46,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 57 times [2018-07-23 13:41:46,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-07-23 13:41:47,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:47,226 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 13:41:47,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:47,227 INFO L185 omatonBuilderFactory]: Interpolants [61477#true, 61478#false, 61479#(<= ULTIMATE.start_main_~x~4 0), 61480#(<= ULTIMATE.start_main_~x~4 1), 61481#(<= ULTIMATE.start_main_~x~4 2), 61482#(<= ULTIMATE.start_main_~x~4 3), 61483#(<= ULTIMATE.start_main_~x~4 4), 61484#(<= ULTIMATE.start_main_~x~4 5), 61485#(<= ULTIMATE.start_main_~x~4 6), 61486#(<= ULTIMATE.start_main_~x~4 7), 61487#(<= ULTIMATE.start_main_~x~4 8), 61488#(<= ULTIMATE.start_main_~x~4 9), 61489#(<= ULTIMATE.start_main_~x~4 10), 61490#(<= ULTIMATE.start_main_~x~4 11), 61491#(<= ULTIMATE.start_main_~x~4 12), 61492#(<= ULTIMATE.start_main_~x~4 13), 61493#(<= ULTIMATE.start_main_~x~4 14), 61494#(<= ULTIMATE.start_main_~x~4 15), 61495#(<= ULTIMATE.start_main_~x~4 16), 61496#(<= ULTIMATE.start_main_~x~4 17), 61497#(<= ULTIMATE.start_main_~x~4 18), 61498#(<= ULTIMATE.start_main_~x~4 19), 61499#(<= ULTIMATE.start_main_~x~4 20), 61500#(<= ULTIMATE.start_main_~x~4 21), 61501#(<= ULTIMATE.start_main_~x~4 22), 61502#(<= ULTIMATE.start_main_~x~4 23), 61503#(<= ULTIMATE.start_main_~x~4 24), 61504#(<= ULTIMATE.start_main_~x~4 25), 61505#(<= ULTIMATE.start_main_~x~4 26), 61506#(<= ULTIMATE.start_main_~x~4 27), 61507#(<= ULTIMATE.start_main_~x~4 28), 61508#(<= ULTIMATE.start_main_~x~4 29), 61509#(<= ULTIMATE.start_main_~x~4 30), 61510#(<= ULTIMATE.start_main_~x~4 31), 61511#(<= ULTIMATE.start_main_~x~4 32), 61512#(<= ULTIMATE.start_main_~x~4 33), 61513#(<= ULTIMATE.start_main_~x~4 34), 61514#(<= ULTIMATE.start_main_~x~4 35), 61515#(<= ULTIMATE.start_main_~x~4 36), 61516#(<= ULTIMATE.start_main_~x~4 37), 61517#(<= ULTIMATE.start_main_~x~4 38), 61518#(<= ULTIMATE.start_main_~x~4 39), 61519#(<= ULTIMATE.start_main_~x~4 40), 61520#(<= ULTIMATE.start_main_~x~4 41), 61521#(<= ULTIMATE.start_main_~x~4 42), 61522#(<= ULTIMATE.start_main_~x~4 43), 61523#(<= ULTIMATE.start_main_~x~4 44), 61524#(<= ULTIMATE.start_main_~x~4 45), 61525#(<= ULTIMATE.start_main_~x~4 46), 61526#(<= ULTIMATE.start_main_~x~4 47), 61527#(<= ULTIMATE.start_main_~x~4 48)] [2018-07-23 13:41:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-07-23 13:41:47,232 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 13:41:47,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 13:41:47,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 13:41:47,233 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-07-23 13:41:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:47,598 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-07-23 13:41:47,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 13:41:47,598 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-07-23 13:41:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:47,604 INFO L225 Difference]: With dead ends: 605 [2018-07-23 13:41:47,604 INFO L226 Difference]: Without dead ends: 603 [2018-07-23 13:41:47,605 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 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:41:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-07-23 13:41:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-07-23 13:41:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-07-23 13:41:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-07-23 13:41:47,979 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-07-23 13:41:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:47,979 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-07-23 13:41:47,979 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 13:41:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-07-23 13:41:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-07-23 13:41:47,983 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:47,983 INFO L357 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-07-23 13:41:47,983 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 58 times [2018-07-23 13:41:47,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-07-23 13:41:48,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:48,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 13:41:48,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:48,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:48,387 INFO L185 omatonBuilderFactory]: Interpolants [63922#true, 63923#false, 63924#(<= ULTIMATE.start_main_~x~4 0), 63925#(<= ULTIMATE.start_main_~x~4 1), 63926#(<= ULTIMATE.start_main_~x~4 2), 63927#(<= ULTIMATE.start_main_~x~4 3), 63928#(<= ULTIMATE.start_main_~x~4 4), 63929#(<= ULTIMATE.start_main_~x~4 5), 63930#(<= ULTIMATE.start_main_~x~4 6), 63931#(<= ULTIMATE.start_main_~x~4 7), 63932#(<= ULTIMATE.start_main_~x~4 8), 63933#(<= ULTIMATE.start_main_~x~4 9), 63934#(<= ULTIMATE.start_main_~x~4 10), 63935#(<= ULTIMATE.start_main_~x~4 11), 63936#(<= ULTIMATE.start_main_~x~4 12), 63937#(<= ULTIMATE.start_main_~x~4 13), 63938#(<= ULTIMATE.start_main_~x~4 14), 63939#(<= ULTIMATE.start_main_~x~4 15), 63940#(<= ULTIMATE.start_main_~x~4 16), 63941#(<= ULTIMATE.start_main_~x~4 17), 63942#(<= ULTIMATE.start_main_~x~4 18), 63943#(<= ULTIMATE.start_main_~x~4 19), 63944#(<= ULTIMATE.start_main_~x~4 20), 63945#(<= ULTIMATE.start_main_~x~4 21), 63946#(<= ULTIMATE.start_main_~x~4 22), 63947#(<= ULTIMATE.start_main_~x~4 23), 63948#(<= ULTIMATE.start_main_~x~4 24), 63949#(<= ULTIMATE.start_main_~x~4 25), 63950#(<= ULTIMATE.start_main_~x~4 26), 63951#(<= ULTIMATE.start_main_~x~4 27), 63952#(<= ULTIMATE.start_main_~x~4 28), 63953#(<= ULTIMATE.start_main_~x~4 29), 63954#(<= ULTIMATE.start_main_~x~4 30), 63955#(<= ULTIMATE.start_main_~x~4 31), 63956#(<= ULTIMATE.start_main_~x~4 32), 63957#(<= ULTIMATE.start_main_~x~4 33), 63958#(<= ULTIMATE.start_main_~x~4 34), 63959#(<= ULTIMATE.start_main_~x~4 35), 63960#(<= ULTIMATE.start_main_~x~4 36), 63961#(<= ULTIMATE.start_main_~x~4 37), 63962#(<= ULTIMATE.start_main_~x~4 38), 63963#(<= ULTIMATE.start_main_~x~4 39), 63964#(<= ULTIMATE.start_main_~x~4 40), 63965#(<= ULTIMATE.start_main_~x~4 41), 63966#(<= ULTIMATE.start_main_~x~4 42), 63967#(<= ULTIMATE.start_main_~x~4 43), 63968#(<= ULTIMATE.start_main_~x~4 44), 63969#(<= ULTIMATE.start_main_~x~4 45), 63970#(<= ULTIMATE.start_main_~x~4 46), 63971#(<= ULTIMATE.start_main_~x~4 47), 63972#(<= ULTIMATE.start_main_~x~4 48), 63973#(<= ULTIMATE.start_main_~x~4 49)] [2018-07-23 13:41:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-07-23 13:41:48,392 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 13:41:48,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 13:41:48,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 13:41:48,393 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-07-23 13:41:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:48,812 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-07-23 13:41:48,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 13:41:48,812 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-07-23 13:41:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:48,816 INFO L225 Difference]: With dead ends: 617 [2018-07-23 13:41:48,816 INFO L226 Difference]: Without dead ends: 615 [2018-07-23 13:41:48,817 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 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:41:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-07-23 13:41:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-07-23 13:41:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-07-23 13:41:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-07-23 13:41:49,266 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-07-23 13:41:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:49,266 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-07-23 13:41:49,266 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 13:41:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-07-23 13:41:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-07-23 13:41:49,270 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:49,270 INFO L357 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-07-23 13:41:49,270 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 59 times [2018-07-23 13:41:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-07-23 13:41:49,768 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:49,768 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 13:41:49,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:49,768 INFO L185 omatonBuilderFactory]: Interpolants [66433#(<= ULTIMATE.start_main_~x~4 15), 66432#(<= ULTIMATE.start_main_~x~4 14), 66435#(<= ULTIMATE.start_main_~x~4 17), 66434#(<= ULTIMATE.start_main_~x~4 16), 66437#(<= ULTIMATE.start_main_~x~4 19), 66436#(<= ULTIMATE.start_main_~x~4 18), 66439#(<= ULTIMATE.start_main_~x~4 21), 66438#(<= ULTIMATE.start_main_~x~4 20), 66441#(<= ULTIMATE.start_main_~x~4 23), 66440#(<= ULTIMATE.start_main_~x~4 22), 66443#(<= ULTIMATE.start_main_~x~4 25), 66442#(<= ULTIMATE.start_main_~x~4 24), 66445#(<= ULTIMATE.start_main_~x~4 27), 66444#(<= ULTIMATE.start_main_~x~4 26), 66447#(<= ULTIMATE.start_main_~x~4 29), 66446#(<= ULTIMATE.start_main_~x~4 28), 66449#(<= ULTIMATE.start_main_~x~4 31), 66448#(<= ULTIMATE.start_main_~x~4 30), 66451#(<= ULTIMATE.start_main_~x~4 33), 66450#(<= ULTIMATE.start_main_~x~4 32), 66453#(<= ULTIMATE.start_main_~x~4 35), 66452#(<= ULTIMATE.start_main_~x~4 34), 66455#(<= ULTIMATE.start_main_~x~4 37), 66454#(<= ULTIMATE.start_main_~x~4 36), 66457#(<= ULTIMATE.start_main_~x~4 39), 66456#(<= ULTIMATE.start_main_~x~4 38), 66459#(<= ULTIMATE.start_main_~x~4 41), 66458#(<= ULTIMATE.start_main_~x~4 40), 66461#(<= ULTIMATE.start_main_~x~4 43), 66460#(<= ULTIMATE.start_main_~x~4 42), 66463#(<= ULTIMATE.start_main_~x~4 45), 66462#(<= ULTIMATE.start_main_~x~4 44), 66465#(<= ULTIMATE.start_main_~x~4 47), 66464#(<= ULTIMATE.start_main_~x~4 46), 66467#(<= ULTIMATE.start_main_~x~4 49), 66466#(<= ULTIMATE.start_main_~x~4 48), 66468#(<= ULTIMATE.start_main_~x~4 50), 66417#false, 66416#true, 66419#(<= ULTIMATE.start_main_~x~4 1), 66418#(<= ULTIMATE.start_main_~x~4 0), 66421#(<= ULTIMATE.start_main_~x~4 3), 66420#(<= ULTIMATE.start_main_~x~4 2), 66423#(<= ULTIMATE.start_main_~x~4 5), 66422#(<= ULTIMATE.start_main_~x~4 4), 66425#(<= ULTIMATE.start_main_~x~4 7), 66424#(<= ULTIMATE.start_main_~x~4 6), 66427#(<= ULTIMATE.start_main_~x~4 9), 66426#(<= ULTIMATE.start_main_~x~4 8), 66429#(<= ULTIMATE.start_main_~x~4 11), 66428#(<= ULTIMATE.start_main_~x~4 10), 66431#(<= ULTIMATE.start_main_~x~4 13), 66430#(<= ULTIMATE.start_main_~x~4 12)] [2018-07-23 13:41:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-07-23 13:41:49,773 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 13:41:49,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 13:41:49,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:41:49,774 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-07-23 13:41:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:50,112 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-07-23 13:41:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 13:41:50,112 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-07-23 13:41:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:50,115 INFO L225 Difference]: With dead ends: 629 [2018-07-23 13:41:50,115 INFO L226 Difference]: Without dead ends: 627 [2018-07-23 13:41:50,116 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 13:41:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-07-23 13:41:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-07-23 13:41:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-07-23 13:41:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-07-23 13:41:50,480 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-07-23 13:41:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:50,480 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-07-23 13:41:50,480 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 13:41:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-07-23 13:41:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-07-23 13:41:50,485 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:50,485 INFO L357 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-07-23 13:41:50,485 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:50,486 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 60 times [2018-07-23 13:41:50,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-07-23 13:41:50,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:50,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 13:41:50,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:50,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:41:50,948 INFO L185 omatonBuilderFactory]: Interpolants [68993#(<= ULTIMATE.start_main_~x~4 32), 68992#(<= ULTIMATE.start_main_~x~4 31), 68995#(<= ULTIMATE.start_main_~x~4 34), 68994#(<= ULTIMATE.start_main_~x~4 33), 68997#(<= ULTIMATE.start_main_~x~4 36), 68996#(<= ULTIMATE.start_main_~x~4 35), 68999#(<= ULTIMATE.start_main_~x~4 38), 68998#(<= ULTIMATE.start_main_~x~4 37), 69001#(<= ULTIMATE.start_main_~x~4 40), 69000#(<= ULTIMATE.start_main_~x~4 39), 69003#(<= ULTIMATE.start_main_~x~4 42), 69002#(<= ULTIMATE.start_main_~x~4 41), 69005#(<= ULTIMATE.start_main_~x~4 44), 69004#(<= ULTIMATE.start_main_~x~4 43), 69007#(<= ULTIMATE.start_main_~x~4 46), 69006#(<= ULTIMATE.start_main_~x~4 45), 69009#(<= ULTIMATE.start_main_~x~4 48), 69008#(<= ULTIMATE.start_main_~x~4 47), 69011#(<= ULTIMATE.start_main_~x~4 50), 69010#(<= ULTIMATE.start_main_~x~4 49), 69012#(<= ULTIMATE.start_main_~x~4 51), 68959#true, 68961#(<= ULTIMATE.start_main_~x~4 0), 68960#false, 68963#(<= ULTIMATE.start_main_~x~4 2), 68962#(<= ULTIMATE.start_main_~x~4 1), 68965#(<= ULTIMATE.start_main_~x~4 4), 68964#(<= ULTIMATE.start_main_~x~4 3), 68967#(<= ULTIMATE.start_main_~x~4 6), 68966#(<= ULTIMATE.start_main_~x~4 5), 68969#(<= ULTIMATE.start_main_~x~4 8), 68968#(<= ULTIMATE.start_main_~x~4 7), 68971#(<= ULTIMATE.start_main_~x~4 10), 68970#(<= ULTIMATE.start_main_~x~4 9), 68973#(<= ULTIMATE.start_main_~x~4 12), 68972#(<= ULTIMATE.start_main_~x~4 11), 68975#(<= ULTIMATE.start_main_~x~4 14), 68974#(<= ULTIMATE.start_main_~x~4 13), 68977#(<= ULTIMATE.start_main_~x~4 16), 68976#(<= ULTIMATE.start_main_~x~4 15), 68979#(<= ULTIMATE.start_main_~x~4 18), 68978#(<= ULTIMATE.start_main_~x~4 17), 68981#(<= ULTIMATE.start_main_~x~4 20), 68980#(<= ULTIMATE.start_main_~x~4 19), 68983#(<= ULTIMATE.start_main_~x~4 22), 68982#(<= ULTIMATE.start_main_~x~4 21), 68985#(<= ULTIMATE.start_main_~x~4 24), 68984#(<= ULTIMATE.start_main_~x~4 23), 68987#(<= ULTIMATE.start_main_~x~4 26), 68986#(<= ULTIMATE.start_main_~x~4 25), 68989#(<= ULTIMATE.start_main_~x~4 28), 68988#(<= ULTIMATE.start_main_~x~4 27), 68991#(<= ULTIMATE.start_main_~x~4 30), 68990#(<= ULTIMATE.start_main_~x~4 29)] [2018-07-23 13:41:50,954 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-07-23 13:41:50,955 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 13:41:50,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 13:41:50,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 13:41:50,955 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-07-23 13:41:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:51,298 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-07-23 13:41:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 13:41:51,298 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-07-23 13:41:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:51,301 INFO L225 Difference]: With dead ends: 641 [2018-07-23 13:41:51,302 INFO L226 Difference]: Without dead ends: 639 [2018-07-23 13:41:51,302 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 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:41:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-07-23 13:41:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-07-23 13:41:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-07-23 13:41:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-07-23 13:41:51,638 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-07-23 13:41:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:51,639 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-07-23 13:41:51,639 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 13:41:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-07-23 13:41:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-07-23 13:41:51,642 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:51,642 INFO L357 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-07-23 13:41:51,642 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 61 times [2018-07-23 13:41:51,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-07-23 13:41:52,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:52,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 13:41:52,109 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:52,109 INFO L185 omatonBuilderFactory]: Interpolants [71553#(<= ULTIMATE.start_main_~x~4 0), 71552#false, 71555#(<= ULTIMATE.start_main_~x~4 2), 71554#(<= ULTIMATE.start_main_~x~4 1), 71557#(<= ULTIMATE.start_main_~x~4 4), 71556#(<= ULTIMATE.start_main_~x~4 3), 71559#(<= ULTIMATE.start_main_~x~4 6), 71558#(<= ULTIMATE.start_main_~x~4 5), 71561#(<= ULTIMATE.start_main_~x~4 8), 71560#(<= ULTIMATE.start_main_~x~4 7), 71563#(<= ULTIMATE.start_main_~x~4 10), 71562#(<= ULTIMATE.start_main_~x~4 9), 71565#(<= ULTIMATE.start_main_~x~4 12), 71564#(<= ULTIMATE.start_main_~x~4 11), 71567#(<= ULTIMATE.start_main_~x~4 14), 71566#(<= ULTIMATE.start_main_~x~4 13), 71569#(<= ULTIMATE.start_main_~x~4 16), 71568#(<= ULTIMATE.start_main_~x~4 15), 71571#(<= ULTIMATE.start_main_~x~4 18), 71570#(<= ULTIMATE.start_main_~x~4 17), 71573#(<= ULTIMATE.start_main_~x~4 20), 71572#(<= ULTIMATE.start_main_~x~4 19), 71575#(<= ULTIMATE.start_main_~x~4 22), 71574#(<= ULTIMATE.start_main_~x~4 21), 71577#(<= ULTIMATE.start_main_~x~4 24), 71576#(<= ULTIMATE.start_main_~x~4 23), 71579#(<= ULTIMATE.start_main_~x~4 26), 71578#(<= ULTIMATE.start_main_~x~4 25), 71581#(<= ULTIMATE.start_main_~x~4 28), 71580#(<= ULTIMATE.start_main_~x~4 27), 71583#(<= ULTIMATE.start_main_~x~4 30), 71582#(<= ULTIMATE.start_main_~x~4 29), 71585#(<= ULTIMATE.start_main_~x~4 32), 71584#(<= ULTIMATE.start_main_~x~4 31), 71587#(<= ULTIMATE.start_main_~x~4 34), 71586#(<= ULTIMATE.start_main_~x~4 33), 71589#(<= ULTIMATE.start_main_~x~4 36), 71588#(<= ULTIMATE.start_main_~x~4 35), 71591#(<= ULTIMATE.start_main_~x~4 38), 71590#(<= ULTIMATE.start_main_~x~4 37), 71593#(<= ULTIMATE.start_main_~x~4 40), 71592#(<= ULTIMATE.start_main_~x~4 39), 71595#(<= ULTIMATE.start_main_~x~4 42), 71594#(<= ULTIMATE.start_main_~x~4 41), 71597#(<= ULTIMATE.start_main_~x~4 44), 71596#(<= ULTIMATE.start_main_~x~4 43), 71599#(<= ULTIMATE.start_main_~x~4 46), 71598#(<= ULTIMATE.start_main_~x~4 45), 71601#(<= ULTIMATE.start_main_~x~4 48), 71600#(<= ULTIMATE.start_main_~x~4 47), 71603#(<= ULTIMATE.start_main_~x~4 50), 71602#(<= ULTIMATE.start_main_~x~4 49), 71605#(<= ULTIMATE.start_main_~x~4 52), 71604#(<= ULTIMATE.start_main_~x~4 51), 71551#true] [2018-07-23 13:41:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-07-23 13:41:52,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 13:41:52,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 13:41:52,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 13:41:52,116 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-07-23 13:41:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:52,492 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-07-23 13:41:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 13:41:52,492 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-07-23 13:41:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:52,495 INFO L225 Difference]: With dead ends: 653 [2018-07-23 13:41:52,495 INFO L226 Difference]: Without dead ends: 651 [2018-07-23 13:41:52,496 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 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:41:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-07-23 13:41:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-07-23 13:41:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-07-23 13:41:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-07-23 13:41:52,831 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-07-23 13:41:52,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:52,832 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-07-23 13:41:52,832 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 13:41:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-07-23 13:41:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-07-23 13:41:52,835 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:52,835 INFO L357 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-07-23 13:41:52,835 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 62 times [2018-07-23 13:41:52,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-07-23 13:41:53,250 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:53,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 13:41:53,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:53,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:41:53,253 INFO L185 omatonBuilderFactory]: Interpolants [74241#(<= ULTIMATE.start_main_~x~4 47), 74240#(<= ULTIMATE.start_main_~x~4 46), 74243#(<= ULTIMATE.start_main_~x~4 49), 74242#(<= ULTIMATE.start_main_~x~4 48), 74245#(<= ULTIMATE.start_main_~x~4 51), 74244#(<= ULTIMATE.start_main_~x~4 50), 74247#(<= ULTIMATE.start_main_~x~4 53), 74246#(<= ULTIMATE.start_main_~x~4 52), 74193#false, 74192#true, 74195#(<= ULTIMATE.start_main_~x~4 1), 74194#(<= ULTIMATE.start_main_~x~4 0), 74197#(<= ULTIMATE.start_main_~x~4 3), 74196#(<= ULTIMATE.start_main_~x~4 2), 74199#(<= ULTIMATE.start_main_~x~4 5), 74198#(<= ULTIMATE.start_main_~x~4 4), 74201#(<= ULTIMATE.start_main_~x~4 7), 74200#(<= ULTIMATE.start_main_~x~4 6), 74203#(<= ULTIMATE.start_main_~x~4 9), 74202#(<= ULTIMATE.start_main_~x~4 8), 74205#(<= ULTIMATE.start_main_~x~4 11), 74204#(<= ULTIMATE.start_main_~x~4 10), 74207#(<= ULTIMATE.start_main_~x~4 13), 74206#(<= ULTIMATE.start_main_~x~4 12), 74209#(<= ULTIMATE.start_main_~x~4 15), 74208#(<= ULTIMATE.start_main_~x~4 14), 74211#(<= ULTIMATE.start_main_~x~4 17), 74210#(<= ULTIMATE.start_main_~x~4 16), 74213#(<= ULTIMATE.start_main_~x~4 19), 74212#(<= ULTIMATE.start_main_~x~4 18), 74215#(<= ULTIMATE.start_main_~x~4 21), 74214#(<= ULTIMATE.start_main_~x~4 20), 74217#(<= ULTIMATE.start_main_~x~4 23), 74216#(<= ULTIMATE.start_main_~x~4 22), 74219#(<= ULTIMATE.start_main_~x~4 25), 74218#(<= ULTIMATE.start_main_~x~4 24), 74221#(<= ULTIMATE.start_main_~x~4 27), 74220#(<= ULTIMATE.start_main_~x~4 26), 74223#(<= ULTIMATE.start_main_~x~4 29), 74222#(<= ULTIMATE.start_main_~x~4 28), 74225#(<= ULTIMATE.start_main_~x~4 31), 74224#(<= ULTIMATE.start_main_~x~4 30), 74227#(<= ULTIMATE.start_main_~x~4 33), 74226#(<= ULTIMATE.start_main_~x~4 32), 74229#(<= ULTIMATE.start_main_~x~4 35), 74228#(<= ULTIMATE.start_main_~x~4 34), 74231#(<= ULTIMATE.start_main_~x~4 37), 74230#(<= ULTIMATE.start_main_~x~4 36), 74233#(<= ULTIMATE.start_main_~x~4 39), 74232#(<= ULTIMATE.start_main_~x~4 38), 74235#(<= ULTIMATE.start_main_~x~4 41), 74234#(<= ULTIMATE.start_main_~x~4 40), 74237#(<= ULTIMATE.start_main_~x~4 43), 74236#(<= ULTIMATE.start_main_~x~4 42), 74239#(<= ULTIMATE.start_main_~x~4 45), 74238#(<= ULTIMATE.start_main_~x~4 44)] [2018-07-23 13:41:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-07-23 13:41:53,262 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 13:41:53,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 13:41:53,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 13:41:53,263 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-07-23 13:41:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:53,631 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-07-23 13:41:53,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 13:41:53,632 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-07-23 13:41:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:53,635 INFO L225 Difference]: With dead ends: 665 [2018-07-23 13:41:53,635 INFO L226 Difference]: Without dead ends: 663 [2018-07-23 13:41:53,635 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 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:41:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-07-23 13:41:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-07-23 13:41:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-07-23 13:41:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-07-23 13:41:53,980 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-07-23 13:41:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:53,981 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-07-23 13:41:53,981 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 13:41:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-07-23 13:41:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-07-23 13:41:53,986 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:53,986 INFO L357 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-07-23 13:41:53,987 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 63 times [2018-07-23 13:41:53,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-07-23 13:41:54,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:54,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 13:41:54,442 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:54,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:41:54,443 INFO L185 omatonBuilderFactory]: Interpolants [76929#(<= ULTIMATE.start_main_~x~4 45), 76928#(<= ULTIMATE.start_main_~x~4 44), 76931#(<= ULTIMATE.start_main_~x~4 47), 76930#(<= ULTIMATE.start_main_~x~4 46), 76933#(<= ULTIMATE.start_main_~x~4 49), 76932#(<= ULTIMATE.start_main_~x~4 48), 76935#(<= ULTIMATE.start_main_~x~4 51), 76934#(<= ULTIMATE.start_main_~x~4 50), 76937#(<= ULTIMATE.start_main_~x~4 53), 76936#(<= ULTIMATE.start_main_~x~4 52), 76938#(<= ULTIMATE.start_main_~x~4 54), 76883#false, 76882#true, 76885#(<= ULTIMATE.start_main_~x~4 1), 76884#(<= ULTIMATE.start_main_~x~4 0), 76887#(<= ULTIMATE.start_main_~x~4 3), 76886#(<= ULTIMATE.start_main_~x~4 2), 76889#(<= ULTIMATE.start_main_~x~4 5), 76888#(<= ULTIMATE.start_main_~x~4 4), 76891#(<= ULTIMATE.start_main_~x~4 7), 76890#(<= ULTIMATE.start_main_~x~4 6), 76893#(<= ULTIMATE.start_main_~x~4 9), 76892#(<= ULTIMATE.start_main_~x~4 8), 76895#(<= ULTIMATE.start_main_~x~4 11), 76894#(<= ULTIMATE.start_main_~x~4 10), 76897#(<= ULTIMATE.start_main_~x~4 13), 76896#(<= ULTIMATE.start_main_~x~4 12), 76899#(<= ULTIMATE.start_main_~x~4 15), 76898#(<= ULTIMATE.start_main_~x~4 14), 76901#(<= ULTIMATE.start_main_~x~4 17), 76900#(<= ULTIMATE.start_main_~x~4 16), 76903#(<= ULTIMATE.start_main_~x~4 19), 76902#(<= ULTIMATE.start_main_~x~4 18), 76905#(<= ULTIMATE.start_main_~x~4 21), 76904#(<= ULTIMATE.start_main_~x~4 20), 76907#(<= ULTIMATE.start_main_~x~4 23), 76906#(<= ULTIMATE.start_main_~x~4 22), 76909#(<= ULTIMATE.start_main_~x~4 25), 76908#(<= ULTIMATE.start_main_~x~4 24), 76911#(<= ULTIMATE.start_main_~x~4 27), 76910#(<= ULTIMATE.start_main_~x~4 26), 76913#(<= ULTIMATE.start_main_~x~4 29), 76912#(<= ULTIMATE.start_main_~x~4 28), 76915#(<= ULTIMATE.start_main_~x~4 31), 76914#(<= ULTIMATE.start_main_~x~4 30), 76917#(<= ULTIMATE.start_main_~x~4 33), 76916#(<= ULTIMATE.start_main_~x~4 32), 76919#(<= ULTIMATE.start_main_~x~4 35), 76918#(<= ULTIMATE.start_main_~x~4 34), 76921#(<= ULTIMATE.start_main_~x~4 37), 76920#(<= ULTIMATE.start_main_~x~4 36), 76923#(<= ULTIMATE.start_main_~x~4 39), 76922#(<= ULTIMATE.start_main_~x~4 38), 76925#(<= ULTIMATE.start_main_~x~4 41), 76924#(<= ULTIMATE.start_main_~x~4 40), 76927#(<= ULTIMATE.start_main_~x~4 43), 76926#(<= ULTIMATE.start_main_~x~4 42)] [2018-07-23 13:41:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-07-23 13:41:54,448 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 13:41:54,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 13:41:54,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 13:41:54,449 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-07-23 13:41:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:54,967 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-07-23 13:41:54,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 13:41:54,967 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-07-23 13:41:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:54,969 INFO L225 Difference]: With dead ends: 677 [2018-07-23 13:41:54,969 INFO L226 Difference]: Without dead ends: 675 [2018-07-23 13:41:54,970 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 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:41:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-07-23 13:41:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-07-23 13:41:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-07-23 13:41:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-07-23 13:41:55,328 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-07-23 13:41:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:55,328 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-07-23 13:41:55,329 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 13:41:55,329 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-07-23 13:41:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-07-23 13:41:55,332 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:55,332 INFO L357 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-07-23 13:41:55,332 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:55,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 64 times [2018-07-23 13:41:55,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-07-23 13:41:55,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:55,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 13:41:55,737 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:55,737 INFO L185 omatonBuilderFactory]: Interpolants [79621#true, 79623#(<= ULTIMATE.start_main_~x~4 0), 79622#false, 79625#(<= ULTIMATE.start_main_~x~4 2), 79624#(<= ULTIMATE.start_main_~x~4 1), 79627#(<= ULTIMATE.start_main_~x~4 4), 79626#(<= ULTIMATE.start_main_~x~4 3), 79629#(<= ULTIMATE.start_main_~x~4 6), 79628#(<= ULTIMATE.start_main_~x~4 5), 79631#(<= ULTIMATE.start_main_~x~4 8), 79630#(<= ULTIMATE.start_main_~x~4 7), 79633#(<= ULTIMATE.start_main_~x~4 10), 79632#(<= ULTIMATE.start_main_~x~4 9), 79635#(<= ULTIMATE.start_main_~x~4 12), 79634#(<= ULTIMATE.start_main_~x~4 11), 79637#(<= ULTIMATE.start_main_~x~4 14), 79636#(<= ULTIMATE.start_main_~x~4 13), 79639#(<= ULTIMATE.start_main_~x~4 16), 79638#(<= ULTIMATE.start_main_~x~4 15), 79641#(<= ULTIMATE.start_main_~x~4 18), 79640#(<= ULTIMATE.start_main_~x~4 17), 79643#(<= ULTIMATE.start_main_~x~4 20), 79642#(<= ULTIMATE.start_main_~x~4 19), 79645#(<= ULTIMATE.start_main_~x~4 22), 79644#(<= ULTIMATE.start_main_~x~4 21), 79647#(<= ULTIMATE.start_main_~x~4 24), 79646#(<= ULTIMATE.start_main_~x~4 23), 79649#(<= ULTIMATE.start_main_~x~4 26), 79648#(<= ULTIMATE.start_main_~x~4 25), 79651#(<= ULTIMATE.start_main_~x~4 28), 79650#(<= ULTIMATE.start_main_~x~4 27), 79653#(<= ULTIMATE.start_main_~x~4 30), 79652#(<= ULTIMATE.start_main_~x~4 29), 79655#(<= ULTIMATE.start_main_~x~4 32), 79654#(<= ULTIMATE.start_main_~x~4 31), 79657#(<= ULTIMATE.start_main_~x~4 34), 79656#(<= ULTIMATE.start_main_~x~4 33), 79659#(<= ULTIMATE.start_main_~x~4 36), 79658#(<= ULTIMATE.start_main_~x~4 35), 79661#(<= ULTIMATE.start_main_~x~4 38), 79660#(<= ULTIMATE.start_main_~x~4 37), 79663#(<= ULTIMATE.start_main_~x~4 40), 79662#(<= ULTIMATE.start_main_~x~4 39), 79665#(<= ULTIMATE.start_main_~x~4 42), 79664#(<= ULTIMATE.start_main_~x~4 41), 79667#(<= ULTIMATE.start_main_~x~4 44), 79666#(<= ULTIMATE.start_main_~x~4 43), 79669#(<= ULTIMATE.start_main_~x~4 46), 79668#(<= ULTIMATE.start_main_~x~4 45), 79671#(<= ULTIMATE.start_main_~x~4 48), 79670#(<= ULTIMATE.start_main_~x~4 47), 79673#(<= ULTIMATE.start_main_~x~4 50), 79672#(<= ULTIMATE.start_main_~x~4 49), 79675#(<= ULTIMATE.start_main_~x~4 52), 79674#(<= ULTIMATE.start_main_~x~4 51), 79677#(<= ULTIMATE.start_main_~x~4 54), 79676#(<= ULTIMATE.start_main_~x~4 53), 79678#(<= ULTIMATE.start_main_~x~4 55)] [2018-07-23 13:41:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-07-23 13:41:55,743 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 13:41:55,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 13:41:55,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 13:41:55,744 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-07-23 13:41:56,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:56,171 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-07-23 13:41:56,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 13:41:56,171 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-07-23 13:41:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:56,174 INFO L225 Difference]: With dead ends: 689 [2018-07-23 13:41:56,174 INFO L226 Difference]: Without dead ends: 687 [2018-07-23 13:41:56,175 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 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:41:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-07-23 13:41:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-07-23 13:41:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-07-23 13:41:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-07-23 13:41:56,593 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-07-23 13:41:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:56,594 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-07-23 13:41:56,594 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 13:41:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-07-23 13:41:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-07-23 13:41:56,598 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:56,598 INFO L357 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-07-23 13:41:56,598 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 65 times [2018-07-23 13:41:56,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-07-23 13:41:57,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:57,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 13:41:57,026 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:57,027 INFO L185 omatonBuilderFactory]: Interpolants [82433#(<= ULTIMATE.start_main_~x~4 22), 82432#(<= ULTIMATE.start_main_~x~4 21), 82435#(<= ULTIMATE.start_main_~x~4 24), 82434#(<= ULTIMATE.start_main_~x~4 23), 82437#(<= ULTIMATE.start_main_~x~4 26), 82436#(<= ULTIMATE.start_main_~x~4 25), 82439#(<= ULTIMATE.start_main_~x~4 28), 82438#(<= ULTIMATE.start_main_~x~4 27), 82441#(<= ULTIMATE.start_main_~x~4 30), 82440#(<= ULTIMATE.start_main_~x~4 29), 82443#(<= ULTIMATE.start_main_~x~4 32), 82442#(<= ULTIMATE.start_main_~x~4 31), 82445#(<= ULTIMATE.start_main_~x~4 34), 82444#(<= ULTIMATE.start_main_~x~4 33), 82447#(<= ULTIMATE.start_main_~x~4 36), 82446#(<= ULTIMATE.start_main_~x~4 35), 82449#(<= ULTIMATE.start_main_~x~4 38), 82448#(<= ULTIMATE.start_main_~x~4 37), 82451#(<= ULTIMATE.start_main_~x~4 40), 82450#(<= ULTIMATE.start_main_~x~4 39), 82453#(<= ULTIMATE.start_main_~x~4 42), 82452#(<= ULTIMATE.start_main_~x~4 41), 82455#(<= ULTIMATE.start_main_~x~4 44), 82454#(<= ULTIMATE.start_main_~x~4 43), 82457#(<= ULTIMATE.start_main_~x~4 46), 82456#(<= ULTIMATE.start_main_~x~4 45), 82459#(<= ULTIMATE.start_main_~x~4 48), 82458#(<= ULTIMATE.start_main_~x~4 47), 82461#(<= ULTIMATE.start_main_~x~4 50), 82460#(<= ULTIMATE.start_main_~x~4 49), 82463#(<= ULTIMATE.start_main_~x~4 52), 82462#(<= ULTIMATE.start_main_~x~4 51), 82465#(<= ULTIMATE.start_main_~x~4 54), 82464#(<= ULTIMATE.start_main_~x~4 53), 82467#(<= ULTIMATE.start_main_~x~4 56), 82466#(<= ULTIMATE.start_main_~x~4 55), 82409#true, 82411#(<= ULTIMATE.start_main_~x~4 0), 82410#false, 82413#(<= ULTIMATE.start_main_~x~4 2), 82412#(<= ULTIMATE.start_main_~x~4 1), 82415#(<= ULTIMATE.start_main_~x~4 4), 82414#(<= ULTIMATE.start_main_~x~4 3), 82417#(<= ULTIMATE.start_main_~x~4 6), 82416#(<= ULTIMATE.start_main_~x~4 5), 82419#(<= ULTIMATE.start_main_~x~4 8), 82418#(<= ULTIMATE.start_main_~x~4 7), 82421#(<= ULTIMATE.start_main_~x~4 10), 82420#(<= ULTIMATE.start_main_~x~4 9), 82423#(<= ULTIMATE.start_main_~x~4 12), 82422#(<= ULTIMATE.start_main_~x~4 11), 82425#(<= ULTIMATE.start_main_~x~4 14), 82424#(<= ULTIMATE.start_main_~x~4 13), 82427#(<= ULTIMATE.start_main_~x~4 16), 82426#(<= ULTIMATE.start_main_~x~4 15), 82429#(<= ULTIMATE.start_main_~x~4 18), 82428#(<= ULTIMATE.start_main_~x~4 17), 82431#(<= ULTIMATE.start_main_~x~4 20), 82430#(<= ULTIMATE.start_main_~x~4 19)] [2018-07-23 13:41:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-07-23 13:41:57,033 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 13:41:57,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 13:41:57,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 13:41:57,034 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-07-23 13:41:57,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:57,448 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-07-23 13:41:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 13:41:57,448 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-07-23 13:41:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:57,451 INFO L225 Difference]: With dead ends: 701 [2018-07-23 13:41:57,451 INFO L226 Difference]: Without dead ends: 699 [2018-07-23 13:41:57,452 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 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:41:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-07-23 13:41:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-07-23 13:41:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-07-23 13:41:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-07-23 13:41:57,833 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-07-23 13:41:57,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:57,834 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-07-23 13:41:57,834 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 13:41:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-07-23 13:41:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-07-23 13:41:57,838 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:57,839 INFO L357 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-07-23 13:41:57,839 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:57,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 66 times [2018-07-23 13:41:57,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-07-23 13:41:58,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:58,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 13:41:58,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:41:58,363 INFO L185 omatonBuilderFactory]: Interpolants [85249#(<= ULTIMATE.start_main_~x~4 1), 85248#(<= ULTIMATE.start_main_~x~4 0), 85251#(<= ULTIMATE.start_main_~x~4 3), 85250#(<= ULTIMATE.start_main_~x~4 2), 85253#(<= ULTIMATE.start_main_~x~4 5), 85252#(<= ULTIMATE.start_main_~x~4 4), 85255#(<= ULTIMATE.start_main_~x~4 7), 85254#(<= ULTIMATE.start_main_~x~4 6), 85257#(<= ULTIMATE.start_main_~x~4 9), 85256#(<= ULTIMATE.start_main_~x~4 8), 85259#(<= ULTIMATE.start_main_~x~4 11), 85258#(<= ULTIMATE.start_main_~x~4 10), 85261#(<= ULTIMATE.start_main_~x~4 13), 85260#(<= ULTIMATE.start_main_~x~4 12), 85263#(<= ULTIMATE.start_main_~x~4 15), 85262#(<= ULTIMATE.start_main_~x~4 14), 85265#(<= ULTIMATE.start_main_~x~4 17), 85264#(<= ULTIMATE.start_main_~x~4 16), 85267#(<= ULTIMATE.start_main_~x~4 19), 85266#(<= ULTIMATE.start_main_~x~4 18), 85269#(<= ULTIMATE.start_main_~x~4 21), 85268#(<= ULTIMATE.start_main_~x~4 20), 85271#(<= ULTIMATE.start_main_~x~4 23), 85270#(<= ULTIMATE.start_main_~x~4 22), 85273#(<= ULTIMATE.start_main_~x~4 25), 85272#(<= ULTIMATE.start_main_~x~4 24), 85275#(<= ULTIMATE.start_main_~x~4 27), 85274#(<= ULTIMATE.start_main_~x~4 26), 85277#(<= ULTIMATE.start_main_~x~4 29), 85276#(<= ULTIMATE.start_main_~x~4 28), 85279#(<= ULTIMATE.start_main_~x~4 31), 85278#(<= ULTIMATE.start_main_~x~4 30), 85281#(<= ULTIMATE.start_main_~x~4 33), 85280#(<= ULTIMATE.start_main_~x~4 32), 85283#(<= ULTIMATE.start_main_~x~4 35), 85282#(<= ULTIMATE.start_main_~x~4 34), 85285#(<= ULTIMATE.start_main_~x~4 37), 85284#(<= ULTIMATE.start_main_~x~4 36), 85287#(<= ULTIMATE.start_main_~x~4 39), 85286#(<= ULTIMATE.start_main_~x~4 38), 85289#(<= ULTIMATE.start_main_~x~4 41), 85288#(<= ULTIMATE.start_main_~x~4 40), 85291#(<= ULTIMATE.start_main_~x~4 43), 85290#(<= ULTIMATE.start_main_~x~4 42), 85293#(<= ULTIMATE.start_main_~x~4 45), 85292#(<= ULTIMATE.start_main_~x~4 44), 85295#(<= ULTIMATE.start_main_~x~4 47), 85294#(<= ULTIMATE.start_main_~x~4 46), 85297#(<= ULTIMATE.start_main_~x~4 49), 85296#(<= ULTIMATE.start_main_~x~4 48), 85299#(<= ULTIMATE.start_main_~x~4 51), 85298#(<= ULTIMATE.start_main_~x~4 50), 85301#(<= ULTIMATE.start_main_~x~4 53), 85300#(<= ULTIMATE.start_main_~x~4 52), 85303#(<= ULTIMATE.start_main_~x~4 55), 85302#(<= ULTIMATE.start_main_~x~4 54), 85305#(<= ULTIMATE.start_main_~x~4 57), 85304#(<= ULTIMATE.start_main_~x~4 56), 85247#false, 85246#true] [2018-07-23 13:41:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-07-23 13:41:58,369 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 13:41:58,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 13:41:58,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 13:41:58,369 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-07-23 13:41:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:41:58,818 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-07-23 13:41:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 13:41:58,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-07-23 13:41:58,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:41:58,821 INFO L225 Difference]: With dead ends: 713 [2018-07-23 13:41:58,821 INFO L226 Difference]: Without dead ends: 711 [2018-07-23 13:41:58,822 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 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:41:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-07-23 13:41:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-07-23 13:41:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-07-23 13:41:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-07-23 13:41:59,251 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-07-23 13:41:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:41:59,251 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-07-23 13:41:59,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 13:41:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-07-23 13:41:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-07-23 13:41:59,256 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:41:59,256 INFO L357 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-07-23 13:41:59,256 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:41:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 67 times [2018-07-23 13:41:59,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:41:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:41:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-07-23 13:41:59,716 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:41:59,716 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 13:41:59,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:41:59,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:41:59,717 INFO L185 omatonBuilderFactory]: Interpolants [88192#(<= ULTIMATE.start_main_~x~4 58), 88133#false, 88132#true, 88135#(<= ULTIMATE.start_main_~x~4 1), 88134#(<= ULTIMATE.start_main_~x~4 0), 88137#(<= ULTIMATE.start_main_~x~4 3), 88136#(<= ULTIMATE.start_main_~x~4 2), 88139#(<= ULTIMATE.start_main_~x~4 5), 88138#(<= ULTIMATE.start_main_~x~4 4), 88141#(<= ULTIMATE.start_main_~x~4 7), 88140#(<= ULTIMATE.start_main_~x~4 6), 88143#(<= ULTIMATE.start_main_~x~4 9), 88142#(<= ULTIMATE.start_main_~x~4 8), 88145#(<= ULTIMATE.start_main_~x~4 11), 88144#(<= ULTIMATE.start_main_~x~4 10), 88147#(<= ULTIMATE.start_main_~x~4 13), 88146#(<= ULTIMATE.start_main_~x~4 12), 88149#(<= ULTIMATE.start_main_~x~4 15), 88148#(<= ULTIMATE.start_main_~x~4 14), 88151#(<= ULTIMATE.start_main_~x~4 17), 88150#(<= ULTIMATE.start_main_~x~4 16), 88153#(<= ULTIMATE.start_main_~x~4 19), 88152#(<= ULTIMATE.start_main_~x~4 18), 88155#(<= ULTIMATE.start_main_~x~4 21), 88154#(<= ULTIMATE.start_main_~x~4 20), 88157#(<= ULTIMATE.start_main_~x~4 23), 88156#(<= ULTIMATE.start_main_~x~4 22), 88159#(<= ULTIMATE.start_main_~x~4 25), 88158#(<= ULTIMATE.start_main_~x~4 24), 88161#(<= ULTIMATE.start_main_~x~4 27), 88160#(<= ULTIMATE.start_main_~x~4 26), 88163#(<= ULTIMATE.start_main_~x~4 29), 88162#(<= ULTIMATE.start_main_~x~4 28), 88165#(<= ULTIMATE.start_main_~x~4 31), 88164#(<= ULTIMATE.start_main_~x~4 30), 88167#(<= ULTIMATE.start_main_~x~4 33), 88166#(<= ULTIMATE.start_main_~x~4 32), 88169#(<= ULTIMATE.start_main_~x~4 35), 88168#(<= ULTIMATE.start_main_~x~4 34), 88171#(<= ULTIMATE.start_main_~x~4 37), 88170#(<= ULTIMATE.start_main_~x~4 36), 88173#(<= ULTIMATE.start_main_~x~4 39), 88172#(<= ULTIMATE.start_main_~x~4 38), 88175#(<= ULTIMATE.start_main_~x~4 41), 88174#(<= ULTIMATE.start_main_~x~4 40), 88177#(<= ULTIMATE.start_main_~x~4 43), 88176#(<= ULTIMATE.start_main_~x~4 42), 88179#(<= ULTIMATE.start_main_~x~4 45), 88178#(<= ULTIMATE.start_main_~x~4 44), 88181#(<= ULTIMATE.start_main_~x~4 47), 88180#(<= ULTIMATE.start_main_~x~4 46), 88183#(<= ULTIMATE.start_main_~x~4 49), 88182#(<= ULTIMATE.start_main_~x~4 48), 88185#(<= ULTIMATE.start_main_~x~4 51), 88184#(<= ULTIMATE.start_main_~x~4 50), 88187#(<= ULTIMATE.start_main_~x~4 53), 88186#(<= ULTIMATE.start_main_~x~4 52), 88189#(<= ULTIMATE.start_main_~x~4 55), 88188#(<= ULTIMATE.start_main_~x~4 54), 88191#(<= ULTIMATE.start_main_~x~4 57), 88190#(<= ULTIMATE.start_main_~x~4 56)] [2018-07-23 13:41:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-07-23 13:41:59,723 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 13:41:59,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 13:41:59,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 13:41:59,724 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-07-23 13:42:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:00,189 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-07-23 13:42:00,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 13:42:00,190 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-07-23 13:42:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:00,192 INFO L225 Difference]: With dead ends: 725 [2018-07-23 13:42:00,192 INFO L226 Difference]: Without dead ends: 723 [2018-07-23 13:42:00,193 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 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:42:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-07-23 13:42:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-07-23 13:42:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-07-23 13:42:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-07-23 13:42:00,620 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-07-23 13:42:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:00,621 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-07-23 13:42:00,621 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 13:42:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-07-23 13:42:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-07-23 13:42:00,624 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:00,625 INFO L357 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-07-23 13:42:00,625 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 68 times [2018-07-23 13:42:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-07-23 13:42:01,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:01,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 13:42:01,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:01,189 INFO L185 omatonBuilderFactory]: Interpolants [91067#true, 91069#(<= ULTIMATE.start_main_~x~4 0), 91068#false, 91071#(<= ULTIMATE.start_main_~x~4 2), 91070#(<= ULTIMATE.start_main_~x~4 1), 91073#(<= ULTIMATE.start_main_~x~4 4), 91072#(<= ULTIMATE.start_main_~x~4 3), 91075#(<= ULTIMATE.start_main_~x~4 6), 91074#(<= ULTIMATE.start_main_~x~4 5), 91077#(<= ULTIMATE.start_main_~x~4 8), 91076#(<= ULTIMATE.start_main_~x~4 7), 91079#(<= ULTIMATE.start_main_~x~4 10), 91078#(<= ULTIMATE.start_main_~x~4 9), 91081#(<= ULTIMATE.start_main_~x~4 12), 91080#(<= ULTIMATE.start_main_~x~4 11), 91083#(<= ULTIMATE.start_main_~x~4 14), 91082#(<= ULTIMATE.start_main_~x~4 13), 91085#(<= ULTIMATE.start_main_~x~4 16), 91084#(<= ULTIMATE.start_main_~x~4 15), 91087#(<= ULTIMATE.start_main_~x~4 18), 91086#(<= ULTIMATE.start_main_~x~4 17), 91089#(<= ULTIMATE.start_main_~x~4 20), 91088#(<= ULTIMATE.start_main_~x~4 19), 91091#(<= ULTIMATE.start_main_~x~4 22), 91090#(<= ULTIMATE.start_main_~x~4 21), 91093#(<= ULTIMATE.start_main_~x~4 24), 91092#(<= ULTIMATE.start_main_~x~4 23), 91095#(<= ULTIMATE.start_main_~x~4 26), 91094#(<= ULTIMATE.start_main_~x~4 25), 91097#(<= ULTIMATE.start_main_~x~4 28), 91096#(<= ULTIMATE.start_main_~x~4 27), 91099#(<= ULTIMATE.start_main_~x~4 30), 91098#(<= ULTIMATE.start_main_~x~4 29), 91101#(<= ULTIMATE.start_main_~x~4 32), 91100#(<= ULTIMATE.start_main_~x~4 31), 91103#(<= ULTIMATE.start_main_~x~4 34), 91102#(<= ULTIMATE.start_main_~x~4 33), 91105#(<= ULTIMATE.start_main_~x~4 36), 91104#(<= ULTIMATE.start_main_~x~4 35), 91107#(<= ULTIMATE.start_main_~x~4 38), 91106#(<= ULTIMATE.start_main_~x~4 37), 91109#(<= ULTIMATE.start_main_~x~4 40), 91108#(<= ULTIMATE.start_main_~x~4 39), 91111#(<= ULTIMATE.start_main_~x~4 42), 91110#(<= ULTIMATE.start_main_~x~4 41), 91113#(<= ULTIMATE.start_main_~x~4 44), 91112#(<= ULTIMATE.start_main_~x~4 43), 91115#(<= ULTIMATE.start_main_~x~4 46), 91114#(<= ULTIMATE.start_main_~x~4 45), 91117#(<= ULTIMATE.start_main_~x~4 48), 91116#(<= ULTIMATE.start_main_~x~4 47), 91119#(<= ULTIMATE.start_main_~x~4 50), 91118#(<= ULTIMATE.start_main_~x~4 49), 91121#(<= ULTIMATE.start_main_~x~4 52), 91120#(<= ULTIMATE.start_main_~x~4 51), 91123#(<= ULTIMATE.start_main_~x~4 54), 91122#(<= ULTIMATE.start_main_~x~4 53), 91125#(<= ULTIMATE.start_main_~x~4 56), 91124#(<= ULTIMATE.start_main_~x~4 55), 91127#(<= ULTIMATE.start_main_~x~4 58), 91126#(<= ULTIMATE.start_main_~x~4 57), 91128#(<= ULTIMATE.start_main_~x~4 59)] [2018-07-23 13:42:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-07-23 13:42:01,195 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 13:42:01,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 13:42:01,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 13:42:01,196 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-07-23 13:42:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:01,744 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-07-23 13:42:01,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 13:42:01,744 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-07-23 13:42:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:01,747 INFO L225 Difference]: With dead ends: 737 [2018-07-23 13:42:01,747 INFO L226 Difference]: Without dead ends: 735 [2018-07-23 13:42:01,747 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 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:42:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-07-23 13:42:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-07-23 13:42:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-07-23 13:42:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-07-23 13:42:02,185 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-07-23 13:42:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:02,186 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-07-23 13:42:02,186 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 13:42:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-07-23 13:42:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-07-23 13:42:02,191 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:02,192 INFO L357 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-07-23 13:42:02,192 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:02,192 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 69 times [2018-07-23 13:42:02,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-07-23 13:42:02,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:02,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 13:42:02,668 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:02,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:42:02,668 INFO L185 omatonBuilderFactory]: Interpolants [94081#(<= ULTIMATE.start_main_~x~4 28), 94080#(<= ULTIMATE.start_main_~x~4 27), 94083#(<= ULTIMATE.start_main_~x~4 30), 94082#(<= ULTIMATE.start_main_~x~4 29), 94085#(<= ULTIMATE.start_main_~x~4 32), 94084#(<= ULTIMATE.start_main_~x~4 31), 94087#(<= ULTIMATE.start_main_~x~4 34), 94086#(<= ULTIMATE.start_main_~x~4 33), 94089#(<= ULTIMATE.start_main_~x~4 36), 94088#(<= ULTIMATE.start_main_~x~4 35), 94091#(<= ULTIMATE.start_main_~x~4 38), 94090#(<= ULTIMATE.start_main_~x~4 37), 94093#(<= ULTIMATE.start_main_~x~4 40), 94092#(<= ULTIMATE.start_main_~x~4 39), 94095#(<= ULTIMATE.start_main_~x~4 42), 94094#(<= ULTIMATE.start_main_~x~4 41), 94097#(<= ULTIMATE.start_main_~x~4 44), 94096#(<= ULTIMATE.start_main_~x~4 43), 94099#(<= ULTIMATE.start_main_~x~4 46), 94098#(<= ULTIMATE.start_main_~x~4 45), 94101#(<= ULTIMATE.start_main_~x~4 48), 94100#(<= ULTIMATE.start_main_~x~4 47), 94103#(<= ULTIMATE.start_main_~x~4 50), 94102#(<= ULTIMATE.start_main_~x~4 49), 94105#(<= ULTIMATE.start_main_~x~4 52), 94104#(<= ULTIMATE.start_main_~x~4 51), 94107#(<= ULTIMATE.start_main_~x~4 54), 94106#(<= ULTIMATE.start_main_~x~4 53), 94109#(<= ULTIMATE.start_main_~x~4 56), 94108#(<= ULTIMATE.start_main_~x~4 55), 94111#(<= ULTIMATE.start_main_~x~4 58), 94110#(<= ULTIMATE.start_main_~x~4 57), 94113#(<= ULTIMATE.start_main_~x~4 60), 94112#(<= ULTIMATE.start_main_~x~4 59), 94051#true, 94053#(<= ULTIMATE.start_main_~x~4 0), 94052#false, 94055#(<= ULTIMATE.start_main_~x~4 2), 94054#(<= ULTIMATE.start_main_~x~4 1), 94057#(<= ULTIMATE.start_main_~x~4 4), 94056#(<= ULTIMATE.start_main_~x~4 3), 94059#(<= ULTIMATE.start_main_~x~4 6), 94058#(<= ULTIMATE.start_main_~x~4 5), 94061#(<= ULTIMATE.start_main_~x~4 8), 94060#(<= ULTIMATE.start_main_~x~4 7), 94063#(<= ULTIMATE.start_main_~x~4 10), 94062#(<= ULTIMATE.start_main_~x~4 9), 94065#(<= ULTIMATE.start_main_~x~4 12), 94064#(<= ULTIMATE.start_main_~x~4 11), 94067#(<= ULTIMATE.start_main_~x~4 14), 94066#(<= ULTIMATE.start_main_~x~4 13), 94069#(<= ULTIMATE.start_main_~x~4 16), 94068#(<= ULTIMATE.start_main_~x~4 15), 94071#(<= ULTIMATE.start_main_~x~4 18), 94070#(<= ULTIMATE.start_main_~x~4 17), 94073#(<= ULTIMATE.start_main_~x~4 20), 94072#(<= ULTIMATE.start_main_~x~4 19), 94075#(<= ULTIMATE.start_main_~x~4 22), 94074#(<= ULTIMATE.start_main_~x~4 21), 94077#(<= ULTIMATE.start_main_~x~4 24), 94076#(<= ULTIMATE.start_main_~x~4 23), 94079#(<= ULTIMATE.start_main_~x~4 26), 94078#(<= ULTIMATE.start_main_~x~4 25)] [2018-07-23 13:42:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-07-23 13:42:02,678 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 13:42:02,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 13:42:02,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 13:42:02,679 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-07-23 13:42:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:03,179 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-07-23 13:42:03,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 13:42:03,179 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-07-23 13:42:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:03,182 INFO L225 Difference]: With dead ends: 749 [2018-07-23 13:42:03,182 INFO L226 Difference]: Without dead ends: 747 [2018-07-23 13:42:03,183 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 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:42:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-07-23 13:42:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-07-23 13:42:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-07-23 13:42:03,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-07-23 13:42:03,634 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-07-23 13:42:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:03,634 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-07-23 13:42:03,634 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 13:42:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-07-23 13:42:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-07-23 13:42:03,638 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:03,638 INFO L357 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-07-23 13:42:03,638 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:03,638 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 70 times [2018-07-23 13:42:03,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-07-23 13:42:04,186 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:04,186 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 13:42:04,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:04,187 INFO L185 omatonBuilderFactory]: Interpolants [97085#false, 97084#true, 97087#(<= ULTIMATE.start_main_~x~4 1), 97086#(<= ULTIMATE.start_main_~x~4 0), 97089#(<= ULTIMATE.start_main_~x~4 3), 97088#(<= ULTIMATE.start_main_~x~4 2), 97091#(<= ULTIMATE.start_main_~x~4 5), 97090#(<= ULTIMATE.start_main_~x~4 4), 97093#(<= ULTIMATE.start_main_~x~4 7), 97092#(<= ULTIMATE.start_main_~x~4 6), 97095#(<= ULTIMATE.start_main_~x~4 9), 97094#(<= ULTIMATE.start_main_~x~4 8), 97097#(<= ULTIMATE.start_main_~x~4 11), 97096#(<= ULTIMATE.start_main_~x~4 10), 97099#(<= ULTIMATE.start_main_~x~4 13), 97098#(<= ULTIMATE.start_main_~x~4 12), 97101#(<= ULTIMATE.start_main_~x~4 15), 97100#(<= ULTIMATE.start_main_~x~4 14), 97103#(<= ULTIMATE.start_main_~x~4 17), 97102#(<= ULTIMATE.start_main_~x~4 16), 97105#(<= ULTIMATE.start_main_~x~4 19), 97104#(<= ULTIMATE.start_main_~x~4 18), 97107#(<= ULTIMATE.start_main_~x~4 21), 97106#(<= ULTIMATE.start_main_~x~4 20), 97109#(<= ULTIMATE.start_main_~x~4 23), 97108#(<= ULTIMATE.start_main_~x~4 22), 97111#(<= ULTIMATE.start_main_~x~4 25), 97110#(<= ULTIMATE.start_main_~x~4 24), 97113#(<= ULTIMATE.start_main_~x~4 27), 97112#(<= ULTIMATE.start_main_~x~4 26), 97115#(<= ULTIMATE.start_main_~x~4 29), 97114#(<= ULTIMATE.start_main_~x~4 28), 97117#(<= ULTIMATE.start_main_~x~4 31), 97116#(<= ULTIMATE.start_main_~x~4 30), 97119#(<= ULTIMATE.start_main_~x~4 33), 97118#(<= ULTIMATE.start_main_~x~4 32), 97121#(<= ULTIMATE.start_main_~x~4 35), 97120#(<= ULTIMATE.start_main_~x~4 34), 97123#(<= ULTIMATE.start_main_~x~4 37), 97122#(<= ULTIMATE.start_main_~x~4 36), 97125#(<= ULTIMATE.start_main_~x~4 39), 97124#(<= ULTIMATE.start_main_~x~4 38), 97127#(<= ULTIMATE.start_main_~x~4 41), 97126#(<= ULTIMATE.start_main_~x~4 40), 97129#(<= ULTIMATE.start_main_~x~4 43), 97128#(<= ULTIMATE.start_main_~x~4 42), 97131#(<= ULTIMATE.start_main_~x~4 45), 97130#(<= ULTIMATE.start_main_~x~4 44), 97133#(<= ULTIMATE.start_main_~x~4 47), 97132#(<= ULTIMATE.start_main_~x~4 46), 97135#(<= ULTIMATE.start_main_~x~4 49), 97134#(<= ULTIMATE.start_main_~x~4 48), 97137#(<= ULTIMATE.start_main_~x~4 51), 97136#(<= ULTIMATE.start_main_~x~4 50), 97139#(<= ULTIMATE.start_main_~x~4 53), 97138#(<= ULTIMATE.start_main_~x~4 52), 97141#(<= ULTIMATE.start_main_~x~4 55), 97140#(<= ULTIMATE.start_main_~x~4 54), 97143#(<= ULTIMATE.start_main_~x~4 57), 97142#(<= ULTIMATE.start_main_~x~4 56), 97145#(<= ULTIMATE.start_main_~x~4 59), 97144#(<= ULTIMATE.start_main_~x~4 58), 97147#(<= ULTIMATE.start_main_~x~4 61), 97146#(<= ULTIMATE.start_main_~x~4 60)] [2018-07-23 13:42:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-07-23 13:42:04,194 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 13:42:04,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 13:42:04,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 13:42:04,195 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-07-23 13:42:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:04,715 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-07-23 13:42:04,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 13:42:04,715 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-07-23 13:42:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:04,718 INFO L225 Difference]: With dead ends: 761 [2018-07-23 13:42:04,718 INFO L226 Difference]: Without dead ends: 759 [2018-07-23 13:42:04,718 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 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:42:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-07-23 13:42:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-07-23 13:42:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-07-23 13:42:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-07-23 13:42:05,188 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-07-23 13:42:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:05,188 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-07-23 13:42:05,189 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 13:42:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-07-23 13:42:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-07-23 13:42:05,193 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:05,193 INFO L357 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-07-23 13:42:05,193 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 71 times [2018-07-23 13:42:05,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-07-23 13:42:05,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:05,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 13:42:05,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:05,702 INFO L185 omatonBuilderFactory]: Interpolants [100225#(<= ULTIMATE.start_main_~x~4 57), 100224#(<= ULTIMATE.start_main_~x~4 56), 100227#(<= ULTIMATE.start_main_~x~4 59), 100226#(<= ULTIMATE.start_main_~x~4 58), 100229#(<= ULTIMATE.start_main_~x~4 61), 100228#(<= ULTIMATE.start_main_~x~4 60), 100230#(<= ULTIMATE.start_main_~x~4 62), 100167#false, 100166#true, 100169#(<= ULTIMATE.start_main_~x~4 1), 100168#(<= ULTIMATE.start_main_~x~4 0), 100171#(<= ULTIMATE.start_main_~x~4 3), 100170#(<= ULTIMATE.start_main_~x~4 2), 100173#(<= ULTIMATE.start_main_~x~4 5), 100172#(<= ULTIMATE.start_main_~x~4 4), 100175#(<= ULTIMATE.start_main_~x~4 7), 100174#(<= ULTIMATE.start_main_~x~4 6), 100177#(<= ULTIMATE.start_main_~x~4 9), 100176#(<= ULTIMATE.start_main_~x~4 8), 100179#(<= ULTIMATE.start_main_~x~4 11), 100178#(<= ULTIMATE.start_main_~x~4 10), 100181#(<= ULTIMATE.start_main_~x~4 13), 100180#(<= ULTIMATE.start_main_~x~4 12), 100183#(<= ULTIMATE.start_main_~x~4 15), 100182#(<= ULTIMATE.start_main_~x~4 14), 100185#(<= ULTIMATE.start_main_~x~4 17), 100184#(<= ULTIMATE.start_main_~x~4 16), 100187#(<= ULTIMATE.start_main_~x~4 19), 100186#(<= ULTIMATE.start_main_~x~4 18), 100189#(<= ULTIMATE.start_main_~x~4 21), 100188#(<= ULTIMATE.start_main_~x~4 20), 100191#(<= ULTIMATE.start_main_~x~4 23), 100190#(<= ULTIMATE.start_main_~x~4 22), 100193#(<= ULTIMATE.start_main_~x~4 25), 100192#(<= ULTIMATE.start_main_~x~4 24), 100195#(<= ULTIMATE.start_main_~x~4 27), 100194#(<= ULTIMATE.start_main_~x~4 26), 100197#(<= ULTIMATE.start_main_~x~4 29), 100196#(<= ULTIMATE.start_main_~x~4 28), 100199#(<= ULTIMATE.start_main_~x~4 31), 100198#(<= ULTIMATE.start_main_~x~4 30), 100201#(<= ULTIMATE.start_main_~x~4 33), 100200#(<= ULTIMATE.start_main_~x~4 32), 100203#(<= ULTIMATE.start_main_~x~4 35), 100202#(<= ULTIMATE.start_main_~x~4 34), 100205#(<= ULTIMATE.start_main_~x~4 37), 100204#(<= ULTIMATE.start_main_~x~4 36), 100207#(<= ULTIMATE.start_main_~x~4 39), 100206#(<= ULTIMATE.start_main_~x~4 38), 100209#(<= ULTIMATE.start_main_~x~4 41), 100208#(<= ULTIMATE.start_main_~x~4 40), 100211#(<= ULTIMATE.start_main_~x~4 43), 100210#(<= ULTIMATE.start_main_~x~4 42), 100213#(<= ULTIMATE.start_main_~x~4 45), 100212#(<= ULTIMATE.start_main_~x~4 44), 100215#(<= ULTIMATE.start_main_~x~4 47), 100214#(<= ULTIMATE.start_main_~x~4 46), 100217#(<= ULTIMATE.start_main_~x~4 49), 100216#(<= ULTIMATE.start_main_~x~4 48), 100219#(<= ULTIMATE.start_main_~x~4 51), 100218#(<= ULTIMATE.start_main_~x~4 50), 100221#(<= ULTIMATE.start_main_~x~4 53), 100220#(<= ULTIMATE.start_main_~x~4 52), 100223#(<= ULTIMATE.start_main_~x~4 55), 100222#(<= ULTIMATE.start_main_~x~4 54)] [2018-07-23 13:42:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-07-23 13:42:05,709 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 13:42:05,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 13:42:05,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 13:42:05,710 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-07-23 13:42:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:06,251 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-07-23 13:42:06,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 13:42:06,251 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-07-23 13:42:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:06,254 INFO L225 Difference]: With dead ends: 773 [2018-07-23 13:42:06,254 INFO L226 Difference]: Without dead ends: 771 [2018-07-23 13:42:06,254 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 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:42:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-07-23 13:42:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-07-23 13:42:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-07-23 13:42:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-07-23 13:42:06,745 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-07-23 13:42:06,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:06,745 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-07-23 13:42:06,745 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 13:42:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-07-23 13:42:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-07-23 13:42:06,749 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:06,749 INFO L357 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-07-23 13:42:06,749 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 72 times [2018-07-23 13:42:06,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-07-23 13:42:07,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:07,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 13:42:07,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:07,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:07,314 INFO L185 omatonBuilderFactory]: Interpolants [103297#true, 103299#(<= ULTIMATE.start_main_~x~4 0), 103298#false, 103301#(<= ULTIMATE.start_main_~x~4 2), 103300#(<= ULTIMATE.start_main_~x~4 1), 103303#(<= ULTIMATE.start_main_~x~4 4), 103302#(<= ULTIMATE.start_main_~x~4 3), 103305#(<= ULTIMATE.start_main_~x~4 6), 103304#(<= ULTIMATE.start_main_~x~4 5), 103307#(<= ULTIMATE.start_main_~x~4 8), 103306#(<= ULTIMATE.start_main_~x~4 7), 103309#(<= ULTIMATE.start_main_~x~4 10), 103308#(<= ULTIMATE.start_main_~x~4 9), 103311#(<= ULTIMATE.start_main_~x~4 12), 103310#(<= ULTIMATE.start_main_~x~4 11), 103313#(<= ULTIMATE.start_main_~x~4 14), 103312#(<= ULTIMATE.start_main_~x~4 13), 103315#(<= ULTIMATE.start_main_~x~4 16), 103314#(<= ULTIMATE.start_main_~x~4 15), 103317#(<= ULTIMATE.start_main_~x~4 18), 103316#(<= ULTIMATE.start_main_~x~4 17), 103319#(<= ULTIMATE.start_main_~x~4 20), 103318#(<= ULTIMATE.start_main_~x~4 19), 103321#(<= ULTIMATE.start_main_~x~4 22), 103320#(<= ULTIMATE.start_main_~x~4 21), 103323#(<= ULTIMATE.start_main_~x~4 24), 103322#(<= ULTIMATE.start_main_~x~4 23), 103325#(<= ULTIMATE.start_main_~x~4 26), 103324#(<= ULTIMATE.start_main_~x~4 25), 103327#(<= ULTIMATE.start_main_~x~4 28), 103326#(<= ULTIMATE.start_main_~x~4 27), 103329#(<= ULTIMATE.start_main_~x~4 30), 103328#(<= ULTIMATE.start_main_~x~4 29), 103331#(<= ULTIMATE.start_main_~x~4 32), 103330#(<= ULTIMATE.start_main_~x~4 31), 103333#(<= ULTIMATE.start_main_~x~4 34), 103332#(<= ULTIMATE.start_main_~x~4 33), 103335#(<= ULTIMATE.start_main_~x~4 36), 103334#(<= ULTIMATE.start_main_~x~4 35), 103337#(<= ULTIMATE.start_main_~x~4 38), 103336#(<= ULTIMATE.start_main_~x~4 37), 103339#(<= ULTIMATE.start_main_~x~4 40), 103338#(<= ULTIMATE.start_main_~x~4 39), 103341#(<= ULTIMATE.start_main_~x~4 42), 103340#(<= ULTIMATE.start_main_~x~4 41), 103343#(<= ULTIMATE.start_main_~x~4 44), 103342#(<= ULTIMATE.start_main_~x~4 43), 103345#(<= ULTIMATE.start_main_~x~4 46), 103344#(<= ULTIMATE.start_main_~x~4 45), 103347#(<= ULTIMATE.start_main_~x~4 48), 103346#(<= ULTIMATE.start_main_~x~4 47), 103349#(<= ULTIMATE.start_main_~x~4 50), 103348#(<= ULTIMATE.start_main_~x~4 49), 103351#(<= ULTIMATE.start_main_~x~4 52), 103350#(<= ULTIMATE.start_main_~x~4 51), 103353#(<= ULTIMATE.start_main_~x~4 54), 103352#(<= ULTIMATE.start_main_~x~4 53), 103355#(<= ULTIMATE.start_main_~x~4 56), 103354#(<= ULTIMATE.start_main_~x~4 55), 103357#(<= ULTIMATE.start_main_~x~4 58), 103356#(<= ULTIMATE.start_main_~x~4 57), 103359#(<= ULTIMATE.start_main_~x~4 60), 103358#(<= ULTIMATE.start_main_~x~4 59), 103361#(<= ULTIMATE.start_main_~x~4 62), 103360#(<= ULTIMATE.start_main_~x~4 61), 103362#(<= ULTIMATE.start_main_~x~4 63)] [2018-07-23 13:42:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-07-23 13:42:07,324 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 13:42:07,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 13:42:07,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:42:07,325 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-07-23 13:42:07,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:07,921 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-07-23 13:42:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 13:42:07,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-07-23 13:42:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:07,924 INFO L225 Difference]: With dead ends: 785 [2018-07-23 13:42:07,924 INFO L226 Difference]: Without dead ends: 783 [2018-07-23 13:42:07,925 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 13:42:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-07-23 13:42:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-07-23 13:42:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-07-23 13:42:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-07-23 13:42:08,437 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-07-23 13:42:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:08,438 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-07-23 13:42:08,438 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 13:42:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-07-23 13:42:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-07-23 13:42:08,441 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:08,442 INFO L357 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-07-23 13:42:08,442 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:08,442 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 73 times [2018-07-23 13:42:08,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-07-23 13:42:08,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:08,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 13:42:08,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:08,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:42:08,981 INFO L185 omatonBuilderFactory]: Interpolants [106497#(<= ULTIMATE.start_main_~x~4 18), 106496#(<= ULTIMATE.start_main_~x~4 17), 106499#(<= ULTIMATE.start_main_~x~4 20), 106498#(<= ULTIMATE.start_main_~x~4 19), 106501#(<= ULTIMATE.start_main_~x~4 22), 106500#(<= ULTIMATE.start_main_~x~4 21), 106503#(<= ULTIMATE.start_main_~x~4 24), 106502#(<= ULTIMATE.start_main_~x~4 23), 106505#(<= ULTIMATE.start_main_~x~4 26), 106504#(<= ULTIMATE.start_main_~x~4 25), 106507#(<= ULTIMATE.start_main_~x~4 28), 106506#(<= ULTIMATE.start_main_~x~4 27), 106509#(<= ULTIMATE.start_main_~x~4 30), 106508#(<= ULTIMATE.start_main_~x~4 29), 106511#(<= ULTIMATE.start_main_~x~4 32), 106510#(<= ULTIMATE.start_main_~x~4 31), 106513#(<= ULTIMATE.start_main_~x~4 34), 106512#(<= ULTIMATE.start_main_~x~4 33), 106515#(<= ULTIMATE.start_main_~x~4 36), 106514#(<= ULTIMATE.start_main_~x~4 35), 106517#(<= ULTIMATE.start_main_~x~4 38), 106516#(<= ULTIMATE.start_main_~x~4 37), 106519#(<= ULTIMATE.start_main_~x~4 40), 106518#(<= ULTIMATE.start_main_~x~4 39), 106521#(<= ULTIMATE.start_main_~x~4 42), 106520#(<= ULTIMATE.start_main_~x~4 41), 106523#(<= ULTIMATE.start_main_~x~4 44), 106522#(<= ULTIMATE.start_main_~x~4 43), 106525#(<= ULTIMATE.start_main_~x~4 46), 106524#(<= ULTIMATE.start_main_~x~4 45), 106527#(<= ULTIMATE.start_main_~x~4 48), 106526#(<= ULTIMATE.start_main_~x~4 47), 106529#(<= ULTIMATE.start_main_~x~4 50), 106528#(<= ULTIMATE.start_main_~x~4 49), 106531#(<= ULTIMATE.start_main_~x~4 52), 106530#(<= ULTIMATE.start_main_~x~4 51), 106533#(<= ULTIMATE.start_main_~x~4 54), 106532#(<= ULTIMATE.start_main_~x~4 53), 106535#(<= ULTIMATE.start_main_~x~4 56), 106534#(<= ULTIMATE.start_main_~x~4 55), 106537#(<= ULTIMATE.start_main_~x~4 58), 106536#(<= ULTIMATE.start_main_~x~4 57), 106539#(<= ULTIMATE.start_main_~x~4 60), 106538#(<= ULTIMATE.start_main_~x~4 59), 106541#(<= ULTIMATE.start_main_~x~4 62), 106540#(<= ULTIMATE.start_main_~x~4 61), 106543#(<= ULTIMATE.start_main_~x~4 64), 106542#(<= ULTIMATE.start_main_~x~4 63), 106477#true, 106479#(<= ULTIMATE.start_main_~x~4 0), 106478#false, 106481#(<= ULTIMATE.start_main_~x~4 2), 106480#(<= ULTIMATE.start_main_~x~4 1), 106483#(<= ULTIMATE.start_main_~x~4 4), 106482#(<= ULTIMATE.start_main_~x~4 3), 106485#(<= ULTIMATE.start_main_~x~4 6), 106484#(<= ULTIMATE.start_main_~x~4 5), 106487#(<= ULTIMATE.start_main_~x~4 8), 106486#(<= ULTIMATE.start_main_~x~4 7), 106489#(<= ULTIMATE.start_main_~x~4 10), 106488#(<= ULTIMATE.start_main_~x~4 9), 106491#(<= ULTIMATE.start_main_~x~4 12), 106490#(<= ULTIMATE.start_main_~x~4 11), 106493#(<= ULTIMATE.start_main_~x~4 14), 106492#(<= ULTIMATE.start_main_~x~4 13), 106495#(<= ULTIMATE.start_main_~x~4 16), 106494#(<= ULTIMATE.start_main_~x~4 15)] [2018-07-23 13:42:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-07-23 13:42:08,991 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 13:42:08,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 13:42:08,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 13:42:08,991 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-07-23 13:42:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:09,563 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-07-23 13:42:09,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 13:42:09,564 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-07-23 13:42:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:09,567 INFO L225 Difference]: With dead ends: 797 [2018-07-23 13:42:09,568 INFO L226 Difference]: Without dead ends: 795 [2018-07-23 13:42:09,569 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 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:42:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-07-23 13:42:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-07-23 13:42:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-07-23 13:42:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-07-23 13:42:10,244 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-07-23 13:42:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:10,244 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-07-23 13:42:10,244 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 13:42:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-07-23 13:42:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-07-23 13:42:10,248 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:10,248 INFO L357 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-07-23 13:42:10,249 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 74 times [2018-07-23 13:42:10,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-07-23 13:42:10,796 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:10,796 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 13:42:10,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:10,797 INFO L185 omatonBuilderFactory]: Interpolants [109707#false, 109706#true, 109709#(<= ULTIMATE.start_main_~x~4 1), 109708#(<= ULTIMATE.start_main_~x~4 0), 109711#(<= ULTIMATE.start_main_~x~4 3), 109710#(<= ULTIMATE.start_main_~x~4 2), 109713#(<= ULTIMATE.start_main_~x~4 5), 109712#(<= ULTIMATE.start_main_~x~4 4), 109715#(<= ULTIMATE.start_main_~x~4 7), 109714#(<= ULTIMATE.start_main_~x~4 6), 109717#(<= ULTIMATE.start_main_~x~4 9), 109716#(<= ULTIMATE.start_main_~x~4 8), 109719#(<= ULTIMATE.start_main_~x~4 11), 109718#(<= ULTIMATE.start_main_~x~4 10), 109721#(<= ULTIMATE.start_main_~x~4 13), 109720#(<= ULTIMATE.start_main_~x~4 12), 109723#(<= ULTIMATE.start_main_~x~4 15), 109722#(<= ULTIMATE.start_main_~x~4 14), 109725#(<= ULTIMATE.start_main_~x~4 17), 109724#(<= ULTIMATE.start_main_~x~4 16), 109727#(<= ULTIMATE.start_main_~x~4 19), 109726#(<= ULTIMATE.start_main_~x~4 18), 109729#(<= ULTIMATE.start_main_~x~4 21), 109728#(<= ULTIMATE.start_main_~x~4 20), 109731#(<= ULTIMATE.start_main_~x~4 23), 109730#(<= ULTIMATE.start_main_~x~4 22), 109733#(<= ULTIMATE.start_main_~x~4 25), 109732#(<= ULTIMATE.start_main_~x~4 24), 109735#(<= ULTIMATE.start_main_~x~4 27), 109734#(<= ULTIMATE.start_main_~x~4 26), 109737#(<= ULTIMATE.start_main_~x~4 29), 109736#(<= ULTIMATE.start_main_~x~4 28), 109739#(<= ULTIMATE.start_main_~x~4 31), 109738#(<= ULTIMATE.start_main_~x~4 30), 109741#(<= ULTIMATE.start_main_~x~4 33), 109740#(<= ULTIMATE.start_main_~x~4 32), 109743#(<= ULTIMATE.start_main_~x~4 35), 109742#(<= ULTIMATE.start_main_~x~4 34), 109745#(<= ULTIMATE.start_main_~x~4 37), 109744#(<= ULTIMATE.start_main_~x~4 36), 109747#(<= ULTIMATE.start_main_~x~4 39), 109746#(<= ULTIMATE.start_main_~x~4 38), 109749#(<= ULTIMATE.start_main_~x~4 41), 109748#(<= ULTIMATE.start_main_~x~4 40), 109751#(<= ULTIMATE.start_main_~x~4 43), 109750#(<= ULTIMATE.start_main_~x~4 42), 109753#(<= ULTIMATE.start_main_~x~4 45), 109752#(<= ULTIMATE.start_main_~x~4 44), 109755#(<= ULTIMATE.start_main_~x~4 47), 109754#(<= ULTIMATE.start_main_~x~4 46), 109757#(<= ULTIMATE.start_main_~x~4 49), 109756#(<= ULTIMATE.start_main_~x~4 48), 109759#(<= ULTIMATE.start_main_~x~4 51), 109758#(<= ULTIMATE.start_main_~x~4 50), 109761#(<= ULTIMATE.start_main_~x~4 53), 109760#(<= ULTIMATE.start_main_~x~4 52), 109763#(<= ULTIMATE.start_main_~x~4 55), 109762#(<= ULTIMATE.start_main_~x~4 54), 109765#(<= ULTIMATE.start_main_~x~4 57), 109764#(<= ULTIMATE.start_main_~x~4 56), 109767#(<= ULTIMATE.start_main_~x~4 59), 109766#(<= ULTIMATE.start_main_~x~4 58), 109769#(<= ULTIMATE.start_main_~x~4 61), 109768#(<= ULTIMATE.start_main_~x~4 60), 109771#(<= ULTIMATE.start_main_~x~4 63), 109770#(<= ULTIMATE.start_main_~x~4 62), 109773#(<= ULTIMATE.start_main_~x~4 65), 109772#(<= ULTIMATE.start_main_~x~4 64)] [2018-07-23 13:42:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-07-23 13:42:10,805 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 13:42:10,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 13:42:10,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 13:42:10,806 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-07-23 13:42:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:11,419 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-07-23 13:42:11,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 13:42:11,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-07-23 13:42:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:11,422 INFO L225 Difference]: With dead ends: 809 [2018-07-23 13:42:11,422 INFO L226 Difference]: Without dead ends: 807 [2018-07-23 13:42:11,423 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 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:42:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-07-23 13:42:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-07-23 13:42:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-07-23 13:42:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-07-23 13:42:11,959 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-07-23 13:42:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:11,959 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-07-23 13:42:11,959 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 13:42:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-07-23 13:42:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-07-23 13:42:11,963 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:11,964 INFO L357 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-07-23 13:42:11,964 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 75 times [2018-07-23 13:42:11,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-07-23 13:42:12,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:12,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 13:42:12,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:12,576 INFO L185 omatonBuilderFactory]: Interpolants [113025#(<= ULTIMATE.start_main_~x~4 39), 113024#(<= ULTIMATE.start_main_~x~4 38), 113027#(<= ULTIMATE.start_main_~x~4 41), 113026#(<= ULTIMATE.start_main_~x~4 40), 113029#(<= ULTIMATE.start_main_~x~4 43), 113028#(<= ULTIMATE.start_main_~x~4 42), 113031#(<= ULTIMATE.start_main_~x~4 45), 113030#(<= ULTIMATE.start_main_~x~4 44), 113033#(<= ULTIMATE.start_main_~x~4 47), 113032#(<= ULTIMATE.start_main_~x~4 46), 113035#(<= ULTIMATE.start_main_~x~4 49), 113034#(<= ULTIMATE.start_main_~x~4 48), 113037#(<= ULTIMATE.start_main_~x~4 51), 113036#(<= ULTIMATE.start_main_~x~4 50), 113039#(<= ULTIMATE.start_main_~x~4 53), 113038#(<= ULTIMATE.start_main_~x~4 52), 113041#(<= ULTIMATE.start_main_~x~4 55), 113040#(<= ULTIMATE.start_main_~x~4 54), 113043#(<= ULTIMATE.start_main_~x~4 57), 113042#(<= ULTIMATE.start_main_~x~4 56), 113045#(<= ULTIMATE.start_main_~x~4 59), 113044#(<= ULTIMATE.start_main_~x~4 58), 113047#(<= ULTIMATE.start_main_~x~4 61), 113046#(<= ULTIMATE.start_main_~x~4 60), 113049#(<= ULTIMATE.start_main_~x~4 63), 113048#(<= ULTIMATE.start_main_~x~4 62), 113051#(<= ULTIMATE.start_main_~x~4 65), 113050#(<= ULTIMATE.start_main_~x~4 64), 113052#(<= ULTIMATE.start_main_~x~4 66), 112985#false, 112984#true, 112987#(<= ULTIMATE.start_main_~x~4 1), 112986#(<= ULTIMATE.start_main_~x~4 0), 112989#(<= ULTIMATE.start_main_~x~4 3), 112988#(<= ULTIMATE.start_main_~x~4 2), 112991#(<= ULTIMATE.start_main_~x~4 5), 112990#(<= ULTIMATE.start_main_~x~4 4), 112993#(<= ULTIMATE.start_main_~x~4 7), 112992#(<= ULTIMATE.start_main_~x~4 6), 112995#(<= ULTIMATE.start_main_~x~4 9), 112994#(<= ULTIMATE.start_main_~x~4 8), 112997#(<= ULTIMATE.start_main_~x~4 11), 112996#(<= ULTIMATE.start_main_~x~4 10), 112999#(<= ULTIMATE.start_main_~x~4 13), 112998#(<= ULTIMATE.start_main_~x~4 12), 113001#(<= ULTIMATE.start_main_~x~4 15), 113000#(<= ULTIMATE.start_main_~x~4 14), 113003#(<= ULTIMATE.start_main_~x~4 17), 113002#(<= ULTIMATE.start_main_~x~4 16), 113005#(<= ULTIMATE.start_main_~x~4 19), 113004#(<= ULTIMATE.start_main_~x~4 18), 113007#(<= ULTIMATE.start_main_~x~4 21), 113006#(<= ULTIMATE.start_main_~x~4 20), 113009#(<= ULTIMATE.start_main_~x~4 23), 113008#(<= ULTIMATE.start_main_~x~4 22), 113011#(<= ULTIMATE.start_main_~x~4 25), 113010#(<= ULTIMATE.start_main_~x~4 24), 113013#(<= ULTIMATE.start_main_~x~4 27), 113012#(<= ULTIMATE.start_main_~x~4 26), 113015#(<= ULTIMATE.start_main_~x~4 29), 113014#(<= ULTIMATE.start_main_~x~4 28), 113017#(<= ULTIMATE.start_main_~x~4 31), 113016#(<= ULTIMATE.start_main_~x~4 30), 113019#(<= ULTIMATE.start_main_~x~4 33), 113018#(<= ULTIMATE.start_main_~x~4 32), 113021#(<= ULTIMATE.start_main_~x~4 35), 113020#(<= ULTIMATE.start_main_~x~4 34), 113023#(<= ULTIMATE.start_main_~x~4 37), 113022#(<= ULTIMATE.start_main_~x~4 36)] [2018-07-23 13:42:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-07-23 13:42:12,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 13:42:12,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 13:42:12,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 13:42:12,585 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-07-23 13:42:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:13,183 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-07-23 13:42:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 13:42:13,183 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-07-23 13:42:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:13,186 INFO L225 Difference]: With dead ends: 821 [2018-07-23 13:42:13,186 INFO L226 Difference]: Without dead ends: 819 [2018-07-23 13:42:13,186 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 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:42:13,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-07-23 13:42:13,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-07-23 13:42:13,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-07-23 13:42:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-07-23 13:42:13,748 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-07-23 13:42:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:13,748 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-07-23 13:42:13,749 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 13:42:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-07-23 13:42:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-07-23 13:42:13,753 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:13,753 INFO L357 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-07-23 13:42:13,753 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 76 times [2018-07-23 13:42:13,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-07-23 13:42:14,356 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:14,356 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 13:42:14,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:14,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:42:14,357 INFO L185 omatonBuilderFactory]: Interpolants [116353#(<= ULTIMATE.start_main_~x~4 40), 116352#(<= ULTIMATE.start_main_~x~4 39), 116355#(<= ULTIMATE.start_main_~x~4 42), 116354#(<= ULTIMATE.start_main_~x~4 41), 116357#(<= ULTIMATE.start_main_~x~4 44), 116356#(<= ULTIMATE.start_main_~x~4 43), 116359#(<= ULTIMATE.start_main_~x~4 46), 116358#(<= ULTIMATE.start_main_~x~4 45), 116361#(<= ULTIMATE.start_main_~x~4 48), 116360#(<= ULTIMATE.start_main_~x~4 47), 116363#(<= ULTIMATE.start_main_~x~4 50), 116362#(<= ULTIMATE.start_main_~x~4 49), 116365#(<= ULTIMATE.start_main_~x~4 52), 116364#(<= ULTIMATE.start_main_~x~4 51), 116367#(<= ULTIMATE.start_main_~x~4 54), 116366#(<= ULTIMATE.start_main_~x~4 53), 116369#(<= ULTIMATE.start_main_~x~4 56), 116368#(<= ULTIMATE.start_main_~x~4 55), 116371#(<= ULTIMATE.start_main_~x~4 58), 116370#(<= ULTIMATE.start_main_~x~4 57), 116373#(<= ULTIMATE.start_main_~x~4 60), 116372#(<= ULTIMATE.start_main_~x~4 59), 116375#(<= ULTIMATE.start_main_~x~4 62), 116374#(<= ULTIMATE.start_main_~x~4 61), 116377#(<= ULTIMATE.start_main_~x~4 64), 116376#(<= ULTIMATE.start_main_~x~4 63), 116379#(<= ULTIMATE.start_main_~x~4 66), 116378#(<= ULTIMATE.start_main_~x~4 65), 116380#(<= ULTIMATE.start_main_~x~4 67), 116311#true, 116313#(<= ULTIMATE.start_main_~x~4 0), 116312#false, 116315#(<= ULTIMATE.start_main_~x~4 2), 116314#(<= ULTIMATE.start_main_~x~4 1), 116317#(<= ULTIMATE.start_main_~x~4 4), 116316#(<= ULTIMATE.start_main_~x~4 3), 116319#(<= ULTIMATE.start_main_~x~4 6), 116318#(<= ULTIMATE.start_main_~x~4 5), 116321#(<= ULTIMATE.start_main_~x~4 8), 116320#(<= ULTIMATE.start_main_~x~4 7), 116323#(<= ULTIMATE.start_main_~x~4 10), 116322#(<= ULTIMATE.start_main_~x~4 9), 116325#(<= ULTIMATE.start_main_~x~4 12), 116324#(<= ULTIMATE.start_main_~x~4 11), 116327#(<= ULTIMATE.start_main_~x~4 14), 116326#(<= ULTIMATE.start_main_~x~4 13), 116329#(<= ULTIMATE.start_main_~x~4 16), 116328#(<= ULTIMATE.start_main_~x~4 15), 116331#(<= ULTIMATE.start_main_~x~4 18), 116330#(<= ULTIMATE.start_main_~x~4 17), 116333#(<= ULTIMATE.start_main_~x~4 20), 116332#(<= ULTIMATE.start_main_~x~4 19), 116335#(<= ULTIMATE.start_main_~x~4 22), 116334#(<= ULTIMATE.start_main_~x~4 21), 116337#(<= ULTIMATE.start_main_~x~4 24), 116336#(<= ULTIMATE.start_main_~x~4 23), 116339#(<= ULTIMATE.start_main_~x~4 26), 116338#(<= ULTIMATE.start_main_~x~4 25), 116341#(<= ULTIMATE.start_main_~x~4 28), 116340#(<= ULTIMATE.start_main_~x~4 27), 116343#(<= ULTIMATE.start_main_~x~4 30), 116342#(<= ULTIMATE.start_main_~x~4 29), 116345#(<= ULTIMATE.start_main_~x~4 32), 116344#(<= ULTIMATE.start_main_~x~4 31), 116347#(<= ULTIMATE.start_main_~x~4 34), 116346#(<= ULTIMATE.start_main_~x~4 33), 116349#(<= ULTIMATE.start_main_~x~4 36), 116348#(<= ULTIMATE.start_main_~x~4 35), 116351#(<= ULTIMATE.start_main_~x~4 38), 116350#(<= ULTIMATE.start_main_~x~4 37)] [2018-07-23 13:42:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-07-23 13:42:14,366 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 13:42:14,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 13:42:14,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 13:42:14,366 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-07-23 13:42:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:14,988 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-07-23 13:42:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 13:42:14,988 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-07-23 13:42:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:14,991 INFO L225 Difference]: With dead ends: 833 [2018-07-23 13:42:14,992 INFO L226 Difference]: Without dead ends: 831 [2018-07-23 13:42:14,993 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 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:42:14,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-07-23 13:42:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-07-23 13:42:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-07-23 13:42:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-07-23 13:42:15,575 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-07-23 13:42:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:15,575 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-07-23 13:42:15,576 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 13:42:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-07-23 13:42:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-07-23 13:42:15,580 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:15,581 INFO L357 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-07-23 13:42:15,581 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 77 times [2018-07-23 13:42:15,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-07-23 13:42:16,221 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:16,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 13:42:16,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:16,222 INFO L185 omatonBuilderFactory]: Interpolants [119687#true, 119689#(<= ULTIMATE.start_main_~x~4 0), 119688#false, 119691#(<= ULTIMATE.start_main_~x~4 2), 119690#(<= ULTIMATE.start_main_~x~4 1), 119693#(<= ULTIMATE.start_main_~x~4 4), 119692#(<= ULTIMATE.start_main_~x~4 3), 119695#(<= ULTIMATE.start_main_~x~4 6), 119694#(<= ULTIMATE.start_main_~x~4 5), 119697#(<= ULTIMATE.start_main_~x~4 8), 119696#(<= ULTIMATE.start_main_~x~4 7), 119699#(<= ULTIMATE.start_main_~x~4 10), 119698#(<= ULTIMATE.start_main_~x~4 9), 119701#(<= ULTIMATE.start_main_~x~4 12), 119700#(<= ULTIMATE.start_main_~x~4 11), 119703#(<= ULTIMATE.start_main_~x~4 14), 119702#(<= ULTIMATE.start_main_~x~4 13), 119705#(<= ULTIMATE.start_main_~x~4 16), 119704#(<= ULTIMATE.start_main_~x~4 15), 119707#(<= ULTIMATE.start_main_~x~4 18), 119706#(<= ULTIMATE.start_main_~x~4 17), 119709#(<= ULTIMATE.start_main_~x~4 20), 119708#(<= ULTIMATE.start_main_~x~4 19), 119711#(<= ULTIMATE.start_main_~x~4 22), 119710#(<= ULTIMATE.start_main_~x~4 21), 119713#(<= ULTIMATE.start_main_~x~4 24), 119712#(<= ULTIMATE.start_main_~x~4 23), 119715#(<= ULTIMATE.start_main_~x~4 26), 119714#(<= ULTIMATE.start_main_~x~4 25), 119717#(<= ULTIMATE.start_main_~x~4 28), 119716#(<= ULTIMATE.start_main_~x~4 27), 119719#(<= ULTIMATE.start_main_~x~4 30), 119718#(<= ULTIMATE.start_main_~x~4 29), 119721#(<= ULTIMATE.start_main_~x~4 32), 119720#(<= ULTIMATE.start_main_~x~4 31), 119723#(<= ULTIMATE.start_main_~x~4 34), 119722#(<= ULTIMATE.start_main_~x~4 33), 119725#(<= ULTIMATE.start_main_~x~4 36), 119724#(<= ULTIMATE.start_main_~x~4 35), 119727#(<= ULTIMATE.start_main_~x~4 38), 119726#(<= ULTIMATE.start_main_~x~4 37), 119729#(<= ULTIMATE.start_main_~x~4 40), 119728#(<= ULTIMATE.start_main_~x~4 39), 119731#(<= ULTIMATE.start_main_~x~4 42), 119730#(<= ULTIMATE.start_main_~x~4 41), 119733#(<= ULTIMATE.start_main_~x~4 44), 119732#(<= ULTIMATE.start_main_~x~4 43), 119735#(<= ULTIMATE.start_main_~x~4 46), 119734#(<= ULTIMATE.start_main_~x~4 45), 119737#(<= ULTIMATE.start_main_~x~4 48), 119736#(<= ULTIMATE.start_main_~x~4 47), 119739#(<= ULTIMATE.start_main_~x~4 50), 119738#(<= ULTIMATE.start_main_~x~4 49), 119741#(<= ULTIMATE.start_main_~x~4 52), 119740#(<= ULTIMATE.start_main_~x~4 51), 119743#(<= ULTIMATE.start_main_~x~4 54), 119742#(<= ULTIMATE.start_main_~x~4 53), 119745#(<= ULTIMATE.start_main_~x~4 56), 119744#(<= ULTIMATE.start_main_~x~4 55), 119747#(<= ULTIMATE.start_main_~x~4 58), 119746#(<= ULTIMATE.start_main_~x~4 57), 119749#(<= ULTIMATE.start_main_~x~4 60), 119748#(<= ULTIMATE.start_main_~x~4 59), 119751#(<= ULTIMATE.start_main_~x~4 62), 119750#(<= ULTIMATE.start_main_~x~4 61), 119753#(<= ULTIMATE.start_main_~x~4 64), 119752#(<= ULTIMATE.start_main_~x~4 63), 119755#(<= ULTIMATE.start_main_~x~4 66), 119754#(<= ULTIMATE.start_main_~x~4 65), 119757#(<= ULTIMATE.start_main_~x~4 68), 119756#(<= ULTIMATE.start_main_~x~4 67)] [2018-07-23 13:42:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-07-23 13:42:16,231 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 13:42:16,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 13:42:16,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 13:42:16,231 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-07-23 13:42:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:16,900 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-07-23 13:42:16,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 13:42:16,900 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-07-23 13:42:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:16,903 INFO L225 Difference]: With dead ends: 845 [2018-07-23 13:42:16,903 INFO L226 Difference]: Without dead ends: 843 [2018-07-23 13:42:16,904 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 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:42:16,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-07-23 13:42:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-07-23 13:42:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-07-23 13:42:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-07-23 13:42:17,500 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-07-23 13:42:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:17,500 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-07-23 13:42:17,500 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 13:42:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-07-23 13:42:17,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-07-23 13:42:17,505 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:17,505 INFO L357 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-07-23 13:42:17,505 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 78 times [2018-07-23 13:42:17,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-07-23 13:42:18,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:18,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 13:42:18,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:18,118 INFO L185 omatonBuilderFactory]: Interpolants [123137#(<= ULTIMATE.start_main_~x~4 23), 123136#(<= ULTIMATE.start_main_~x~4 22), 123139#(<= ULTIMATE.start_main_~x~4 25), 123138#(<= ULTIMATE.start_main_~x~4 24), 123141#(<= ULTIMATE.start_main_~x~4 27), 123140#(<= ULTIMATE.start_main_~x~4 26), 123143#(<= ULTIMATE.start_main_~x~4 29), 123142#(<= ULTIMATE.start_main_~x~4 28), 123145#(<= ULTIMATE.start_main_~x~4 31), 123144#(<= ULTIMATE.start_main_~x~4 30), 123147#(<= ULTIMATE.start_main_~x~4 33), 123146#(<= ULTIMATE.start_main_~x~4 32), 123149#(<= ULTIMATE.start_main_~x~4 35), 123148#(<= ULTIMATE.start_main_~x~4 34), 123151#(<= ULTIMATE.start_main_~x~4 37), 123150#(<= ULTIMATE.start_main_~x~4 36), 123153#(<= ULTIMATE.start_main_~x~4 39), 123152#(<= ULTIMATE.start_main_~x~4 38), 123155#(<= ULTIMATE.start_main_~x~4 41), 123154#(<= ULTIMATE.start_main_~x~4 40), 123157#(<= ULTIMATE.start_main_~x~4 43), 123156#(<= ULTIMATE.start_main_~x~4 42), 123159#(<= ULTIMATE.start_main_~x~4 45), 123158#(<= ULTIMATE.start_main_~x~4 44), 123161#(<= ULTIMATE.start_main_~x~4 47), 123160#(<= ULTIMATE.start_main_~x~4 46), 123163#(<= ULTIMATE.start_main_~x~4 49), 123162#(<= ULTIMATE.start_main_~x~4 48), 123165#(<= ULTIMATE.start_main_~x~4 51), 123164#(<= ULTIMATE.start_main_~x~4 50), 123167#(<= ULTIMATE.start_main_~x~4 53), 123166#(<= ULTIMATE.start_main_~x~4 52), 123169#(<= ULTIMATE.start_main_~x~4 55), 123168#(<= ULTIMATE.start_main_~x~4 54), 123171#(<= ULTIMATE.start_main_~x~4 57), 123170#(<= ULTIMATE.start_main_~x~4 56), 123173#(<= ULTIMATE.start_main_~x~4 59), 123172#(<= ULTIMATE.start_main_~x~4 58), 123175#(<= ULTIMATE.start_main_~x~4 61), 123174#(<= ULTIMATE.start_main_~x~4 60), 123177#(<= ULTIMATE.start_main_~x~4 63), 123176#(<= ULTIMATE.start_main_~x~4 62), 123179#(<= ULTIMATE.start_main_~x~4 65), 123178#(<= ULTIMATE.start_main_~x~4 64), 123181#(<= ULTIMATE.start_main_~x~4 67), 123180#(<= ULTIMATE.start_main_~x~4 66), 123183#(<= ULTIMATE.start_main_~x~4 69), 123182#(<= ULTIMATE.start_main_~x~4 68), 123113#false, 123112#true, 123115#(<= ULTIMATE.start_main_~x~4 1), 123114#(<= ULTIMATE.start_main_~x~4 0), 123117#(<= ULTIMATE.start_main_~x~4 3), 123116#(<= ULTIMATE.start_main_~x~4 2), 123119#(<= ULTIMATE.start_main_~x~4 5), 123118#(<= ULTIMATE.start_main_~x~4 4), 123121#(<= ULTIMATE.start_main_~x~4 7), 123120#(<= ULTIMATE.start_main_~x~4 6), 123123#(<= ULTIMATE.start_main_~x~4 9), 123122#(<= ULTIMATE.start_main_~x~4 8), 123125#(<= ULTIMATE.start_main_~x~4 11), 123124#(<= ULTIMATE.start_main_~x~4 10), 123127#(<= ULTIMATE.start_main_~x~4 13), 123126#(<= ULTIMATE.start_main_~x~4 12), 123129#(<= ULTIMATE.start_main_~x~4 15), 123128#(<= ULTIMATE.start_main_~x~4 14), 123131#(<= ULTIMATE.start_main_~x~4 17), 123130#(<= ULTIMATE.start_main_~x~4 16), 123133#(<= ULTIMATE.start_main_~x~4 19), 123132#(<= ULTIMATE.start_main_~x~4 18), 123135#(<= ULTIMATE.start_main_~x~4 21), 123134#(<= ULTIMATE.start_main_~x~4 20)] [2018-07-23 13:42:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-07-23 13:42:18,127 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 13:42:18,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 13:42:18,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 13:42:18,128 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-07-23 13:42:18,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:18,827 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-07-23 13:42:18,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 13:42:18,827 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-07-23 13:42:18,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:18,830 INFO L225 Difference]: With dead ends: 857 [2018-07-23 13:42:18,830 INFO L226 Difference]: Without dead ends: 855 [2018-07-23 13:42:18,830 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 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:42:18,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-07-23 13:42:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-07-23 13:42:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-07-23 13:42:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-07-23 13:42:19,449 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-07-23 13:42:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:19,449 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-07-23 13:42:19,449 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 13:42:19,449 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-07-23 13:42:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-07-23 13:42:19,453 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:19,454 INFO L357 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-07-23 13:42:19,454 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:19,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 79 times [2018-07-23 13:42:19,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-07-23 13:42:20,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:20,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 13:42:20,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:20,078 INFO L185 omatonBuilderFactory]: Interpolants [126593#(<= ULTIMATE.start_main_~x~4 5), 126592#(<= ULTIMATE.start_main_~x~4 4), 126595#(<= ULTIMATE.start_main_~x~4 7), 126594#(<= ULTIMATE.start_main_~x~4 6), 126597#(<= ULTIMATE.start_main_~x~4 9), 126596#(<= ULTIMATE.start_main_~x~4 8), 126599#(<= ULTIMATE.start_main_~x~4 11), 126598#(<= ULTIMATE.start_main_~x~4 10), 126601#(<= ULTIMATE.start_main_~x~4 13), 126600#(<= ULTIMATE.start_main_~x~4 12), 126603#(<= ULTIMATE.start_main_~x~4 15), 126602#(<= ULTIMATE.start_main_~x~4 14), 126605#(<= ULTIMATE.start_main_~x~4 17), 126604#(<= ULTIMATE.start_main_~x~4 16), 126607#(<= ULTIMATE.start_main_~x~4 19), 126606#(<= ULTIMATE.start_main_~x~4 18), 126609#(<= ULTIMATE.start_main_~x~4 21), 126608#(<= ULTIMATE.start_main_~x~4 20), 126611#(<= ULTIMATE.start_main_~x~4 23), 126610#(<= ULTIMATE.start_main_~x~4 22), 126613#(<= ULTIMATE.start_main_~x~4 25), 126612#(<= ULTIMATE.start_main_~x~4 24), 126615#(<= ULTIMATE.start_main_~x~4 27), 126614#(<= ULTIMATE.start_main_~x~4 26), 126617#(<= ULTIMATE.start_main_~x~4 29), 126616#(<= ULTIMATE.start_main_~x~4 28), 126619#(<= ULTIMATE.start_main_~x~4 31), 126618#(<= ULTIMATE.start_main_~x~4 30), 126621#(<= ULTIMATE.start_main_~x~4 33), 126620#(<= ULTIMATE.start_main_~x~4 32), 126623#(<= ULTIMATE.start_main_~x~4 35), 126622#(<= ULTIMATE.start_main_~x~4 34), 126625#(<= ULTIMATE.start_main_~x~4 37), 126624#(<= ULTIMATE.start_main_~x~4 36), 126627#(<= ULTIMATE.start_main_~x~4 39), 126626#(<= ULTIMATE.start_main_~x~4 38), 126629#(<= ULTIMATE.start_main_~x~4 41), 126628#(<= ULTIMATE.start_main_~x~4 40), 126631#(<= ULTIMATE.start_main_~x~4 43), 126630#(<= ULTIMATE.start_main_~x~4 42), 126633#(<= ULTIMATE.start_main_~x~4 45), 126632#(<= ULTIMATE.start_main_~x~4 44), 126635#(<= ULTIMATE.start_main_~x~4 47), 126634#(<= ULTIMATE.start_main_~x~4 46), 126637#(<= ULTIMATE.start_main_~x~4 49), 126636#(<= ULTIMATE.start_main_~x~4 48), 126639#(<= ULTIMATE.start_main_~x~4 51), 126638#(<= ULTIMATE.start_main_~x~4 50), 126641#(<= ULTIMATE.start_main_~x~4 53), 126640#(<= ULTIMATE.start_main_~x~4 52), 126643#(<= ULTIMATE.start_main_~x~4 55), 126642#(<= ULTIMATE.start_main_~x~4 54), 126645#(<= ULTIMATE.start_main_~x~4 57), 126644#(<= ULTIMATE.start_main_~x~4 56), 126647#(<= ULTIMATE.start_main_~x~4 59), 126646#(<= ULTIMATE.start_main_~x~4 58), 126649#(<= ULTIMATE.start_main_~x~4 61), 126648#(<= ULTIMATE.start_main_~x~4 60), 126651#(<= ULTIMATE.start_main_~x~4 63), 126650#(<= ULTIMATE.start_main_~x~4 62), 126653#(<= ULTIMATE.start_main_~x~4 65), 126652#(<= ULTIMATE.start_main_~x~4 64), 126655#(<= ULTIMATE.start_main_~x~4 67), 126654#(<= ULTIMATE.start_main_~x~4 66), 126657#(<= ULTIMATE.start_main_~x~4 69), 126656#(<= ULTIMATE.start_main_~x~4 68), 126658#(<= ULTIMATE.start_main_~x~4 70), 126587#false, 126586#true, 126589#(<= ULTIMATE.start_main_~x~4 1), 126588#(<= ULTIMATE.start_main_~x~4 0), 126591#(<= ULTIMATE.start_main_~x~4 3), 126590#(<= ULTIMATE.start_main_~x~4 2)] [2018-07-23 13:42:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-07-23 13:42:20,087 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 13:42:20,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 13:42:20,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 13:42:20,088 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-07-23 13:42:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:20,822 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-07-23 13:42:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 13:42:20,822 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-07-23 13:42:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:20,824 INFO L225 Difference]: With dead ends: 869 [2018-07-23 13:42:20,824 INFO L226 Difference]: Without dead ends: 867 [2018-07-23 13:42:20,826 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 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:42:20,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-07-23 13:42:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-07-23 13:42:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-07-23 13:42:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-07-23 13:42:21,460 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-07-23 13:42:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:21,461 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-07-23 13:42:21,461 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 13:42:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-07-23 13:42:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-07-23 13:42:21,465 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:21,466 INFO L357 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-07-23 13:42:21,466 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:21,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 80 times [2018-07-23 13:42:21,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-07-23 13:42:22,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:22,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 13:42:22,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42: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:42:22,153 INFO L185 omatonBuilderFactory]: Interpolants [130177#(<= ULTIMATE.start_main_~x~4 66), 130176#(<= ULTIMATE.start_main_~x~4 65), 130179#(<= ULTIMATE.start_main_~x~4 68), 130178#(<= ULTIMATE.start_main_~x~4 67), 130181#(<= ULTIMATE.start_main_~x~4 70), 130180#(<= ULTIMATE.start_main_~x~4 69), 130182#(<= ULTIMATE.start_main_~x~4 71), 130109#true, 130111#(<= ULTIMATE.start_main_~x~4 0), 130110#false, 130113#(<= ULTIMATE.start_main_~x~4 2), 130112#(<= ULTIMATE.start_main_~x~4 1), 130115#(<= ULTIMATE.start_main_~x~4 4), 130114#(<= ULTIMATE.start_main_~x~4 3), 130117#(<= ULTIMATE.start_main_~x~4 6), 130116#(<= ULTIMATE.start_main_~x~4 5), 130119#(<= ULTIMATE.start_main_~x~4 8), 130118#(<= ULTIMATE.start_main_~x~4 7), 130121#(<= ULTIMATE.start_main_~x~4 10), 130120#(<= ULTIMATE.start_main_~x~4 9), 130123#(<= ULTIMATE.start_main_~x~4 12), 130122#(<= ULTIMATE.start_main_~x~4 11), 130125#(<= ULTIMATE.start_main_~x~4 14), 130124#(<= ULTIMATE.start_main_~x~4 13), 130127#(<= ULTIMATE.start_main_~x~4 16), 130126#(<= ULTIMATE.start_main_~x~4 15), 130129#(<= ULTIMATE.start_main_~x~4 18), 130128#(<= ULTIMATE.start_main_~x~4 17), 130131#(<= ULTIMATE.start_main_~x~4 20), 130130#(<= ULTIMATE.start_main_~x~4 19), 130133#(<= ULTIMATE.start_main_~x~4 22), 130132#(<= ULTIMATE.start_main_~x~4 21), 130135#(<= ULTIMATE.start_main_~x~4 24), 130134#(<= ULTIMATE.start_main_~x~4 23), 130137#(<= ULTIMATE.start_main_~x~4 26), 130136#(<= ULTIMATE.start_main_~x~4 25), 130139#(<= ULTIMATE.start_main_~x~4 28), 130138#(<= ULTIMATE.start_main_~x~4 27), 130141#(<= ULTIMATE.start_main_~x~4 30), 130140#(<= ULTIMATE.start_main_~x~4 29), 130143#(<= ULTIMATE.start_main_~x~4 32), 130142#(<= ULTIMATE.start_main_~x~4 31), 130145#(<= ULTIMATE.start_main_~x~4 34), 130144#(<= ULTIMATE.start_main_~x~4 33), 130147#(<= ULTIMATE.start_main_~x~4 36), 130146#(<= ULTIMATE.start_main_~x~4 35), 130149#(<= ULTIMATE.start_main_~x~4 38), 130148#(<= ULTIMATE.start_main_~x~4 37), 130151#(<= ULTIMATE.start_main_~x~4 40), 130150#(<= ULTIMATE.start_main_~x~4 39), 130153#(<= ULTIMATE.start_main_~x~4 42), 130152#(<= ULTIMATE.start_main_~x~4 41), 130155#(<= ULTIMATE.start_main_~x~4 44), 130154#(<= ULTIMATE.start_main_~x~4 43), 130157#(<= ULTIMATE.start_main_~x~4 46), 130156#(<= ULTIMATE.start_main_~x~4 45), 130159#(<= ULTIMATE.start_main_~x~4 48), 130158#(<= ULTIMATE.start_main_~x~4 47), 130161#(<= ULTIMATE.start_main_~x~4 50), 130160#(<= ULTIMATE.start_main_~x~4 49), 130163#(<= ULTIMATE.start_main_~x~4 52), 130162#(<= ULTIMATE.start_main_~x~4 51), 130165#(<= ULTIMATE.start_main_~x~4 54), 130164#(<= ULTIMATE.start_main_~x~4 53), 130167#(<= ULTIMATE.start_main_~x~4 56), 130166#(<= ULTIMATE.start_main_~x~4 55), 130169#(<= ULTIMATE.start_main_~x~4 58), 130168#(<= ULTIMATE.start_main_~x~4 57), 130171#(<= ULTIMATE.start_main_~x~4 60), 130170#(<= ULTIMATE.start_main_~x~4 59), 130173#(<= ULTIMATE.start_main_~x~4 62), 130172#(<= ULTIMATE.start_main_~x~4 61), 130175#(<= ULTIMATE.start_main_~x~4 64), 130174#(<= ULTIMATE.start_main_~x~4 63)] [2018-07-23 13:42:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-07-23 13:42:22,162 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 13:42:22,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 13:42:22,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:42:22,163 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-07-23 13:42:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:22,887 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-07-23 13:42:22,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 13:42:22,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-07-23 13:42:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:22,889 INFO L225 Difference]: With dead ends: 881 [2018-07-23 13:42:22,889 INFO L226 Difference]: Without dead ends: 879 [2018-07-23 13:42:22,890 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 13:42:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-07-23 13:42:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-07-23 13:42:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-07-23 13:42:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-07-23 13:42:23,553 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-07-23 13:42:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-07-23 13:42:23,553 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 13:42:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-07-23 13:42:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-07-23 13:42:23,558 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:23,558 INFO L357 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-07-23 13:42:23,559 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 81 times [2018-07-23 13:42:23,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-07-23 13:42:24,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:24,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 13:42:24,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:24,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:42:24,255 INFO L185 omatonBuilderFactory]: Interpolants [133682#false, 133683#(<= ULTIMATE.start_main_~x~4 0), 133681#true, 133686#(<= ULTIMATE.start_main_~x~4 3), 133687#(<= ULTIMATE.start_main_~x~4 4), 133684#(<= ULTIMATE.start_main_~x~4 1), 133685#(<= ULTIMATE.start_main_~x~4 2), 133690#(<= ULTIMATE.start_main_~x~4 7), 133691#(<= ULTIMATE.start_main_~x~4 8), 133688#(<= ULTIMATE.start_main_~x~4 5), 133689#(<= ULTIMATE.start_main_~x~4 6), 133694#(<= ULTIMATE.start_main_~x~4 11), 133695#(<= ULTIMATE.start_main_~x~4 12), 133692#(<= ULTIMATE.start_main_~x~4 9), 133693#(<= ULTIMATE.start_main_~x~4 10), 133698#(<= ULTIMATE.start_main_~x~4 15), 133699#(<= ULTIMATE.start_main_~x~4 16), 133696#(<= ULTIMATE.start_main_~x~4 13), 133697#(<= ULTIMATE.start_main_~x~4 14), 133702#(<= ULTIMATE.start_main_~x~4 19), 133703#(<= ULTIMATE.start_main_~x~4 20), 133700#(<= ULTIMATE.start_main_~x~4 17), 133701#(<= ULTIMATE.start_main_~x~4 18), 133706#(<= ULTIMATE.start_main_~x~4 23), 133707#(<= ULTIMATE.start_main_~x~4 24), 133704#(<= ULTIMATE.start_main_~x~4 21), 133705#(<= ULTIMATE.start_main_~x~4 22), 133710#(<= ULTIMATE.start_main_~x~4 27), 133711#(<= ULTIMATE.start_main_~x~4 28), 133708#(<= ULTIMATE.start_main_~x~4 25), 133709#(<= ULTIMATE.start_main_~x~4 26), 133714#(<= ULTIMATE.start_main_~x~4 31), 133715#(<= ULTIMATE.start_main_~x~4 32), 133712#(<= ULTIMATE.start_main_~x~4 29), 133713#(<= ULTIMATE.start_main_~x~4 30), 133718#(<= ULTIMATE.start_main_~x~4 35), 133719#(<= ULTIMATE.start_main_~x~4 36), 133716#(<= ULTIMATE.start_main_~x~4 33), 133717#(<= ULTIMATE.start_main_~x~4 34), 133722#(<= ULTIMATE.start_main_~x~4 39), 133723#(<= ULTIMATE.start_main_~x~4 40), 133720#(<= ULTIMATE.start_main_~x~4 37), 133721#(<= ULTIMATE.start_main_~x~4 38), 133726#(<= ULTIMATE.start_main_~x~4 43), 133727#(<= ULTIMATE.start_main_~x~4 44), 133724#(<= ULTIMATE.start_main_~x~4 41), 133725#(<= ULTIMATE.start_main_~x~4 42), 133730#(<= ULTIMATE.start_main_~x~4 47), 133731#(<= ULTIMATE.start_main_~x~4 48), 133728#(<= ULTIMATE.start_main_~x~4 45), 133729#(<= ULTIMATE.start_main_~x~4 46), 133734#(<= ULTIMATE.start_main_~x~4 51), 133735#(<= ULTIMATE.start_main_~x~4 52), 133732#(<= ULTIMATE.start_main_~x~4 49), 133733#(<= ULTIMATE.start_main_~x~4 50), 133738#(<= ULTIMATE.start_main_~x~4 55), 133739#(<= ULTIMATE.start_main_~x~4 56), 133736#(<= ULTIMATE.start_main_~x~4 53), 133737#(<= ULTIMATE.start_main_~x~4 54), 133742#(<= ULTIMATE.start_main_~x~4 59), 133743#(<= ULTIMATE.start_main_~x~4 60), 133740#(<= ULTIMATE.start_main_~x~4 57), 133741#(<= ULTIMATE.start_main_~x~4 58), 133746#(<= ULTIMATE.start_main_~x~4 63), 133747#(<= ULTIMATE.start_main_~x~4 64), 133744#(<= ULTIMATE.start_main_~x~4 61), 133745#(<= ULTIMATE.start_main_~x~4 62), 133750#(<= ULTIMATE.start_main_~x~4 67), 133751#(<= ULTIMATE.start_main_~x~4 68), 133748#(<= ULTIMATE.start_main_~x~4 65), 133749#(<= ULTIMATE.start_main_~x~4 66), 133754#(<= ULTIMATE.start_main_~x~4 71), 133755#(<= ULTIMATE.start_main_~x~4 72), 133752#(<= ULTIMATE.start_main_~x~4 69), 133753#(<= ULTIMATE.start_main_~x~4 70)] [2018-07-23 13:42:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-07-23 13:42:24,264 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 13:42:24,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 13:42:24,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:42:24,265 INFO L87 Difference]: Start difference. First operand 868 states and 940 transitions. Second operand 75 states. [2018-07-23 13:42:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:25,028 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-07-23 13:42:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 13:42:25,028 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 867 [2018-07-23 13:42:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:25,030 INFO L225 Difference]: With dead ends: 893 [2018-07-23 13:42:25,030 INFO L226 Difference]: Without dead ends: 891 [2018-07-23 13:42:25,031 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 13:42:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-07-23 13:42:25,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 880. [2018-07-23 13:42:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-07-23 13:42:25,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 953 transitions. [2018-07-23 13:42:25,708 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 953 transitions. Word has length 867 [2018-07-23 13:42:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:25,709 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 953 transitions. [2018-07-23 13:42:25,709 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 13:42:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 953 transitions. [2018-07-23 13:42:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-07-23 13:42:25,713 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:25,714 INFO L357 BasicCegarLoop]: trace histogram [730, 73, 73, 1, 1, 1] [2018-07-23 13:42:25,714 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash 943168797, now seen corresponding path program 82 times [2018-07-23 13:42:25,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-07-23 13:42:26,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:26,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 13:42:26,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:26,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:42:26,393 INFO L185 omatonBuilderFactory]: Interpolants [137346#(<= ULTIMATE.start_main_~x~4 42), 137347#(<= ULTIMATE.start_main_~x~4 43), 137344#(<= ULTIMATE.start_main_~x~4 40), 137345#(<= ULTIMATE.start_main_~x~4 41), 137350#(<= ULTIMATE.start_main_~x~4 46), 137351#(<= ULTIMATE.start_main_~x~4 47), 137348#(<= ULTIMATE.start_main_~x~4 44), 137349#(<= ULTIMATE.start_main_~x~4 45), 137354#(<= ULTIMATE.start_main_~x~4 50), 137355#(<= ULTIMATE.start_main_~x~4 51), 137352#(<= ULTIMATE.start_main_~x~4 48), 137353#(<= ULTIMATE.start_main_~x~4 49), 137358#(<= ULTIMATE.start_main_~x~4 54), 137359#(<= ULTIMATE.start_main_~x~4 55), 137356#(<= ULTIMATE.start_main_~x~4 52), 137357#(<= ULTIMATE.start_main_~x~4 53), 137362#(<= ULTIMATE.start_main_~x~4 58), 137363#(<= ULTIMATE.start_main_~x~4 59), 137360#(<= ULTIMATE.start_main_~x~4 56), 137361#(<= ULTIMATE.start_main_~x~4 57), 137366#(<= ULTIMATE.start_main_~x~4 62), 137367#(<= ULTIMATE.start_main_~x~4 63), 137364#(<= ULTIMATE.start_main_~x~4 60), 137365#(<= ULTIMATE.start_main_~x~4 61), 137370#(<= ULTIMATE.start_main_~x~4 66), 137371#(<= ULTIMATE.start_main_~x~4 67), 137368#(<= ULTIMATE.start_main_~x~4 64), 137369#(<= ULTIMATE.start_main_~x~4 65), 137374#(<= ULTIMATE.start_main_~x~4 70), 137375#(<= ULTIMATE.start_main_~x~4 71), 137372#(<= ULTIMATE.start_main_~x~4 68), 137373#(<= ULTIMATE.start_main_~x~4 69), 137376#(<= ULTIMATE.start_main_~x~4 72), 137377#(<= ULTIMATE.start_main_~x~4 73), 137302#true, 137303#false, 137306#(<= ULTIMATE.start_main_~x~4 2), 137307#(<= ULTIMATE.start_main_~x~4 3), 137304#(<= ULTIMATE.start_main_~x~4 0), 137305#(<= ULTIMATE.start_main_~x~4 1), 137310#(<= ULTIMATE.start_main_~x~4 6), 137311#(<= ULTIMATE.start_main_~x~4 7), 137308#(<= ULTIMATE.start_main_~x~4 4), 137309#(<= ULTIMATE.start_main_~x~4 5), 137314#(<= ULTIMATE.start_main_~x~4 10), 137315#(<= ULTIMATE.start_main_~x~4 11), 137312#(<= ULTIMATE.start_main_~x~4 8), 137313#(<= ULTIMATE.start_main_~x~4 9), 137318#(<= ULTIMATE.start_main_~x~4 14), 137319#(<= ULTIMATE.start_main_~x~4 15), 137316#(<= ULTIMATE.start_main_~x~4 12), 137317#(<= ULTIMATE.start_main_~x~4 13), 137322#(<= ULTIMATE.start_main_~x~4 18), 137323#(<= ULTIMATE.start_main_~x~4 19), 137320#(<= ULTIMATE.start_main_~x~4 16), 137321#(<= ULTIMATE.start_main_~x~4 17), 137326#(<= ULTIMATE.start_main_~x~4 22), 137327#(<= ULTIMATE.start_main_~x~4 23), 137324#(<= ULTIMATE.start_main_~x~4 20), 137325#(<= ULTIMATE.start_main_~x~4 21), 137330#(<= ULTIMATE.start_main_~x~4 26), 137331#(<= ULTIMATE.start_main_~x~4 27), 137328#(<= ULTIMATE.start_main_~x~4 24), 137329#(<= ULTIMATE.start_main_~x~4 25), 137334#(<= ULTIMATE.start_main_~x~4 30), 137335#(<= ULTIMATE.start_main_~x~4 31), 137332#(<= ULTIMATE.start_main_~x~4 28), 137333#(<= ULTIMATE.start_main_~x~4 29), 137338#(<= ULTIMATE.start_main_~x~4 34), 137339#(<= ULTIMATE.start_main_~x~4 35), 137336#(<= ULTIMATE.start_main_~x~4 32), 137337#(<= ULTIMATE.start_main_~x~4 33), 137342#(<= ULTIMATE.start_main_~x~4 38), 137343#(<= ULTIMATE.start_main_~x~4 39), 137340#(<= ULTIMATE.start_main_~x~4 36), 137341#(<= ULTIMATE.start_main_~x~4 37)] [2018-07-23 13:42:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-07-23 13:42:26,403 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 13:42:26,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 13:42:26,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:42:26,404 INFO L87 Difference]: Start difference. First operand 880 states and 953 transitions. Second operand 76 states. [2018-07-23 13:42:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:27,155 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-07-23 13:42:27,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 13:42:27,156 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 879 [2018-07-23 13:42:27,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:27,157 INFO L225 Difference]: With dead ends: 905 [2018-07-23 13:42:27,157 INFO L226 Difference]: Without dead ends: 903 [2018-07-23 13:42:27,158 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 13:42:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-07-23 13:42:27,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2018-07-23 13:42:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-07-23 13:42:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 966 transitions. [2018-07-23 13:42:27,913 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 966 transitions. Word has length 879 [2018-07-23 13:42:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:27,914 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 966 transitions. [2018-07-23 13:42:27,914 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 13:42:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 966 transitions. [2018-07-23 13:42:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-07-23 13:42:27,918 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:27,919 INFO L357 BasicCegarLoop]: trace histogram [740, 74, 74, 1, 1, 1] [2018-07-23 13:42:27,919 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash -811917977, now seen corresponding path program 83 times [2018-07-23 13:42:27,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-07-23 13:42:28,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:28,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 13:42:28,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:28,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:42:28,611 INFO L185 omatonBuilderFactory]: Interpolants [140974#(<= ULTIMATE.start_main_~x~4 0), 140975#(<= ULTIMATE.start_main_~x~4 1), 140972#true, 140973#false, 140978#(<= ULTIMATE.start_main_~x~4 4), 140979#(<= ULTIMATE.start_main_~x~4 5), 140976#(<= ULTIMATE.start_main_~x~4 2), 140977#(<= ULTIMATE.start_main_~x~4 3), 140982#(<= ULTIMATE.start_main_~x~4 8), 140983#(<= ULTIMATE.start_main_~x~4 9), 140980#(<= ULTIMATE.start_main_~x~4 6), 140981#(<= ULTIMATE.start_main_~x~4 7), 140986#(<= ULTIMATE.start_main_~x~4 12), 140987#(<= ULTIMATE.start_main_~x~4 13), 140984#(<= ULTIMATE.start_main_~x~4 10), 140985#(<= ULTIMATE.start_main_~x~4 11), 140990#(<= ULTIMATE.start_main_~x~4 16), 140991#(<= ULTIMATE.start_main_~x~4 17), 140988#(<= ULTIMATE.start_main_~x~4 14), 140989#(<= ULTIMATE.start_main_~x~4 15), 140994#(<= ULTIMATE.start_main_~x~4 20), 140995#(<= ULTIMATE.start_main_~x~4 21), 140992#(<= ULTIMATE.start_main_~x~4 18), 140993#(<= ULTIMATE.start_main_~x~4 19), 140998#(<= ULTIMATE.start_main_~x~4 24), 140999#(<= ULTIMATE.start_main_~x~4 25), 140996#(<= ULTIMATE.start_main_~x~4 22), 140997#(<= ULTIMATE.start_main_~x~4 23), 141002#(<= ULTIMATE.start_main_~x~4 28), 141003#(<= ULTIMATE.start_main_~x~4 29), 141000#(<= ULTIMATE.start_main_~x~4 26), 141001#(<= ULTIMATE.start_main_~x~4 27), 141006#(<= ULTIMATE.start_main_~x~4 32), 141007#(<= ULTIMATE.start_main_~x~4 33), 141004#(<= ULTIMATE.start_main_~x~4 30), 141005#(<= ULTIMATE.start_main_~x~4 31), 141010#(<= ULTIMATE.start_main_~x~4 36), 141011#(<= ULTIMATE.start_main_~x~4 37), 141008#(<= ULTIMATE.start_main_~x~4 34), 141009#(<= ULTIMATE.start_main_~x~4 35), 141014#(<= ULTIMATE.start_main_~x~4 40), 141015#(<= ULTIMATE.start_main_~x~4 41), 141012#(<= ULTIMATE.start_main_~x~4 38), 141013#(<= ULTIMATE.start_main_~x~4 39), 141018#(<= ULTIMATE.start_main_~x~4 44), 141019#(<= ULTIMATE.start_main_~x~4 45), 141016#(<= ULTIMATE.start_main_~x~4 42), 141017#(<= ULTIMATE.start_main_~x~4 43), 141022#(<= ULTIMATE.start_main_~x~4 48), 141023#(<= ULTIMATE.start_main_~x~4 49), 141020#(<= ULTIMATE.start_main_~x~4 46), 141021#(<= ULTIMATE.start_main_~x~4 47), 141026#(<= ULTIMATE.start_main_~x~4 52), 141027#(<= ULTIMATE.start_main_~x~4 53), 141024#(<= ULTIMATE.start_main_~x~4 50), 141025#(<= ULTIMATE.start_main_~x~4 51), 141030#(<= ULTIMATE.start_main_~x~4 56), 141031#(<= ULTIMATE.start_main_~x~4 57), 141028#(<= ULTIMATE.start_main_~x~4 54), 141029#(<= ULTIMATE.start_main_~x~4 55), 141034#(<= ULTIMATE.start_main_~x~4 60), 141035#(<= ULTIMATE.start_main_~x~4 61), 141032#(<= ULTIMATE.start_main_~x~4 58), 141033#(<= ULTIMATE.start_main_~x~4 59), 141038#(<= ULTIMATE.start_main_~x~4 64), 141039#(<= ULTIMATE.start_main_~x~4 65), 141036#(<= ULTIMATE.start_main_~x~4 62), 141037#(<= ULTIMATE.start_main_~x~4 63), 141042#(<= ULTIMATE.start_main_~x~4 68), 141043#(<= ULTIMATE.start_main_~x~4 69), 141040#(<= ULTIMATE.start_main_~x~4 66), 141041#(<= ULTIMATE.start_main_~x~4 67), 141046#(<= ULTIMATE.start_main_~x~4 72), 141047#(<= ULTIMATE.start_main_~x~4 73), 141044#(<= ULTIMATE.start_main_~x~4 70), 141045#(<= ULTIMATE.start_main_~x~4 71), 141048#(<= ULTIMATE.start_main_~x~4 74)] [2018-07-23 13:42:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-07-23 13:42:28,621 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 13:42:28,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 13:42:28,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:42:28,622 INFO L87 Difference]: Start difference. First operand 892 states and 966 transitions. Second operand 77 states. [2018-07-23 13:42:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:29,481 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-07-23 13:42:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 13:42:29,482 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 891 [2018-07-23 13:42:29,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:29,483 INFO L225 Difference]: With dead ends: 917 [2018-07-23 13:42:29,483 INFO L226 Difference]: Without dead ends: 915 [2018-07-23 13:42:29,484 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 13:42:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-07-23 13:42:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 904. [2018-07-23 13:42:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-07-23 13:42:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 979 transitions. [2018-07-23 13:42:30,211 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 979 transitions. Word has length 891 [2018-07-23 13:42:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:30,212 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 979 transitions. [2018-07-23 13:42:30,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 13:42:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 979 transitions. [2018-07-23 13:42:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-07-23 13:42:30,217 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:30,218 INFO L357 BasicCegarLoop]: trace histogram [750, 75, 75, 1, 1, 1] [2018-07-23 13:42:30,218 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash -543261007, now seen corresponding path program 84 times [2018-07-23 13:42:30,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-07-23 13:42:30,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:30,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 13:42:30,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:30,976 INFO L185 omatonBuilderFactory]: Interpolants [144768#(<= ULTIMATE.start_main_~x~4 75), 144691#true, 144694#(<= ULTIMATE.start_main_~x~4 1), 144695#(<= ULTIMATE.start_main_~x~4 2), 144692#false, 144693#(<= ULTIMATE.start_main_~x~4 0), 144698#(<= ULTIMATE.start_main_~x~4 5), 144699#(<= ULTIMATE.start_main_~x~4 6), 144696#(<= ULTIMATE.start_main_~x~4 3), 144697#(<= ULTIMATE.start_main_~x~4 4), 144702#(<= ULTIMATE.start_main_~x~4 9), 144703#(<= ULTIMATE.start_main_~x~4 10), 144700#(<= ULTIMATE.start_main_~x~4 7), 144701#(<= ULTIMATE.start_main_~x~4 8), 144706#(<= ULTIMATE.start_main_~x~4 13), 144707#(<= ULTIMATE.start_main_~x~4 14), 144704#(<= ULTIMATE.start_main_~x~4 11), 144705#(<= ULTIMATE.start_main_~x~4 12), 144710#(<= ULTIMATE.start_main_~x~4 17), 144711#(<= ULTIMATE.start_main_~x~4 18), 144708#(<= ULTIMATE.start_main_~x~4 15), 144709#(<= ULTIMATE.start_main_~x~4 16), 144714#(<= ULTIMATE.start_main_~x~4 21), 144715#(<= ULTIMATE.start_main_~x~4 22), 144712#(<= ULTIMATE.start_main_~x~4 19), 144713#(<= ULTIMATE.start_main_~x~4 20), 144718#(<= ULTIMATE.start_main_~x~4 25), 144719#(<= ULTIMATE.start_main_~x~4 26), 144716#(<= ULTIMATE.start_main_~x~4 23), 144717#(<= ULTIMATE.start_main_~x~4 24), 144722#(<= ULTIMATE.start_main_~x~4 29), 144723#(<= ULTIMATE.start_main_~x~4 30), 144720#(<= ULTIMATE.start_main_~x~4 27), 144721#(<= ULTIMATE.start_main_~x~4 28), 144726#(<= ULTIMATE.start_main_~x~4 33), 144727#(<= ULTIMATE.start_main_~x~4 34), 144724#(<= ULTIMATE.start_main_~x~4 31), 144725#(<= ULTIMATE.start_main_~x~4 32), 144730#(<= ULTIMATE.start_main_~x~4 37), 144731#(<= ULTIMATE.start_main_~x~4 38), 144728#(<= ULTIMATE.start_main_~x~4 35), 144729#(<= ULTIMATE.start_main_~x~4 36), 144734#(<= ULTIMATE.start_main_~x~4 41), 144735#(<= ULTIMATE.start_main_~x~4 42), 144732#(<= ULTIMATE.start_main_~x~4 39), 144733#(<= ULTIMATE.start_main_~x~4 40), 144738#(<= ULTIMATE.start_main_~x~4 45), 144739#(<= ULTIMATE.start_main_~x~4 46), 144736#(<= ULTIMATE.start_main_~x~4 43), 144737#(<= ULTIMATE.start_main_~x~4 44), 144742#(<= ULTIMATE.start_main_~x~4 49), 144743#(<= ULTIMATE.start_main_~x~4 50), 144740#(<= ULTIMATE.start_main_~x~4 47), 144741#(<= ULTIMATE.start_main_~x~4 48), 144746#(<= ULTIMATE.start_main_~x~4 53), 144747#(<= ULTIMATE.start_main_~x~4 54), 144744#(<= ULTIMATE.start_main_~x~4 51), 144745#(<= ULTIMATE.start_main_~x~4 52), 144750#(<= ULTIMATE.start_main_~x~4 57), 144751#(<= ULTIMATE.start_main_~x~4 58), 144748#(<= ULTIMATE.start_main_~x~4 55), 144749#(<= ULTIMATE.start_main_~x~4 56), 144754#(<= ULTIMATE.start_main_~x~4 61), 144755#(<= ULTIMATE.start_main_~x~4 62), 144752#(<= ULTIMATE.start_main_~x~4 59), 144753#(<= ULTIMATE.start_main_~x~4 60), 144758#(<= ULTIMATE.start_main_~x~4 65), 144759#(<= ULTIMATE.start_main_~x~4 66), 144756#(<= ULTIMATE.start_main_~x~4 63), 144757#(<= ULTIMATE.start_main_~x~4 64), 144762#(<= ULTIMATE.start_main_~x~4 69), 144763#(<= ULTIMATE.start_main_~x~4 70), 144760#(<= ULTIMATE.start_main_~x~4 67), 144761#(<= ULTIMATE.start_main_~x~4 68), 144766#(<= ULTIMATE.start_main_~x~4 73), 144767#(<= ULTIMATE.start_main_~x~4 74), 144764#(<= ULTIMATE.start_main_~x~4 71), 144765#(<= ULTIMATE.start_main_~x~4 72)] [2018-07-23 13:42:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-07-23 13:42:30,986 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 13:42:30,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 13:42:30,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 13:42:30,987 INFO L87 Difference]: Start difference. First operand 904 states and 979 transitions. Second operand 78 states. [2018-07-23 13:42:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:31,823 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-07-23 13:42:31,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 13:42:31,823 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 903 [2018-07-23 13:42:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:31,825 INFO L225 Difference]: With dead ends: 929 [2018-07-23 13:42:31,825 INFO L226 Difference]: Without dead ends: 927 [2018-07-23 13:42:31,826 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 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:42:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-07-23 13:42:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 916. [2018-07-23 13:42:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-07-23 13:42:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2018-07-23 13:42:32,577 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 903 [2018-07-23 13:42:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:32,578 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2018-07-23 13:42:32,578 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 13:42:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2018-07-23 13:42:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-07-23 13:42:32,584 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:32,584 INFO L357 BasicCegarLoop]: trace histogram [760, 76, 76, 1, 1, 1] [2018-07-23 13:42:32,584 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1703395077, now seen corresponding path program 85 times [2018-07-23 13:42:32,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-07-23 13:42:33,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:33,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 13:42:33,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:33,362 INFO L185 omatonBuilderFactory]: Interpolants [148482#(<= ULTIMATE.start_main_~x~4 21), 148483#(<= ULTIMATE.start_main_~x~4 22), 148480#(<= ULTIMATE.start_main_~x~4 19), 148481#(<= ULTIMATE.start_main_~x~4 20), 148486#(<= ULTIMATE.start_main_~x~4 25), 148487#(<= ULTIMATE.start_main_~x~4 26), 148484#(<= ULTIMATE.start_main_~x~4 23), 148485#(<= ULTIMATE.start_main_~x~4 24), 148490#(<= ULTIMATE.start_main_~x~4 29), 148491#(<= ULTIMATE.start_main_~x~4 30), 148488#(<= ULTIMATE.start_main_~x~4 27), 148489#(<= ULTIMATE.start_main_~x~4 28), 148494#(<= ULTIMATE.start_main_~x~4 33), 148495#(<= ULTIMATE.start_main_~x~4 34), 148492#(<= ULTIMATE.start_main_~x~4 31), 148493#(<= ULTIMATE.start_main_~x~4 32), 148498#(<= ULTIMATE.start_main_~x~4 37), 148499#(<= ULTIMATE.start_main_~x~4 38), 148496#(<= ULTIMATE.start_main_~x~4 35), 148497#(<= ULTIMATE.start_main_~x~4 36), 148502#(<= ULTIMATE.start_main_~x~4 41), 148503#(<= ULTIMATE.start_main_~x~4 42), 148500#(<= ULTIMATE.start_main_~x~4 39), 148501#(<= ULTIMATE.start_main_~x~4 40), 148506#(<= ULTIMATE.start_main_~x~4 45), 148507#(<= ULTIMATE.start_main_~x~4 46), 148504#(<= ULTIMATE.start_main_~x~4 43), 148505#(<= ULTIMATE.start_main_~x~4 44), 148510#(<= ULTIMATE.start_main_~x~4 49), 148511#(<= ULTIMATE.start_main_~x~4 50), 148508#(<= ULTIMATE.start_main_~x~4 47), 148509#(<= ULTIMATE.start_main_~x~4 48), 148514#(<= ULTIMATE.start_main_~x~4 53), 148515#(<= ULTIMATE.start_main_~x~4 54), 148512#(<= ULTIMATE.start_main_~x~4 51), 148513#(<= ULTIMATE.start_main_~x~4 52), 148518#(<= ULTIMATE.start_main_~x~4 57), 148519#(<= ULTIMATE.start_main_~x~4 58), 148516#(<= ULTIMATE.start_main_~x~4 55), 148517#(<= ULTIMATE.start_main_~x~4 56), 148522#(<= ULTIMATE.start_main_~x~4 61), 148523#(<= ULTIMATE.start_main_~x~4 62), 148520#(<= ULTIMATE.start_main_~x~4 59), 148521#(<= ULTIMATE.start_main_~x~4 60), 148526#(<= ULTIMATE.start_main_~x~4 65), 148527#(<= ULTIMATE.start_main_~x~4 66), 148524#(<= ULTIMATE.start_main_~x~4 63), 148525#(<= ULTIMATE.start_main_~x~4 64), 148530#(<= ULTIMATE.start_main_~x~4 69), 148531#(<= ULTIMATE.start_main_~x~4 70), 148528#(<= ULTIMATE.start_main_~x~4 67), 148529#(<= ULTIMATE.start_main_~x~4 68), 148534#(<= ULTIMATE.start_main_~x~4 73), 148535#(<= ULTIMATE.start_main_~x~4 74), 148532#(<= ULTIMATE.start_main_~x~4 71), 148533#(<= ULTIMATE.start_main_~x~4 72), 148536#(<= ULTIMATE.start_main_~x~4 75), 148537#(<= ULTIMATE.start_main_~x~4 76), 148459#true, 148462#(<= ULTIMATE.start_main_~x~4 1), 148463#(<= ULTIMATE.start_main_~x~4 2), 148460#false, 148461#(<= ULTIMATE.start_main_~x~4 0), 148466#(<= ULTIMATE.start_main_~x~4 5), 148467#(<= ULTIMATE.start_main_~x~4 6), 148464#(<= ULTIMATE.start_main_~x~4 3), 148465#(<= ULTIMATE.start_main_~x~4 4), 148470#(<= ULTIMATE.start_main_~x~4 9), 148471#(<= ULTIMATE.start_main_~x~4 10), 148468#(<= ULTIMATE.start_main_~x~4 7), 148469#(<= ULTIMATE.start_main_~x~4 8), 148474#(<= ULTIMATE.start_main_~x~4 13), 148475#(<= ULTIMATE.start_main_~x~4 14), 148472#(<= ULTIMATE.start_main_~x~4 11), 148473#(<= ULTIMATE.start_main_~x~4 12), 148478#(<= ULTIMATE.start_main_~x~4 17), 148479#(<= ULTIMATE.start_main_~x~4 18), 148476#(<= ULTIMATE.start_main_~x~4 15), 148477#(<= ULTIMATE.start_main_~x~4 16)] [2018-07-23 13:42:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-07-23 13:42:33,372 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 13:42:33,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 13:42:33,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 13:42:33,374 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 79 states. [2018-07-23 13:42:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:34,229 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-07-23 13:42:34,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 13:42:34,229 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 915 [2018-07-23 13:42:34,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:34,232 INFO L225 Difference]: With dead ends: 941 [2018-07-23 13:42:34,232 INFO L226 Difference]: Without dead ends: 939 [2018-07-23 13:42:34,232 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 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:42:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-07-23 13:42:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 928. [2018-07-23 13:42:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-07-23 13:42:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1005 transitions. [2018-07-23 13:42:35,009 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1005 transitions. Word has length 915 [2018-07-23 13:42:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:35,009 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1005 transitions. [2018-07-23 13:42:35,009 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 13:42:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1005 transitions. [2018-07-23 13:42:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-07-23 13:42:35,014 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:35,014 INFO L357 BasicCegarLoop]: trace histogram [770, 77, 77, 1, 1, 1] [2018-07-23 13:42:35,015 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:35,015 INFO L82 PathProgramCache]: Analyzing trace with hash 345957445, now seen corresponding path program 86 times [2018-07-23 13:42:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-07-23 13:42:35,773 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:35,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 13:42:35,773 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:35,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:42:35,774 INFO L185 omatonBuilderFactory]: Interpolants [152322#(<= ULTIMATE.start_main_~x~4 44), 152323#(<= ULTIMATE.start_main_~x~4 45), 152320#(<= ULTIMATE.start_main_~x~4 42), 152321#(<= ULTIMATE.start_main_~x~4 43), 152326#(<= ULTIMATE.start_main_~x~4 48), 152327#(<= ULTIMATE.start_main_~x~4 49), 152324#(<= ULTIMATE.start_main_~x~4 46), 152325#(<= ULTIMATE.start_main_~x~4 47), 152330#(<= ULTIMATE.start_main_~x~4 52), 152331#(<= ULTIMATE.start_main_~x~4 53), 152328#(<= ULTIMATE.start_main_~x~4 50), 152329#(<= ULTIMATE.start_main_~x~4 51), 152334#(<= ULTIMATE.start_main_~x~4 56), 152335#(<= ULTIMATE.start_main_~x~4 57), 152332#(<= ULTIMATE.start_main_~x~4 54), 152333#(<= ULTIMATE.start_main_~x~4 55), 152338#(<= ULTIMATE.start_main_~x~4 60), 152339#(<= ULTIMATE.start_main_~x~4 61), 152336#(<= ULTIMATE.start_main_~x~4 58), 152337#(<= ULTIMATE.start_main_~x~4 59), 152342#(<= ULTIMATE.start_main_~x~4 64), 152343#(<= ULTIMATE.start_main_~x~4 65), 152340#(<= ULTIMATE.start_main_~x~4 62), 152341#(<= ULTIMATE.start_main_~x~4 63), 152346#(<= ULTIMATE.start_main_~x~4 68), 152347#(<= ULTIMATE.start_main_~x~4 69), 152344#(<= ULTIMATE.start_main_~x~4 66), 152345#(<= ULTIMATE.start_main_~x~4 67), 152350#(<= ULTIMATE.start_main_~x~4 72), 152351#(<= ULTIMATE.start_main_~x~4 73), 152348#(<= ULTIMATE.start_main_~x~4 70), 152349#(<= ULTIMATE.start_main_~x~4 71), 152354#(<= ULTIMATE.start_main_~x~4 76), 152355#(<= ULTIMATE.start_main_~x~4 77), 152352#(<= ULTIMATE.start_main_~x~4 74), 152353#(<= ULTIMATE.start_main_~x~4 75), 152278#(<= ULTIMATE.start_main_~x~4 0), 152279#(<= ULTIMATE.start_main_~x~4 1), 152276#true, 152277#false, 152282#(<= ULTIMATE.start_main_~x~4 4), 152283#(<= ULTIMATE.start_main_~x~4 5), 152280#(<= ULTIMATE.start_main_~x~4 2), 152281#(<= ULTIMATE.start_main_~x~4 3), 152286#(<= ULTIMATE.start_main_~x~4 8), 152287#(<= ULTIMATE.start_main_~x~4 9), 152284#(<= ULTIMATE.start_main_~x~4 6), 152285#(<= ULTIMATE.start_main_~x~4 7), 152290#(<= ULTIMATE.start_main_~x~4 12), 152291#(<= ULTIMATE.start_main_~x~4 13), 152288#(<= ULTIMATE.start_main_~x~4 10), 152289#(<= ULTIMATE.start_main_~x~4 11), 152294#(<= ULTIMATE.start_main_~x~4 16), 152295#(<= ULTIMATE.start_main_~x~4 17), 152292#(<= ULTIMATE.start_main_~x~4 14), 152293#(<= ULTIMATE.start_main_~x~4 15), 152298#(<= ULTIMATE.start_main_~x~4 20), 152299#(<= ULTIMATE.start_main_~x~4 21), 152296#(<= ULTIMATE.start_main_~x~4 18), 152297#(<= ULTIMATE.start_main_~x~4 19), 152302#(<= ULTIMATE.start_main_~x~4 24), 152303#(<= ULTIMATE.start_main_~x~4 25), 152300#(<= ULTIMATE.start_main_~x~4 22), 152301#(<= ULTIMATE.start_main_~x~4 23), 152306#(<= ULTIMATE.start_main_~x~4 28), 152307#(<= ULTIMATE.start_main_~x~4 29), 152304#(<= ULTIMATE.start_main_~x~4 26), 152305#(<= ULTIMATE.start_main_~x~4 27), 152310#(<= ULTIMATE.start_main_~x~4 32), 152311#(<= ULTIMATE.start_main_~x~4 33), 152308#(<= ULTIMATE.start_main_~x~4 30), 152309#(<= ULTIMATE.start_main_~x~4 31), 152314#(<= ULTIMATE.start_main_~x~4 36), 152315#(<= ULTIMATE.start_main_~x~4 37), 152312#(<= ULTIMATE.start_main_~x~4 34), 152313#(<= ULTIMATE.start_main_~x~4 35), 152318#(<= ULTIMATE.start_main_~x~4 40), 152319#(<= ULTIMATE.start_main_~x~4 41), 152316#(<= ULTIMATE.start_main_~x~4 38), 152317#(<= ULTIMATE.start_main_~x~4 39)] [2018-07-23 13:42:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-07-23 13:42:35,785 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 13:42:35,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 13:42:35,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 13:42:35,786 INFO L87 Difference]: Start difference. First operand 928 states and 1005 transitions. Second operand 80 states. [2018-07-23 13:42:36,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:36,665 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-07-23 13:42:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 13:42:36,666 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 927 [2018-07-23 13:42:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:36,667 INFO L225 Difference]: With dead ends: 953 [2018-07-23 13:42:36,667 INFO L226 Difference]: Without dead ends: 951 [2018-07-23 13:42:36,668 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 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:42:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-07-23 13:42:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 940. [2018-07-23 13:42:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-07-23 13:42:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1018 transitions. [2018-07-23 13:42:37,455 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1018 transitions. Word has length 927 [2018-07-23 13:42:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:37,456 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1018 transitions. [2018-07-23 13:42:37,456 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 13:42:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1018 transitions. [2018-07-23 13:42:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-07-23 13:42:37,461 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:37,462 INFO L357 BasicCegarLoop]: trace histogram [780, 78, 78, 1, 1, 1] [2018-07-23 13:42:37,462 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -456595313, now seen corresponding path program 87 times [2018-07-23 13:42:37,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-07-23 13:42:38,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:38,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 13:42:38,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:38,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:42:38,233 INFO L185 omatonBuilderFactory]: Interpolants [156162#(<= ULTIMATE.start_main_~x~4 18), 156163#(<= ULTIMATE.start_main_~x~4 19), 156160#(<= ULTIMATE.start_main_~x~4 16), 156161#(<= ULTIMATE.start_main_~x~4 17), 156166#(<= ULTIMATE.start_main_~x~4 22), 156167#(<= ULTIMATE.start_main_~x~4 23), 156164#(<= ULTIMATE.start_main_~x~4 20), 156165#(<= ULTIMATE.start_main_~x~4 21), 156170#(<= ULTIMATE.start_main_~x~4 26), 156171#(<= ULTIMATE.start_main_~x~4 27), 156168#(<= ULTIMATE.start_main_~x~4 24), 156169#(<= ULTIMATE.start_main_~x~4 25), 156174#(<= ULTIMATE.start_main_~x~4 30), 156175#(<= ULTIMATE.start_main_~x~4 31), 156172#(<= ULTIMATE.start_main_~x~4 28), 156173#(<= ULTIMATE.start_main_~x~4 29), 156178#(<= ULTIMATE.start_main_~x~4 34), 156179#(<= ULTIMATE.start_main_~x~4 35), 156176#(<= ULTIMATE.start_main_~x~4 32), 156177#(<= ULTIMATE.start_main_~x~4 33), 156182#(<= ULTIMATE.start_main_~x~4 38), 156183#(<= ULTIMATE.start_main_~x~4 39), 156180#(<= ULTIMATE.start_main_~x~4 36), 156181#(<= ULTIMATE.start_main_~x~4 37), 156186#(<= ULTIMATE.start_main_~x~4 42), 156187#(<= ULTIMATE.start_main_~x~4 43), 156184#(<= ULTIMATE.start_main_~x~4 40), 156185#(<= ULTIMATE.start_main_~x~4 41), 156190#(<= ULTIMATE.start_main_~x~4 46), 156191#(<= ULTIMATE.start_main_~x~4 47), 156188#(<= ULTIMATE.start_main_~x~4 44), 156189#(<= ULTIMATE.start_main_~x~4 45), 156194#(<= ULTIMATE.start_main_~x~4 50), 156195#(<= ULTIMATE.start_main_~x~4 51), 156192#(<= ULTIMATE.start_main_~x~4 48), 156193#(<= ULTIMATE.start_main_~x~4 49), 156198#(<= ULTIMATE.start_main_~x~4 54), 156199#(<= ULTIMATE.start_main_~x~4 55), 156196#(<= ULTIMATE.start_main_~x~4 52), 156197#(<= ULTIMATE.start_main_~x~4 53), 156202#(<= ULTIMATE.start_main_~x~4 58), 156203#(<= ULTIMATE.start_main_~x~4 59), 156200#(<= ULTIMATE.start_main_~x~4 56), 156201#(<= ULTIMATE.start_main_~x~4 57), 156206#(<= ULTIMATE.start_main_~x~4 62), 156207#(<= ULTIMATE.start_main_~x~4 63), 156204#(<= ULTIMATE.start_main_~x~4 60), 156205#(<= ULTIMATE.start_main_~x~4 61), 156210#(<= ULTIMATE.start_main_~x~4 66), 156211#(<= ULTIMATE.start_main_~x~4 67), 156208#(<= ULTIMATE.start_main_~x~4 64), 156209#(<= ULTIMATE.start_main_~x~4 65), 156214#(<= ULTIMATE.start_main_~x~4 70), 156215#(<= ULTIMATE.start_main_~x~4 71), 156212#(<= ULTIMATE.start_main_~x~4 68), 156213#(<= ULTIMATE.start_main_~x~4 69), 156218#(<= ULTIMATE.start_main_~x~4 74), 156219#(<= ULTIMATE.start_main_~x~4 75), 156216#(<= ULTIMATE.start_main_~x~4 72), 156217#(<= ULTIMATE.start_main_~x~4 73), 156222#(<= ULTIMATE.start_main_~x~4 78), 156220#(<= ULTIMATE.start_main_~x~4 76), 156221#(<= ULTIMATE.start_main_~x~4 77), 156142#true, 156143#false, 156146#(<= ULTIMATE.start_main_~x~4 2), 156147#(<= ULTIMATE.start_main_~x~4 3), 156144#(<= ULTIMATE.start_main_~x~4 0), 156145#(<= ULTIMATE.start_main_~x~4 1), 156150#(<= ULTIMATE.start_main_~x~4 6), 156151#(<= ULTIMATE.start_main_~x~4 7), 156148#(<= ULTIMATE.start_main_~x~4 4), 156149#(<= ULTIMATE.start_main_~x~4 5), 156154#(<= ULTIMATE.start_main_~x~4 10), 156155#(<= ULTIMATE.start_main_~x~4 11), 156152#(<= ULTIMATE.start_main_~x~4 8), 156153#(<= ULTIMATE.start_main_~x~4 9), 156158#(<= ULTIMATE.start_main_~x~4 14), 156159#(<= ULTIMATE.start_main_~x~4 15), 156156#(<= ULTIMATE.start_main_~x~4 12), 156157#(<= ULTIMATE.start_main_~x~4 13)] [2018-07-23 13:42:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-07-23 13:42:38,244 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 13:42:38,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 13:42:38,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 13:42:38,245 INFO L87 Difference]: Start difference. First operand 940 states and 1018 transitions. Second operand 81 states. [2018-07-23 13:42:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:39,213 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-07-23 13:42:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 13:42:39,213 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 939 [2018-07-23 13:42:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:39,215 INFO L225 Difference]: With dead ends: 965 [2018-07-23 13:42:39,215 INFO L226 Difference]: Without dead ends: 963 [2018-07-23 13:42:39,216 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 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:42:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-07-23 13:42:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2018-07-23 13:42:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-07-23 13:42:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1031 transitions. [2018-07-23 13:42:40,108 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1031 transitions. Word has length 939 [2018-07-23 13:42:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:40,108 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1031 transitions. [2018-07-23 13:42:40,109 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 13:42:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1031 transitions. [2018-07-23 13:42:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-07-23 13:42:40,114 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:40,114 INFO L357 BasicCegarLoop]: trace histogram [790, 79, 79, 1, 1, 1] [2018-07-23 13:42:40,114 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1007890983, now seen corresponding path program 88 times [2018-07-23 13:42:40,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-07-23 13:42:40,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:40,902 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 13:42:40,902 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:40,903 INFO L185 omatonBuilderFactory]: Interpolants [160130#(<= ULTIMATE.start_main_~x~4 71), 160131#(<= ULTIMATE.start_main_~x~4 72), 160128#(<= ULTIMATE.start_main_~x~4 69), 160129#(<= ULTIMATE.start_main_~x~4 70), 160134#(<= ULTIMATE.start_main_~x~4 75), 160135#(<= ULTIMATE.start_main_~x~4 76), 160132#(<= ULTIMATE.start_main_~x~4 73), 160133#(<= ULTIMATE.start_main_~x~4 74), 160138#(<= ULTIMATE.start_main_~x~4 79), 160136#(<= ULTIMATE.start_main_~x~4 77), 160137#(<= ULTIMATE.start_main_~x~4 78), 160058#false, 160059#(<= ULTIMATE.start_main_~x~4 0), 160057#true, 160062#(<= ULTIMATE.start_main_~x~4 3), 160063#(<= ULTIMATE.start_main_~x~4 4), 160060#(<= ULTIMATE.start_main_~x~4 1), 160061#(<= ULTIMATE.start_main_~x~4 2), 160066#(<= ULTIMATE.start_main_~x~4 7), 160067#(<= ULTIMATE.start_main_~x~4 8), 160064#(<= ULTIMATE.start_main_~x~4 5), 160065#(<= ULTIMATE.start_main_~x~4 6), 160070#(<= ULTIMATE.start_main_~x~4 11), 160071#(<= ULTIMATE.start_main_~x~4 12), 160068#(<= ULTIMATE.start_main_~x~4 9), 160069#(<= ULTIMATE.start_main_~x~4 10), 160074#(<= ULTIMATE.start_main_~x~4 15), 160075#(<= ULTIMATE.start_main_~x~4 16), 160072#(<= ULTIMATE.start_main_~x~4 13), 160073#(<= ULTIMATE.start_main_~x~4 14), 160078#(<= ULTIMATE.start_main_~x~4 19), 160079#(<= ULTIMATE.start_main_~x~4 20), 160076#(<= ULTIMATE.start_main_~x~4 17), 160077#(<= ULTIMATE.start_main_~x~4 18), 160082#(<= ULTIMATE.start_main_~x~4 23), 160083#(<= ULTIMATE.start_main_~x~4 24), 160080#(<= ULTIMATE.start_main_~x~4 21), 160081#(<= ULTIMATE.start_main_~x~4 22), 160086#(<= ULTIMATE.start_main_~x~4 27), 160087#(<= ULTIMATE.start_main_~x~4 28), 160084#(<= ULTIMATE.start_main_~x~4 25), 160085#(<= ULTIMATE.start_main_~x~4 26), 160090#(<= ULTIMATE.start_main_~x~4 31), 160091#(<= ULTIMATE.start_main_~x~4 32), 160088#(<= ULTIMATE.start_main_~x~4 29), 160089#(<= ULTIMATE.start_main_~x~4 30), 160094#(<= ULTIMATE.start_main_~x~4 35), 160095#(<= ULTIMATE.start_main_~x~4 36), 160092#(<= ULTIMATE.start_main_~x~4 33), 160093#(<= ULTIMATE.start_main_~x~4 34), 160098#(<= ULTIMATE.start_main_~x~4 39), 160099#(<= ULTIMATE.start_main_~x~4 40), 160096#(<= ULTIMATE.start_main_~x~4 37), 160097#(<= ULTIMATE.start_main_~x~4 38), 160102#(<= ULTIMATE.start_main_~x~4 43), 160103#(<= ULTIMATE.start_main_~x~4 44), 160100#(<= ULTIMATE.start_main_~x~4 41), 160101#(<= ULTIMATE.start_main_~x~4 42), 160106#(<= ULTIMATE.start_main_~x~4 47), 160107#(<= ULTIMATE.start_main_~x~4 48), 160104#(<= ULTIMATE.start_main_~x~4 45), 160105#(<= ULTIMATE.start_main_~x~4 46), 160110#(<= ULTIMATE.start_main_~x~4 51), 160111#(<= ULTIMATE.start_main_~x~4 52), 160108#(<= ULTIMATE.start_main_~x~4 49), 160109#(<= ULTIMATE.start_main_~x~4 50), 160114#(<= ULTIMATE.start_main_~x~4 55), 160115#(<= ULTIMATE.start_main_~x~4 56), 160112#(<= ULTIMATE.start_main_~x~4 53), 160113#(<= ULTIMATE.start_main_~x~4 54), 160118#(<= ULTIMATE.start_main_~x~4 59), 160119#(<= ULTIMATE.start_main_~x~4 60), 160116#(<= ULTIMATE.start_main_~x~4 57), 160117#(<= ULTIMATE.start_main_~x~4 58), 160122#(<= ULTIMATE.start_main_~x~4 63), 160123#(<= ULTIMATE.start_main_~x~4 64), 160120#(<= ULTIMATE.start_main_~x~4 61), 160121#(<= ULTIMATE.start_main_~x~4 62), 160126#(<= ULTIMATE.start_main_~x~4 67), 160127#(<= ULTIMATE.start_main_~x~4 68), 160124#(<= ULTIMATE.start_main_~x~4 65), 160125#(<= ULTIMATE.start_main_~x~4 66)] [2018-07-23 13:42:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-07-23 13:42:40,914 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 13:42:40,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 13:42:40,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 13:42:40,915 INFO L87 Difference]: Start difference. First operand 952 states and 1031 transitions. Second operand 82 states. [2018-07-23 13:42:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:41,846 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-07-23 13:42:41,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 13:42:41,846 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 951 [2018-07-23 13:42:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:41,849 INFO L225 Difference]: With dead ends: 977 [2018-07-23 13:42:41,849 INFO L226 Difference]: Without dead ends: 975 [2018-07-23 13:42:41,850 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 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:42:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-07-23 13:42:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 964. [2018-07-23 13:42:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-07-23 13:42:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1044 transitions. [2018-07-23 13:42:42,831 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1044 transitions. Word has length 951 [2018-07-23 13:42:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:42,831 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1044 transitions. [2018-07-23 13:42:42,831 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 13:42:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1044 transitions. [2018-07-23 13:42:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-07-23 13:42:42,837 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:42,837 INFO L357 BasicCegarLoop]: trace histogram [800, 80, 80, 1, 1, 1] [2018-07-23 13:42:42,837 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash 759239715, now seen corresponding path program 89 times [2018-07-23 13:42:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-07-23 13:42:43,640 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:43,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 13:42:43,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:43,641 INFO L185 omatonBuilderFactory]: Interpolants [164098#(<= ULTIMATE.start_main_~x~4 75), 164099#(<= ULTIMATE.start_main_~x~4 76), 164096#(<= ULTIMATE.start_main_~x~4 73), 164097#(<= ULTIMATE.start_main_~x~4 74), 164102#(<= ULTIMATE.start_main_~x~4 79), 164103#(<= ULTIMATE.start_main_~x~4 80), 164100#(<= ULTIMATE.start_main_~x~4 77), 164101#(<= ULTIMATE.start_main_~x~4 78), 164022#false, 164023#(<= ULTIMATE.start_main_~x~4 0), 164021#true, 164026#(<= ULTIMATE.start_main_~x~4 3), 164027#(<= ULTIMATE.start_main_~x~4 4), 164024#(<= ULTIMATE.start_main_~x~4 1), 164025#(<= ULTIMATE.start_main_~x~4 2), 164030#(<= ULTIMATE.start_main_~x~4 7), 164031#(<= ULTIMATE.start_main_~x~4 8), 164028#(<= ULTIMATE.start_main_~x~4 5), 164029#(<= ULTIMATE.start_main_~x~4 6), 164034#(<= ULTIMATE.start_main_~x~4 11), 164035#(<= ULTIMATE.start_main_~x~4 12), 164032#(<= ULTIMATE.start_main_~x~4 9), 164033#(<= ULTIMATE.start_main_~x~4 10), 164038#(<= ULTIMATE.start_main_~x~4 15), 164039#(<= ULTIMATE.start_main_~x~4 16), 164036#(<= ULTIMATE.start_main_~x~4 13), 164037#(<= ULTIMATE.start_main_~x~4 14), 164042#(<= ULTIMATE.start_main_~x~4 19), 164043#(<= ULTIMATE.start_main_~x~4 20), 164040#(<= ULTIMATE.start_main_~x~4 17), 164041#(<= ULTIMATE.start_main_~x~4 18), 164046#(<= ULTIMATE.start_main_~x~4 23), 164047#(<= ULTIMATE.start_main_~x~4 24), 164044#(<= ULTIMATE.start_main_~x~4 21), 164045#(<= ULTIMATE.start_main_~x~4 22), 164050#(<= ULTIMATE.start_main_~x~4 27), 164051#(<= ULTIMATE.start_main_~x~4 28), 164048#(<= ULTIMATE.start_main_~x~4 25), 164049#(<= ULTIMATE.start_main_~x~4 26), 164054#(<= ULTIMATE.start_main_~x~4 31), 164055#(<= ULTIMATE.start_main_~x~4 32), 164052#(<= ULTIMATE.start_main_~x~4 29), 164053#(<= ULTIMATE.start_main_~x~4 30), 164058#(<= ULTIMATE.start_main_~x~4 35), 164059#(<= ULTIMATE.start_main_~x~4 36), 164056#(<= ULTIMATE.start_main_~x~4 33), 164057#(<= ULTIMATE.start_main_~x~4 34), 164062#(<= ULTIMATE.start_main_~x~4 39), 164063#(<= ULTIMATE.start_main_~x~4 40), 164060#(<= ULTIMATE.start_main_~x~4 37), 164061#(<= ULTIMATE.start_main_~x~4 38), 164066#(<= ULTIMATE.start_main_~x~4 43), 164067#(<= ULTIMATE.start_main_~x~4 44), 164064#(<= ULTIMATE.start_main_~x~4 41), 164065#(<= ULTIMATE.start_main_~x~4 42), 164070#(<= ULTIMATE.start_main_~x~4 47), 164071#(<= ULTIMATE.start_main_~x~4 48), 164068#(<= ULTIMATE.start_main_~x~4 45), 164069#(<= ULTIMATE.start_main_~x~4 46), 164074#(<= ULTIMATE.start_main_~x~4 51), 164075#(<= ULTIMATE.start_main_~x~4 52), 164072#(<= ULTIMATE.start_main_~x~4 49), 164073#(<= ULTIMATE.start_main_~x~4 50), 164078#(<= ULTIMATE.start_main_~x~4 55), 164079#(<= ULTIMATE.start_main_~x~4 56), 164076#(<= ULTIMATE.start_main_~x~4 53), 164077#(<= ULTIMATE.start_main_~x~4 54), 164082#(<= ULTIMATE.start_main_~x~4 59), 164083#(<= ULTIMATE.start_main_~x~4 60), 164080#(<= ULTIMATE.start_main_~x~4 57), 164081#(<= ULTIMATE.start_main_~x~4 58), 164086#(<= ULTIMATE.start_main_~x~4 63), 164087#(<= ULTIMATE.start_main_~x~4 64), 164084#(<= ULTIMATE.start_main_~x~4 61), 164085#(<= ULTIMATE.start_main_~x~4 62), 164090#(<= ULTIMATE.start_main_~x~4 67), 164091#(<= ULTIMATE.start_main_~x~4 68), 164088#(<= ULTIMATE.start_main_~x~4 65), 164089#(<= ULTIMATE.start_main_~x~4 66), 164094#(<= ULTIMATE.start_main_~x~4 71), 164095#(<= ULTIMATE.start_main_~x~4 72), 164092#(<= ULTIMATE.start_main_~x~4 69), 164093#(<= ULTIMATE.start_main_~x~4 70)] [2018-07-23 13:42:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-07-23 13:42:43,653 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 13:42:43,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 13:42:43,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 13:42:43,654 INFO L87 Difference]: Start difference. First operand 964 states and 1044 transitions. Second operand 83 states. [2018-07-23 13:42:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:44,641 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-07-23 13:42:44,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 13:42:44,641 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 963 [2018-07-23 13:42:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:44,644 INFO L225 Difference]: With dead ends: 989 [2018-07-23 13:42:44,644 INFO L226 Difference]: Without dead ends: 987 [2018-07-23 13:42:44,645 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 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:42:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-07-23 13:42:45,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 976. [2018-07-23 13:42:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-07-23 13:42:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1057 transitions. [2018-07-23 13:42:45,600 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1057 transitions. Word has length 963 [2018-07-23 13:42:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:45,601 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1057 transitions. [2018-07-23 13:42:45,601 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 13:42:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1057 transitions. [2018-07-23 13:42:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-07-23 13:42:45,606 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:45,607 INFO L357 BasicCegarLoop]: trace histogram [810, 81, 81, 1, 1, 1] [2018-07-23 13:42:45,607 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash -29607059, now seen corresponding path program 90 times [2018-07-23 13:42:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-07-23 13:42:46,488 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:46,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 13:42:46,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:46,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:42:46,489 INFO L185 omatonBuilderFactory]: Interpolants [168066#(<= ULTIMATE.start_main_~x~4 30), 168067#(<= ULTIMATE.start_main_~x~4 31), 168064#(<= ULTIMATE.start_main_~x~4 28), 168065#(<= ULTIMATE.start_main_~x~4 29), 168070#(<= ULTIMATE.start_main_~x~4 34), 168071#(<= ULTIMATE.start_main_~x~4 35), 168068#(<= ULTIMATE.start_main_~x~4 32), 168069#(<= ULTIMATE.start_main_~x~4 33), 168074#(<= ULTIMATE.start_main_~x~4 38), 168075#(<= ULTIMATE.start_main_~x~4 39), 168072#(<= ULTIMATE.start_main_~x~4 36), 168073#(<= ULTIMATE.start_main_~x~4 37), 168078#(<= ULTIMATE.start_main_~x~4 42), 168079#(<= ULTIMATE.start_main_~x~4 43), 168076#(<= ULTIMATE.start_main_~x~4 40), 168077#(<= ULTIMATE.start_main_~x~4 41), 168082#(<= ULTIMATE.start_main_~x~4 46), 168083#(<= ULTIMATE.start_main_~x~4 47), 168080#(<= ULTIMATE.start_main_~x~4 44), 168081#(<= ULTIMATE.start_main_~x~4 45), 168086#(<= ULTIMATE.start_main_~x~4 50), 168087#(<= ULTIMATE.start_main_~x~4 51), 168084#(<= ULTIMATE.start_main_~x~4 48), 168085#(<= ULTIMATE.start_main_~x~4 49), 168090#(<= ULTIMATE.start_main_~x~4 54), 168091#(<= ULTIMATE.start_main_~x~4 55), 168088#(<= ULTIMATE.start_main_~x~4 52), 168089#(<= ULTIMATE.start_main_~x~4 53), 168094#(<= ULTIMATE.start_main_~x~4 58), 168095#(<= ULTIMATE.start_main_~x~4 59), 168092#(<= ULTIMATE.start_main_~x~4 56), 168093#(<= ULTIMATE.start_main_~x~4 57), 168098#(<= ULTIMATE.start_main_~x~4 62), 168099#(<= ULTIMATE.start_main_~x~4 63), 168096#(<= ULTIMATE.start_main_~x~4 60), 168097#(<= ULTIMATE.start_main_~x~4 61), 168102#(<= ULTIMATE.start_main_~x~4 66), 168103#(<= ULTIMATE.start_main_~x~4 67), 168100#(<= ULTIMATE.start_main_~x~4 64), 168101#(<= ULTIMATE.start_main_~x~4 65), 168106#(<= ULTIMATE.start_main_~x~4 70), 168107#(<= ULTIMATE.start_main_~x~4 71), 168104#(<= ULTIMATE.start_main_~x~4 68), 168105#(<= ULTIMATE.start_main_~x~4 69), 168110#(<= ULTIMATE.start_main_~x~4 74), 168111#(<= ULTIMATE.start_main_~x~4 75), 168108#(<= ULTIMATE.start_main_~x~4 72), 168109#(<= ULTIMATE.start_main_~x~4 73), 168114#(<= ULTIMATE.start_main_~x~4 78), 168115#(<= ULTIMATE.start_main_~x~4 79), 168112#(<= ULTIMATE.start_main_~x~4 76), 168113#(<= ULTIMATE.start_main_~x~4 77), 168116#(<= ULTIMATE.start_main_~x~4 80), 168117#(<= ULTIMATE.start_main_~x~4 81), 168034#true, 168035#false, 168038#(<= ULTIMATE.start_main_~x~4 2), 168039#(<= ULTIMATE.start_main_~x~4 3), 168036#(<= ULTIMATE.start_main_~x~4 0), 168037#(<= ULTIMATE.start_main_~x~4 1), 168042#(<= ULTIMATE.start_main_~x~4 6), 168043#(<= ULTIMATE.start_main_~x~4 7), 168040#(<= ULTIMATE.start_main_~x~4 4), 168041#(<= ULTIMATE.start_main_~x~4 5), 168046#(<= ULTIMATE.start_main_~x~4 10), 168047#(<= ULTIMATE.start_main_~x~4 11), 168044#(<= ULTIMATE.start_main_~x~4 8), 168045#(<= ULTIMATE.start_main_~x~4 9), 168050#(<= ULTIMATE.start_main_~x~4 14), 168051#(<= ULTIMATE.start_main_~x~4 15), 168048#(<= ULTIMATE.start_main_~x~4 12), 168049#(<= ULTIMATE.start_main_~x~4 13), 168054#(<= ULTIMATE.start_main_~x~4 18), 168055#(<= ULTIMATE.start_main_~x~4 19), 168052#(<= ULTIMATE.start_main_~x~4 16), 168053#(<= ULTIMATE.start_main_~x~4 17), 168058#(<= ULTIMATE.start_main_~x~4 22), 168059#(<= ULTIMATE.start_main_~x~4 23), 168056#(<= ULTIMATE.start_main_~x~4 20), 168057#(<= ULTIMATE.start_main_~x~4 21), 168062#(<= ULTIMATE.start_main_~x~4 26), 168063#(<= ULTIMATE.start_main_~x~4 27), 168060#(<= ULTIMATE.start_main_~x~4 24), 168061#(<= ULTIMATE.start_main_~x~4 25)] [2018-07-23 13:42:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-07-23 13:42:46,502 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 13:42:46,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 13:42:46,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 13:42:46,503 INFO L87 Difference]: Start difference. First operand 976 states and 1057 transitions. Second operand 84 states. [2018-07-23 13:42:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:47,472 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-07-23 13:42:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 13:42:47,473 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 975 [2018-07-23 13:42:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:47,474 INFO L225 Difference]: With dead ends: 1001 [2018-07-23 13:42:47,474 INFO L226 Difference]: Without dead ends: 999 [2018-07-23 13:42:47,475 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 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:42:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-07-23 13:42:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 988. [2018-07-23 13:42:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-07-23 13:42:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1070 transitions. [2018-07-23 13:42:48,367 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1070 transitions. Word has length 975 [2018-07-23 13:42:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:48,368 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1070 transitions. [2018-07-23 13:42:48,368 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 13:42:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1070 transitions. [2018-07-23 13:42:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-07-23 13:42:48,373 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:48,374 INFO L357 BasicCegarLoop]: trace histogram [820, 82, 82, 1, 1, 1] [2018-07-23 13:42:48,374 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash 378848183, now seen corresponding path program 91 times [2018-07-23 13:42:48,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-07-23 13:42:49,255 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:49,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 13:42:49,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:49,257 INFO L185 omatonBuilderFactory]: Interpolants [172162#(<= ULTIMATE.start_main_~x~4 64), 172163#(<= ULTIMATE.start_main_~x~4 65), 172160#(<= ULTIMATE.start_main_~x~4 62), 172161#(<= ULTIMATE.start_main_~x~4 63), 172166#(<= ULTIMATE.start_main_~x~4 68), 172167#(<= ULTIMATE.start_main_~x~4 69), 172164#(<= ULTIMATE.start_main_~x~4 66), 172165#(<= ULTIMATE.start_main_~x~4 67), 172170#(<= ULTIMATE.start_main_~x~4 72), 172171#(<= ULTIMATE.start_main_~x~4 73), 172168#(<= ULTIMATE.start_main_~x~4 70), 172169#(<= ULTIMATE.start_main_~x~4 71), 172174#(<= ULTIMATE.start_main_~x~4 76), 172175#(<= ULTIMATE.start_main_~x~4 77), 172172#(<= ULTIMATE.start_main_~x~4 74), 172173#(<= ULTIMATE.start_main_~x~4 75), 172178#(<= ULTIMATE.start_main_~x~4 80), 172179#(<= ULTIMATE.start_main_~x~4 81), 172176#(<= ULTIMATE.start_main_~x~4 78), 172177#(<= ULTIMATE.start_main_~x~4 79), 172180#(<= ULTIMATE.start_main_~x~4 82), 172098#(<= ULTIMATE.start_main_~x~4 0), 172099#(<= ULTIMATE.start_main_~x~4 1), 172096#true, 172097#false, 172102#(<= ULTIMATE.start_main_~x~4 4), 172103#(<= ULTIMATE.start_main_~x~4 5), 172100#(<= ULTIMATE.start_main_~x~4 2), 172101#(<= ULTIMATE.start_main_~x~4 3), 172106#(<= ULTIMATE.start_main_~x~4 8), 172107#(<= ULTIMATE.start_main_~x~4 9), 172104#(<= ULTIMATE.start_main_~x~4 6), 172105#(<= ULTIMATE.start_main_~x~4 7), 172110#(<= ULTIMATE.start_main_~x~4 12), 172111#(<= ULTIMATE.start_main_~x~4 13), 172108#(<= ULTIMATE.start_main_~x~4 10), 172109#(<= ULTIMATE.start_main_~x~4 11), 172114#(<= ULTIMATE.start_main_~x~4 16), 172115#(<= ULTIMATE.start_main_~x~4 17), 172112#(<= ULTIMATE.start_main_~x~4 14), 172113#(<= ULTIMATE.start_main_~x~4 15), 172118#(<= ULTIMATE.start_main_~x~4 20), 172119#(<= ULTIMATE.start_main_~x~4 21), 172116#(<= ULTIMATE.start_main_~x~4 18), 172117#(<= ULTIMATE.start_main_~x~4 19), 172122#(<= ULTIMATE.start_main_~x~4 24), 172123#(<= ULTIMATE.start_main_~x~4 25), 172120#(<= ULTIMATE.start_main_~x~4 22), 172121#(<= ULTIMATE.start_main_~x~4 23), 172126#(<= ULTIMATE.start_main_~x~4 28), 172127#(<= ULTIMATE.start_main_~x~4 29), 172124#(<= ULTIMATE.start_main_~x~4 26), 172125#(<= ULTIMATE.start_main_~x~4 27), 172130#(<= ULTIMATE.start_main_~x~4 32), 172131#(<= ULTIMATE.start_main_~x~4 33), 172128#(<= ULTIMATE.start_main_~x~4 30), 172129#(<= ULTIMATE.start_main_~x~4 31), 172134#(<= ULTIMATE.start_main_~x~4 36), 172135#(<= ULTIMATE.start_main_~x~4 37), 172132#(<= ULTIMATE.start_main_~x~4 34), 172133#(<= ULTIMATE.start_main_~x~4 35), 172138#(<= ULTIMATE.start_main_~x~4 40), 172139#(<= ULTIMATE.start_main_~x~4 41), 172136#(<= ULTIMATE.start_main_~x~4 38), 172137#(<= ULTIMATE.start_main_~x~4 39), 172142#(<= ULTIMATE.start_main_~x~4 44), 172143#(<= ULTIMATE.start_main_~x~4 45), 172140#(<= ULTIMATE.start_main_~x~4 42), 172141#(<= ULTIMATE.start_main_~x~4 43), 172146#(<= ULTIMATE.start_main_~x~4 48), 172147#(<= ULTIMATE.start_main_~x~4 49), 172144#(<= ULTIMATE.start_main_~x~4 46), 172145#(<= ULTIMATE.start_main_~x~4 47), 172150#(<= ULTIMATE.start_main_~x~4 52), 172151#(<= ULTIMATE.start_main_~x~4 53), 172148#(<= ULTIMATE.start_main_~x~4 50), 172149#(<= ULTIMATE.start_main_~x~4 51), 172154#(<= ULTIMATE.start_main_~x~4 56), 172155#(<= ULTIMATE.start_main_~x~4 57), 172152#(<= ULTIMATE.start_main_~x~4 54), 172153#(<= ULTIMATE.start_main_~x~4 55), 172158#(<= ULTIMATE.start_main_~x~4 60), 172159#(<= ULTIMATE.start_main_~x~4 61), 172156#(<= ULTIMATE.start_main_~x~4 58), 172157#(<= ULTIMATE.start_main_~x~4 59)] [2018-07-23 13:42:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-07-23 13:42:49,272 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 13:42:49,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 13:42:49,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 13:42:49,273 INFO L87 Difference]: Start difference. First operand 988 states and 1070 transitions. Second operand 85 states. [2018-07-23 13:42:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:50,269 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-07-23 13:42:50,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 13:42:50,269 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 987 [2018-07-23 13:42:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:50,270 INFO L225 Difference]: With dead ends: 1013 [2018-07-23 13:42:50,270 INFO L226 Difference]: Without dead ends: 1011 [2018-07-23 13:42:50,271 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 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:42:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-07-23 13:42:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1000. [2018-07-23 13:42:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-07-23 13:42:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1083 transitions. [2018-07-23 13:42:51,196 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1083 transitions. Word has length 987 [2018-07-23 13:42:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:51,196 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1083 transitions. [2018-07-23 13:42:51,196 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 13:42:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1083 transitions. [2018-07-23 13:42:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-07-23 13:42:51,202 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:51,202 INFO L357 BasicCegarLoop]: trace histogram [830, 83, 83, 1, 1, 1] [2018-07-23 13:42:51,203 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash -129946367, now seen corresponding path program 92 times [2018-07-23 13:42:51,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:52,091 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-07-23 13:42:52,091 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:52,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 13:42:52,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:52,092 INFO L185 omatonBuilderFactory]: Interpolants [176258#(<= ULTIMATE.start_main_~x~4 49), 176259#(<= ULTIMATE.start_main_~x~4 50), 176256#(<= ULTIMATE.start_main_~x~4 47), 176257#(<= ULTIMATE.start_main_~x~4 48), 176262#(<= ULTIMATE.start_main_~x~4 53), 176263#(<= ULTIMATE.start_main_~x~4 54), 176260#(<= ULTIMATE.start_main_~x~4 51), 176261#(<= ULTIMATE.start_main_~x~4 52), 176266#(<= ULTIMATE.start_main_~x~4 57), 176267#(<= ULTIMATE.start_main_~x~4 58), 176264#(<= ULTIMATE.start_main_~x~4 55), 176265#(<= ULTIMATE.start_main_~x~4 56), 176270#(<= ULTIMATE.start_main_~x~4 61), 176271#(<= ULTIMATE.start_main_~x~4 62), 176268#(<= ULTIMATE.start_main_~x~4 59), 176269#(<= ULTIMATE.start_main_~x~4 60), 176274#(<= ULTIMATE.start_main_~x~4 65), 176275#(<= ULTIMATE.start_main_~x~4 66), 176272#(<= ULTIMATE.start_main_~x~4 63), 176273#(<= ULTIMATE.start_main_~x~4 64), 176278#(<= ULTIMATE.start_main_~x~4 69), 176279#(<= ULTIMATE.start_main_~x~4 70), 176276#(<= ULTIMATE.start_main_~x~4 67), 176277#(<= ULTIMATE.start_main_~x~4 68), 176282#(<= ULTIMATE.start_main_~x~4 73), 176283#(<= ULTIMATE.start_main_~x~4 74), 176280#(<= ULTIMATE.start_main_~x~4 71), 176281#(<= ULTIMATE.start_main_~x~4 72), 176286#(<= ULTIMATE.start_main_~x~4 77), 176287#(<= ULTIMATE.start_main_~x~4 78), 176284#(<= ULTIMATE.start_main_~x~4 75), 176285#(<= ULTIMATE.start_main_~x~4 76), 176290#(<= ULTIMATE.start_main_~x~4 81), 176291#(<= ULTIMATE.start_main_~x~4 82), 176288#(<= ULTIMATE.start_main_~x~4 79), 176289#(<= ULTIMATE.start_main_~x~4 80), 176292#(<= ULTIMATE.start_main_~x~4 83), 176207#true, 176210#(<= ULTIMATE.start_main_~x~4 1), 176211#(<= ULTIMATE.start_main_~x~4 2), 176208#false, 176209#(<= ULTIMATE.start_main_~x~4 0), 176214#(<= ULTIMATE.start_main_~x~4 5), 176215#(<= ULTIMATE.start_main_~x~4 6), 176212#(<= ULTIMATE.start_main_~x~4 3), 176213#(<= ULTIMATE.start_main_~x~4 4), 176218#(<= ULTIMATE.start_main_~x~4 9), 176219#(<= ULTIMATE.start_main_~x~4 10), 176216#(<= ULTIMATE.start_main_~x~4 7), 176217#(<= ULTIMATE.start_main_~x~4 8), 176222#(<= ULTIMATE.start_main_~x~4 13), 176223#(<= ULTIMATE.start_main_~x~4 14), 176220#(<= ULTIMATE.start_main_~x~4 11), 176221#(<= ULTIMATE.start_main_~x~4 12), 176226#(<= ULTIMATE.start_main_~x~4 17), 176227#(<= ULTIMATE.start_main_~x~4 18), 176224#(<= ULTIMATE.start_main_~x~4 15), 176225#(<= ULTIMATE.start_main_~x~4 16), 176230#(<= ULTIMATE.start_main_~x~4 21), 176231#(<= ULTIMATE.start_main_~x~4 22), 176228#(<= ULTIMATE.start_main_~x~4 19), 176229#(<= ULTIMATE.start_main_~x~4 20), 176234#(<= ULTIMATE.start_main_~x~4 25), 176235#(<= ULTIMATE.start_main_~x~4 26), 176232#(<= ULTIMATE.start_main_~x~4 23), 176233#(<= ULTIMATE.start_main_~x~4 24), 176238#(<= ULTIMATE.start_main_~x~4 29), 176239#(<= ULTIMATE.start_main_~x~4 30), 176236#(<= ULTIMATE.start_main_~x~4 27), 176237#(<= ULTIMATE.start_main_~x~4 28), 176242#(<= ULTIMATE.start_main_~x~4 33), 176243#(<= ULTIMATE.start_main_~x~4 34), 176240#(<= ULTIMATE.start_main_~x~4 31), 176241#(<= ULTIMATE.start_main_~x~4 32), 176246#(<= ULTIMATE.start_main_~x~4 37), 176247#(<= ULTIMATE.start_main_~x~4 38), 176244#(<= ULTIMATE.start_main_~x~4 35), 176245#(<= ULTIMATE.start_main_~x~4 36), 176250#(<= ULTIMATE.start_main_~x~4 41), 176251#(<= ULTIMATE.start_main_~x~4 42), 176248#(<= ULTIMATE.start_main_~x~4 39), 176249#(<= ULTIMATE.start_main_~x~4 40), 176254#(<= ULTIMATE.start_main_~x~4 45), 176255#(<= ULTIMATE.start_main_~x~4 46), 176252#(<= ULTIMATE.start_main_~x~4 43), 176253#(<= ULTIMATE.start_main_~x~4 44)] [2018-07-23 13:42:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-07-23 13:42:52,105 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 13:42:52,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 13:42:52,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 13:42:52,106 INFO L87 Difference]: Start difference. First operand 1000 states and 1083 transitions. Second operand 86 states. [2018-07-23 13:42:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:53,122 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-07-23 13:42:53,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 13:42:53,122 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 999 [2018-07-23 13:42:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:53,124 INFO L225 Difference]: With dead ends: 1025 [2018-07-23 13:42:53,124 INFO L226 Difference]: Without dead ends: 1023 [2018-07-23 13:42:53,125 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 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:42:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-07-23 13:42:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1012. [2018-07-23 13:42:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-07-23 13:42:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1096 transitions. [2018-07-23 13:42:54,912 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1096 transitions. Word has length 999 [2018-07-23 13:42:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:54,912 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1096 transitions. [2018-07-23 13:42:54,912 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 13:42:54,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1096 transitions. [2018-07-23 13:42:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-07-23 13:42:54,922 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:54,923 INFO L357 BasicCegarLoop]: trace histogram [840, 84, 84, 1, 1, 1] [2018-07-23 13:42:54,923 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1735915339, now seen corresponding path program 93 times [2018-07-23 13:42:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-07-23 13:42:55,872 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:55,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 13:42:55,873 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:55,874 INFO L185 omatonBuilderFactory]: Interpolants [180367#true, 180370#(<= ULTIMATE.start_main_~x~4 1), 180371#(<= ULTIMATE.start_main_~x~4 2), 180368#false, 180369#(<= ULTIMATE.start_main_~x~4 0), 180374#(<= ULTIMATE.start_main_~x~4 5), 180375#(<= ULTIMATE.start_main_~x~4 6), 180372#(<= ULTIMATE.start_main_~x~4 3), 180373#(<= ULTIMATE.start_main_~x~4 4), 180378#(<= ULTIMATE.start_main_~x~4 9), 180379#(<= ULTIMATE.start_main_~x~4 10), 180376#(<= ULTIMATE.start_main_~x~4 7), 180377#(<= ULTIMATE.start_main_~x~4 8), 180382#(<= ULTIMATE.start_main_~x~4 13), 180383#(<= ULTIMATE.start_main_~x~4 14), 180380#(<= ULTIMATE.start_main_~x~4 11), 180381#(<= ULTIMATE.start_main_~x~4 12), 180386#(<= ULTIMATE.start_main_~x~4 17), 180387#(<= ULTIMATE.start_main_~x~4 18), 180384#(<= ULTIMATE.start_main_~x~4 15), 180385#(<= ULTIMATE.start_main_~x~4 16), 180390#(<= ULTIMATE.start_main_~x~4 21), 180391#(<= ULTIMATE.start_main_~x~4 22), 180388#(<= ULTIMATE.start_main_~x~4 19), 180389#(<= ULTIMATE.start_main_~x~4 20), 180394#(<= ULTIMATE.start_main_~x~4 25), 180395#(<= ULTIMATE.start_main_~x~4 26), 180392#(<= ULTIMATE.start_main_~x~4 23), 180393#(<= ULTIMATE.start_main_~x~4 24), 180398#(<= ULTIMATE.start_main_~x~4 29), 180399#(<= ULTIMATE.start_main_~x~4 30), 180396#(<= ULTIMATE.start_main_~x~4 27), 180397#(<= ULTIMATE.start_main_~x~4 28), 180402#(<= ULTIMATE.start_main_~x~4 33), 180403#(<= ULTIMATE.start_main_~x~4 34), 180400#(<= ULTIMATE.start_main_~x~4 31), 180401#(<= ULTIMATE.start_main_~x~4 32), 180406#(<= ULTIMATE.start_main_~x~4 37), 180407#(<= ULTIMATE.start_main_~x~4 38), 180404#(<= ULTIMATE.start_main_~x~4 35), 180405#(<= ULTIMATE.start_main_~x~4 36), 180410#(<= ULTIMATE.start_main_~x~4 41), 180411#(<= ULTIMATE.start_main_~x~4 42), 180408#(<= ULTIMATE.start_main_~x~4 39), 180409#(<= ULTIMATE.start_main_~x~4 40), 180414#(<= ULTIMATE.start_main_~x~4 45), 180415#(<= ULTIMATE.start_main_~x~4 46), 180412#(<= ULTIMATE.start_main_~x~4 43), 180413#(<= ULTIMATE.start_main_~x~4 44), 180418#(<= ULTIMATE.start_main_~x~4 49), 180419#(<= ULTIMATE.start_main_~x~4 50), 180416#(<= ULTIMATE.start_main_~x~4 47), 180417#(<= ULTIMATE.start_main_~x~4 48), 180422#(<= ULTIMATE.start_main_~x~4 53), 180423#(<= ULTIMATE.start_main_~x~4 54), 180420#(<= ULTIMATE.start_main_~x~4 51), 180421#(<= ULTIMATE.start_main_~x~4 52), 180426#(<= ULTIMATE.start_main_~x~4 57), 180427#(<= ULTIMATE.start_main_~x~4 58), 180424#(<= ULTIMATE.start_main_~x~4 55), 180425#(<= ULTIMATE.start_main_~x~4 56), 180430#(<= ULTIMATE.start_main_~x~4 61), 180431#(<= ULTIMATE.start_main_~x~4 62), 180428#(<= ULTIMATE.start_main_~x~4 59), 180429#(<= ULTIMATE.start_main_~x~4 60), 180434#(<= ULTIMATE.start_main_~x~4 65), 180435#(<= ULTIMATE.start_main_~x~4 66), 180432#(<= ULTIMATE.start_main_~x~4 63), 180433#(<= ULTIMATE.start_main_~x~4 64), 180438#(<= ULTIMATE.start_main_~x~4 69), 180439#(<= ULTIMATE.start_main_~x~4 70), 180436#(<= ULTIMATE.start_main_~x~4 67), 180437#(<= ULTIMATE.start_main_~x~4 68), 180442#(<= ULTIMATE.start_main_~x~4 73), 180443#(<= ULTIMATE.start_main_~x~4 74), 180440#(<= ULTIMATE.start_main_~x~4 71), 180441#(<= ULTIMATE.start_main_~x~4 72), 180446#(<= ULTIMATE.start_main_~x~4 77), 180447#(<= ULTIMATE.start_main_~x~4 78), 180444#(<= ULTIMATE.start_main_~x~4 75), 180445#(<= ULTIMATE.start_main_~x~4 76), 180450#(<= ULTIMATE.start_main_~x~4 81), 180451#(<= ULTIMATE.start_main_~x~4 82), 180448#(<= ULTIMATE.start_main_~x~4 79), 180449#(<= ULTIMATE.start_main_~x~4 80), 180452#(<= ULTIMATE.start_main_~x~4 83), 180453#(<= ULTIMATE.start_main_~x~4 84)] [2018-07-23 13:42:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-07-23 13:42:55,886 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 13:42:55,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 13:42:55,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 13:42:55,888 INFO L87 Difference]: Start difference. First operand 1012 states and 1096 transitions. Second operand 87 states. [2018-07-23 13:42:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:42:57,003 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-07-23 13:42:57,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 13:42:57,003 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1011 [2018-07-23 13:42:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:42:57,004 INFO L225 Difference]: With dead ends: 1037 [2018-07-23 13:42:57,004 INFO L226 Difference]: Without dead ends: 1035 [2018-07-23 13:42:57,005 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 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:42:57,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-07-23 13:42:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1024. [2018-07-23 13:42:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-07-23 13:42:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1109 transitions. [2018-07-23 13:42:57,982 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1109 transitions. Word has length 1011 [2018-07-23 13:42:57,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:42:57,983 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1109 transitions. [2018-07-23 13:42:57,983 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 13:42:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1109 transitions. [2018-07-23 13:42:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-07-23 13:42:57,992 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:42:57,993 INFO L357 BasicCegarLoop]: trace histogram [850, 85, 85, 1, 1, 1] [2018-07-23 13:42:57,993 INFO L414 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:42:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash 179282581, now seen corresponding path program 94 times [2018-07-23 13:42:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:42:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:42:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-07-23 13:42:58,926 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:42:58,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 13:42:58,927 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:42:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:42:58,928 INFO L185 omatonBuilderFactory]: Interpolants [184578#(<= ULTIMATE.start_main_~x~4 0), 184579#(<= ULTIMATE.start_main_~x~4 1), 184576#true, 184577#false, 184582#(<= ULTIMATE.start_main_~x~4 4), 184583#(<= ULTIMATE.start_main_~x~4 5), 184580#(<= ULTIMATE.start_main_~x~4 2), 184581#(<= ULTIMATE.start_main_~x~4 3), 184586#(<= ULTIMATE.start_main_~x~4 8), 184587#(<= ULTIMATE.start_main_~x~4 9), 184584#(<= ULTIMATE.start_main_~x~4 6), 184585#(<= ULTIMATE.start_main_~x~4 7), 184590#(<= ULTIMATE.start_main_~x~4 12), 184591#(<= ULTIMATE.start_main_~x~4 13), 184588#(<= ULTIMATE.start_main_~x~4 10), 184589#(<= ULTIMATE.start_main_~x~4 11), 184594#(<= ULTIMATE.start_main_~x~4 16), 184595#(<= ULTIMATE.start_main_~x~4 17), 184592#(<= ULTIMATE.start_main_~x~4 14), 184593#(<= ULTIMATE.start_main_~x~4 15), 184598#(<= ULTIMATE.start_main_~x~4 20), 184599#(<= ULTIMATE.start_main_~x~4 21), 184596#(<= ULTIMATE.start_main_~x~4 18), 184597#(<= ULTIMATE.start_main_~x~4 19), 184602#(<= ULTIMATE.start_main_~x~4 24), 184603#(<= ULTIMATE.start_main_~x~4 25), 184600#(<= ULTIMATE.start_main_~x~4 22), 184601#(<= ULTIMATE.start_main_~x~4 23), 184606#(<= ULTIMATE.start_main_~x~4 28), 184607#(<= ULTIMATE.start_main_~x~4 29), 184604#(<= ULTIMATE.start_main_~x~4 26), 184605#(<= ULTIMATE.start_main_~x~4 27), 184610#(<= ULTIMATE.start_main_~x~4 32), 184611#(<= ULTIMATE.start_main_~x~4 33), 184608#(<= ULTIMATE.start_main_~x~4 30), 184609#(<= ULTIMATE.start_main_~x~4 31), 184614#(<= ULTIMATE.start_main_~x~4 36), 184615#(<= ULTIMATE.start_main_~x~4 37), 184612#(<= ULTIMATE.start_main_~x~4 34), 184613#(<= ULTIMATE.start_main_~x~4 35), 184618#(<= ULTIMATE.start_main_~x~4 40), 184619#(<= ULTIMATE.start_main_~x~4 41), 184616#(<= ULTIMATE.start_main_~x~4 38), 184617#(<= ULTIMATE.start_main_~x~4 39), 184622#(<= ULTIMATE.start_main_~x~4 44), 184623#(<= ULTIMATE.start_main_~x~4 45), 184620#(<= ULTIMATE.start_main_~x~4 42), 184621#(<= ULTIMATE.start_main_~x~4 43), 184626#(<= ULTIMATE.start_main_~x~4 48), 184627#(<= ULTIMATE.start_main_~x~4 49), 184624#(<= ULTIMATE.start_main_~x~4 46), 184625#(<= ULTIMATE.start_main_~x~4 47), 184630#(<= ULTIMATE.start_main_~x~4 52), 184631#(<= ULTIMATE.start_main_~x~4 53), 184628#(<= ULTIMATE.start_main_~x~4 50), 184629#(<= ULTIMATE.start_main_~x~4 51), 184634#(<= ULTIMATE.start_main_~x~4 56), 184635#(<= ULTIMATE.start_main_~x~4 57), 184632#(<= ULTIMATE.start_main_~x~4 54), 184633#(<= ULTIMATE.start_main_~x~4 55), 184638#(<= ULTIMATE.start_main_~x~4 60), 184639#(<= ULTIMATE.start_main_~x~4 61), 184636#(<= ULTIMATE.start_main_~x~4 58), 184637#(<= ULTIMATE.start_main_~x~4 59), 184642#(<= ULTIMATE.start_main_~x~4 64), 184643#(<= ULTIMATE.start_main_~x~4 65), 184640#(<= ULTIMATE.start_main_~x~4 62), 184641#(<= ULTIMATE.start_main_~x~4 63), 184646#(<= ULTIMATE.start_main_~x~4 68), 184647#(<= ULTIMATE.start_main_~x~4 69), 184644#(<= ULTIMATE.start_main_~x~4 66), 184645#(<= ULTIMATE.start_main_~x~4 67), 184650#(<= ULTIMATE.start_main_~x~4 72), 184651#(<= ULTIMATE.start_main_~x~4 73), 184648#(<= ULTIMATE.start_main_~x~4 70), 184649#(<= ULTIMATE.start_main_~x~4 71), 184654#(<= ULTIMATE.start_main_~x~4 76), 184655#(<= ULTIMATE.start_main_~x~4 77), 184652#(<= ULTIMATE.start_main_~x~4 74), 184653#(<= ULTIMATE.start_main_~x~4 75), 184658#(<= ULTIMATE.start_main_~x~4 80), 184659#(<= ULTIMATE.start_main_~x~4 81), 184656#(<= ULTIMATE.start_main_~x~4 78), 184657#(<= ULTIMATE.start_main_~x~4 79), 184662#(<= ULTIMATE.start_main_~x~4 84), 184663#(<= ULTIMATE.start_main_~x~4 85), 184660#(<= ULTIMATE.start_main_~x~4 82), 184661#(<= ULTIMATE.start_main_~x~4 83)] [2018-07-23 13:42:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-07-23 13:42:58,941 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 13:42:58,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 13:42:58,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 13:42:58,942 INFO L87 Difference]: Start difference. First operand 1024 states and 1109 transitions. Second operand 88 states. [2018-07-23 13:43:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:00,093 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-07-23 13:43:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 13:43:00,094 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1023 [2018-07-23 13:43:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:00,095 INFO L225 Difference]: With dead ends: 1049 [2018-07-23 13:43:00,095 INFO L226 Difference]: Without dead ends: 1047 [2018-07-23 13:43:00,096 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 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:43:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-07-23 13:43:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1036. [2018-07-23 13:43:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-07-23 13:43:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1122 transitions. [2018-07-23 13:43:01,184 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1122 transitions. Word has length 1023 [2018-07-23 13:43:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:01,185 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1122 transitions. [2018-07-23 13:43:01,185 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 13:43:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1122 transitions. [2018-07-23 13:43:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-07-23 13:43:01,191 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:01,192 INFO L357 BasicCegarLoop]: trace histogram [860, 86, 86, 1, 1, 1] [2018-07-23 13:43:01,192 INFO L414 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash 178171615, now seen corresponding path program 95 times [2018-07-23 13:43:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-07-23 13:43:02,142 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:02,142 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 13:43:02,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:02,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:43:02,143 INFO L185 omatonBuilderFactory]: Interpolants [188834#true, 188835#false, 188838#(<= ULTIMATE.start_main_~x~4 2), 188839#(<= ULTIMATE.start_main_~x~4 3), 188836#(<= ULTIMATE.start_main_~x~4 0), 188837#(<= ULTIMATE.start_main_~x~4 1), 188842#(<= ULTIMATE.start_main_~x~4 6), 188843#(<= ULTIMATE.start_main_~x~4 7), 188840#(<= ULTIMATE.start_main_~x~4 4), 188841#(<= ULTIMATE.start_main_~x~4 5), 188846#(<= ULTIMATE.start_main_~x~4 10), 188847#(<= ULTIMATE.start_main_~x~4 11), 188844#(<= ULTIMATE.start_main_~x~4 8), 188845#(<= ULTIMATE.start_main_~x~4 9), 188850#(<= ULTIMATE.start_main_~x~4 14), 188851#(<= ULTIMATE.start_main_~x~4 15), 188848#(<= ULTIMATE.start_main_~x~4 12), 188849#(<= ULTIMATE.start_main_~x~4 13), 188854#(<= ULTIMATE.start_main_~x~4 18), 188855#(<= ULTIMATE.start_main_~x~4 19), 188852#(<= ULTIMATE.start_main_~x~4 16), 188853#(<= ULTIMATE.start_main_~x~4 17), 188858#(<= ULTIMATE.start_main_~x~4 22), 188859#(<= ULTIMATE.start_main_~x~4 23), 188856#(<= ULTIMATE.start_main_~x~4 20), 188857#(<= ULTIMATE.start_main_~x~4 21), 188862#(<= ULTIMATE.start_main_~x~4 26), 188863#(<= ULTIMATE.start_main_~x~4 27), 188860#(<= ULTIMATE.start_main_~x~4 24), 188861#(<= ULTIMATE.start_main_~x~4 25), 188866#(<= ULTIMATE.start_main_~x~4 30), 188867#(<= ULTIMATE.start_main_~x~4 31), 188864#(<= ULTIMATE.start_main_~x~4 28), 188865#(<= ULTIMATE.start_main_~x~4 29), 188870#(<= ULTIMATE.start_main_~x~4 34), 188871#(<= ULTIMATE.start_main_~x~4 35), 188868#(<= ULTIMATE.start_main_~x~4 32), 188869#(<= ULTIMATE.start_main_~x~4 33), 188874#(<= ULTIMATE.start_main_~x~4 38), 188875#(<= ULTIMATE.start_main_~x~4 39), 188872#(<= ULTIMATE.start_main_~x~4 36), 188873#(<= ULTIMATE.start_main_~x~4 37), 188878#(<= ULTIMATE.start_main_~x~4 42), 188879#(<= ULTIMATE.start_main_~x~4 43), 188876#(<= ULTIMATE.start_main_~x~4 40), 188877#(<= ULTIMATE.start_main_~x~4 41), 188882#(<= ULTIMATE.start_main_~x~4 46), 188883#(<= ULTIMATE.start_main_~x~4 47), 188880#(<= ULTIMATE.start_main_~x~4 44), 188881#(<= ULTIMATE.start_main_~x~4 45), 188886#(<= ULTIMATE.start_main_~x~4 50), 188887#(<= ULTIMATE.start_main_~x~4 51), 188884#(<= ULTIMATE.start_main_~x~4 48), 188885#(<= ULTIMATE.start_main_~x~4 49), 188890#(<= ULTIMATE.start_main_~x~4 54), 188891#(<= ULTIMATE.start_main_~x~4 55), 188888#(<= ULTIMATE.start_main_~x~4 52), 188889#(<= ULTIMATE.start_main_~x~4 53), 188894#(<= ULTIMATE.start_main_~x~4 58), 188895#(<= ULTIMATE.start_main_~x~4 59), 188892#(<= ULTIMATE.start_main_~x~4 56), 188893#(<= ULTIMATE.start_main_~x~4 57), 188898#(<= ULTIMATE.start_main_~x~4 62), 188899#(<= ULTIMATE.start_main_~x~4 63), 188896#(<= ULTIMATE.start_main_~x~4 60), 188897#(<= ULTIMATE.start_main_~x~4 61), 188902#(<= ULTIMATE.start_main_~x~4 66), 188903#(<= ULTIMATE.start_main_~x~4 67), 188900#(<= ULTIMATE.start_main_~x~4 64), 188901#(<= ULTIMATE.start_main_~x~4 65), 188906#(<= ULTIMATE.start_main_~x~4 70), 188907#(<= ULTIMATE.start_main_~x~4 71), 188904#(<= ULTIMATE.start_main_~x~4 68), 188905#(<= ULTIMATE.start_main_~x~4 69), 188910#(<= ULTIMATE.start_main_~x~4 74), 188911#(<= ULTIMATE.start_main_~x~4 75), 188908#(<= ULTIMATE.start_main_~x~4 72), 188909#(<= ULTIMATE.start_main_~x~4 73), 188914#(<= ULTIMATE.start_main_~x~4 78), 188915#(<= ULTIMATE.start_main_~x~4 79), 188912#(<= ULTIMATE.start_main_~x~4 76), 188913#(<= ULTIMATE.start_main_~x~4 77), 188918#(<= ULTIMATE.start_main_~x~4 82), 188919#(<= ULTIMATE.start_main_~x~4 83), 188916#(<= ULTIMATE.start_main_~x~4 80), 188917#(<= ULTIMATE.start_main_~x~4 81), 188922#(<= ULTIMATE.start_main_~x~4 86), 188920#(<= ULTIMATE.start_main_~x~4 84), 188921#(<= ULTIMATE.start_main_~x~4 85)] [2018-07-23 13:43:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-07-23 13:43:02,161 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 13:43:02,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 13:43:02,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 13:43:02,162 INFO L87 Difference]: Start difference. First operand 1036 states and 1122 transitions. Second operand 89 states. [2018-07-23 13:43:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:03,328 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-07-23 13:43:03,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 13:43:03,328 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1035 [2018-07-23 13:43:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:03,329 INFO L225 Difference]: With dead ends: 1061 [2018-07-23 13:43:03,329 INFO L226 Difference]: Without dead ends: 1059 [2018-07-23 13:43:03,330 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 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:43:03,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-07-23 13:43:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1048. [2018-07-23 13:43:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-07-23 13:43:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1135 transitions. [2018-07-23 13:43:04,384 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1135 transitions. Word has length 1035 [2018-07-23 13:43:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:04,384 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1135 transitions. [2018-07-23 13:43:04,384 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 13:43:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1135 transitions. [2018-07-23 13:43:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-07-23 13:43:04,392 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:04,392 INFO L357 BasicCegarLoop]: trace histogram [870, 87, 87, 1, 1, 1] [2018-07-23 13:43:04,392 INFO L414 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1304716247, now seen corresponding path program 96 times [2018-07-23 13:43:04,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-07-23 13:43:05,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:05,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 13:43:05,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:05,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:43:05,355 INFO L185 omatonBuilderFactory]: Interpolants [193154#(<= ULTIMATE.start_main_~x~4 11), 193155#(<= ULTIMATE.start_main_~x~4 12), 193152#(<= ULTIMATE.start_main_~x~4 9), 193153#(<= ULTIMATE.start_main_~x~4 10), 193158#(<= ULTIMATE.start_main_~x~4 15), 193159#(<= ULTIMATE.start_main_~x~4 16), 193156#(<= ULTIMATE.start_main_~x~4 13), 193157#(<= ULTIMATE.start_main_~x~4 14), 193162#(<= ULTIMATE.start_main_~x~4 19), 193163#(<= ULTIMATE.start_main_~x~4 20), 193160#(<= ULTIMATE.start_main_~x~4 17), 193161#(<= ULTIMATE.start_main_~x~4 18), 193166#(<= ULTIMATE.start_main_~x~4 23), 193167#(<= ULTIMATE.start_main_~x~4 24), 193164#(<= ULTIMATE.start_main_~x~4 21), 193165#(<= ULTIMATE.start_main_~x~4 22), 193170#(<= ULTIMATE.start_main_~x~4 27), 193171#(<= ULTIMATE.start_main_~x~4 28), 193168#(<= ULTIMATE.start_main_~x~4 25), 193169#(<= ULTIMATE.start_main_~x~4 26), 193174#(<= ULTIMATE.start_main_~x~4 31), 193175#(<= ULTIMATE.start_main_~x~4 32), 193172#(<= ULTIMATE.start_main_~x~4 29), 193173#(<= ULTIMATE.start_main_~x~4 30), 193178#(<= ULTIMATE.start_main_~x~4 35), 193179#(<= ULTIMATE.start_main_~x~4 36), 193176#(<= ULTIMATE.start_main_~x~4 33), 193177#(<= ULTIMATE.start_main_~x~4 34), 193182#(<= ULTIMATE.start_main_~x~4 39), 193183#(<= ULTIMATE.start_main_~x~4 40), 193180#(<= ULTIMATE.start_main_~x~4 37), 193181#(<= ULTIMATE.start_main_~x~4 38), 193186#(<= ULTIMATE.start_main_~x~4 43), 193187#(<= ULTIMATE.start_main_~x~4 44), 193184#(<= ULTIMATE.start_main_~x~4 41), 193185#(<= ULTIMATE.start_main_~x~4 42), 193190#(<= ULTIMATE.start_main_~x~4 47), 193191#(<= ULTIMATE.start_main_~x~4 48), 193188#(<= ULTIMATE.start_main_~x~4 45), 193189#(<= ULTIMATE.start_main_~x~4 46), 193194#(<= ULTIMATE.start_main_~x~4 51), 193195#(<= ULTIMATE.start_main_~x~4 52), 193192#(<= ULTIMATE.start_main_~x~4 49), 193193#(<= ULTIMATE.start_main_~x~4 50), 193198#(<= ULTIMATE.start_main_~x~4 55), 193199#(<= ULTIMATE.start_main_~x~4 56), 193196#(<= ULTIMATE.start_main_~x~4 53), 193197#(<= ULTIMATE.start_main_~x~4 54), 193202#(<= ULTIMATE.start_main_~x~4 59), 193203#(<= ULTIMATE.start_main_~x~4 60), 193200#(<= ULTIMATE.start_main_~x~4 57), 193201#(<= ULTIMATE.start_main_~x~4 58), 193206#(<= ULTIMATE.start_main_~x~4 63), 193207#(<= ULTIMATE.start_main_~x~4 64), 193204#(<= ULTIMATE.start_main_~x~4 61), 193205#(<= ULTIMATE.start_main_~x~4 62), 193210#(<= ULTIMATE.start_main_~x~4 67), 193211#(<= ULTIMATE.start_main_~x~4 68), 193208#(<= ULTIMATE.start_main_~x~4 65), 193209#(<= ULTIMATE.start_main_~x~4 66), 193214#(<= ULTIMATE.start_main_~x~4 71), 193215#(<= ULTIMATE.start_main_~x~4 72), 193212#(<= ULTIMATE.start_main_~x~4 69), 193213#(<= ULTIMATE.start_main_~x~4 70), 193218#(<= ULTIMATE.start_main_~x~4 75), 193219#(<= ULTIMATE.start_main_~x~4 76), 193216#(<= ULTIMATE.start_main_~x~4 73), 193217#(<= ULTIMATE.start_main_~x~4 74), 193222#(<= ULTIMATE.start_main_~x~4 79), 193223#(<= ULTIMATE.start_main_~x~4 80), 193220#(<= ULTIMATE.start_main_~x~4 77), 193221#(<= ULTIMATE.start_main_~x~4 78), 193226#(<= ULTIMATE.start_main_~x~4 83), 193227#(<= ULTIMATE.start_main_~x~4 84), 193224#(<= ULTIMATE.start_main_~x~4 81), 193225#(<= ULTIMATE.start_main_~x~4 82), 193230#(<= ULTIMATE.start_main_~x~4 87), 193228#(<= ULTIMATE.start_main_~x~4 85), 193229#(<= ULTIMATE.start_main_~x~4 86), 193142#false, 193143#(<= ULTIMATE.start_main_~x~4 0), 193141#true, 193146#(<= ULTIMATE.start_main_~x~4 3), 193147#(<= ULTIMATE.start_main_~x~4 4), 193144#(<= ULTIMATE.start_main_~x~4 1), 193145#(<= ULTIMATE.start_main_~x~4 2), 193150#(<= ULTIMATE.start_main_~x~4 7), 193151#(<= ULTIMATE.start_main_~x~4 8), 193148#(<= ULTIMATE.start_main_~x~4 5), 193149#(<= ULTIMATE.start_main_~x~4 6)] [2018-07-23 13:43:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-07-23 13:43:05,369 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 13:43:05,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 13:43:05,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 13:43:05,369 INFO L87 Difference]: Start difference. First operand 1048 states and 1135 transitions. Second operand 90 states. [2018-07-23 13:43:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:06,594 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-07-23 13:43:06,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 13:43:06,594 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1047 [2018-07-23 13:43:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:06,596 INFO L225 Difference]: With dead ends: 1073 [2018-07-23 13:43:06,596 INFO L226 Difference]: Without dead ends: 1071 [2018-07-23 13:43:06,596 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 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:43:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-07-23 13:43:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2018-07-23 13:43:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-07-23 13:43:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1148 transitions. [2018-07-23 13:43:07,700 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1148 transitions. Word has length 1047 [2018-07-23 13:43:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:07,700 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1148 transitions. [2018-07-23 13:43:07,700 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 13:43:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1148 transitions. [2018-07-23 13:43:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-07-23 13:43:07,707 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:07,708 INFO L357 BasicCegarLoop]: trace histogram [880, 88, 88, 1, 1, 1] [2018-07-23 13:43:07,708 INFO L414 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash 247261811, now seen corresponding path program 97 times [2018-07-23 13:43:07,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-07-23 13:43:08,739 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:08,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 13:43:08,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:08,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:43:08,740 INFO L185 omatonBuilderFactory]: Interpolants [197507#(<= ULTIMATE.start_main_~x~4 8), 197506#(<= ULTIMATE.start_main_~x~4 7), 197505#(<= ULTIMATE.start_main_~x~4 6), 197504#(<= ULTIMATE.start_main_~x~4 5), 197511#(<= ULTIMATE.start_main_~x~4 12), 197510#(<= ULTIMATE.start_main_~x~4 11), 197509#(<= ULTIMATE.start_main_~x~4 10), 197508#(<= ULTIMATE.start_main_~x~4 9), 197515#(<= ULTIMATE.start_main_~x~4 16), 197514#(<= ULTIMATE.start_main_~x~4 15), 197513#(<= ULTIMATE.start_main_~x~4 14), 197512#(<= ULTIMATE.start_main_~x~4 13), 197519#(<= ULTIMATE.start_main_~x~4 20), 197518#(<= ULTIMATE.start_main_~x~4 19), 197517#(<= ULTIMATE.start_main_~x~4 18), 197516#(<= ULTIMATE.start_main_~x~4 17), 197523#(<= ULTIMATE.start_main_~x~4 24), 197522#(<= ULTIMATE.start_main_~x~4 23), 197521#(<= ULTIMATE.start_main_~x~4 22), 197520#(<= ULTIMATE.start_main_~x~4 21), 197527#(<= ULTIMATE.start_main_~x~4 28), 197526#(<= ULTIMATE.start_main_~x~4 27), 197525#(<= ULTIMATE.start_main_~x~4 26), 197524#(<= ULTIMATE.start_main_~x~4 25), 197531#(<= ULTIMATE.start_main_~x~4 32), 197530#(<= ULTIMATE.start_main_~x~4 31), 197529#(<= ULTIMATE.start_main_~x~4 30), 197528#(<= ULTIMATE.start_main_~x~4 29), 197535#(<= ULTIMATE.start_main_~x~4 36), 197534#(<= ULTIMATE.start_main_~x~4 35), 197533#(<= ULTIMATE.start_main_~x~4 34), 197532#(<= ULTIMATE.start_main_~x~4 33), 197539#(<= ULTIMATE.start_main_~x~4 40), 197538#(<= ULTIMATE.start_main_~x~4 39), 197537#(<= ULTIMATE.start_main_~x~4 38), 197536#(<= ULTIMATE.start_main_~x~4 37), 197543#(<= ULTIMATE.start_main_~x~4 44), 197542#(<= ULTIMATE.start_main_~x~4 43), 197541#(<= ULTIMATE.start_main_~x~4 42), 197540#(<= ULTIMATE.start_main_~x~4 41), 197547#(<= ULTIMATE.start_main_~x~4 48), 197546#(<= ULTIMATE.start_main_~x~4 47), 197545#(<= ULTIMATE.start_main_~x~4 46), 197544#(<= ULTIMATE.start_main_~x~4 45), 197551#(<= ULTIMATE.start_main_~x~4 52), 197550#(<= ULTIMATE.start_main_~x~4 51), 197549#(<= ULTIMATE.start_main_~x~4 50), 197548#(<= ULTIMATE.start_main_~x~4 49), 197555#(<= ULTIMATE.start_main_~x~4 56), 197554#(<= ULTIMATE.start_main_~x~4 55), 197553#(<= ULTIMATE.start_main_~x~4 54), 197552#(<= ULTIMATE.start_main_~x~4 53), 197559#(<= ULTIMATE.start_main_~x~4 60), 197558#(<= ULTIMATE.start_main_~x~4 59), 197557#(<= ULTIMATE.start_main_~x~4 58), 197556#(<= ULTIMATE.start_main_~x~4 57), 197563#(<= ULTIMATE.start_main_~x~4 64), 197562#(<= ULTIMATE.start_main_~x~4 63), 197561#(<= ULTIMATE.start_main_~x~4 62), 197560#(<= ULTIMATE.start_main_~x~4 61), 197567#(<= ULTIMATE.start_main_~x~4 68), 197566#(<= ULTIMATE.start_main_~x~4 67), 197565#(<= ULTIMATE.start_main_~x~4 66), 197564#(<= ULTIMATE.start_main_~x~4 65), 197571#(<= ULTIMATE.start_main_~x~4 72), 197570#(<= ULTIMATE.start_main_~x~4 71), 197569#(<= ULTIMATE.start_main_~x~4 70), 197568#(<= ULTIMATE.start_main_~x~4 69), 197575#(<= ULTIMATE.start_main_~x~4 76), 197574#(<= ULTIMATE.start_main_~x~4 75), 197573#(<= ULTIMATE.start_main_~x~4 74), 197572#(<= ULTIMATE.start_main_~x~4 73), 197579#(<= ULTIMATE.start_main_~x~4 80), 197578#(<= ULTIMATE.start_main_~x~4 79), 197577#(<= ULTIMATE.start_main_~x~4 78), 197576#(<= ULTIMATE.start_main_~x~4 77), 197583#(<= ULTIMATE.start_main_~x~4 84), 197582#(<= ULTIMATE.start_main_~x~4 83), 197581#(<= ULTIMATE.start_main_~x~4 82), 197580#(<= ULTIMATE.start_main_~x~4 81), 197587#(<= ULTIMATE.start_main_~x~4 88), 197586#(<= ULTIMATE.start_main_~x~4 87), 197585#(<= ULTIMATE.start_main_~x~4 86), 197584#(<= ULTIMATE.start_main_~x~4 85), 197499#(<= ULTIMATE.start_main_~x~4 0), 197498#false, 197497#true, 197503#(<= ULTIMATE.start_main_~x~4 4), 197502#(<= ULTIMATE.start_main_~x~4 3), 197501#(<= ULTIMATE.start_main_~x~4 2), 197500#(<= ULTIMATE.start_main_~x~4 1)] [2018-07-23 13:43:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-07-23 13:43:08,754 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 13:43:08,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 13:43:08,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 13:43:08,755 INFO L87 Difference]: Start difference. First operand 1060 states and 1148 transitions. Second operand 91 states. [2018-07-23 13:43:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:10,021 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-07-23 13:43:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 13:43:10,021 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1059 [2018-07-23 13:43:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:10,022 INFO L225 Difference]: With dead ends: 1085 [2018-07-23 13:43:10,022 INFO L226 Difference]: Without dead ends: 1083 [2018-07-23 13:43:10,023 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 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:43:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-07-23 13:43:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1072. [2018-07-23 13:43:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-07-23 13:43:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1161 transitions. [2018-07-23 13:43:11,157 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1161 transitions. Word has length 1059 [2018-07-23 13:43:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:11,158 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1161 transitions. [2018-07-23 13:43:11,158 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 13:43:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1161 transitions. [2018-07-23 13:43:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-07-23 13:43:11,167 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:11,167 INFO L357 BasicCegarLoop]: trace histogram [890, 89, 89, 1, 1, 1] [2018-07-23 13:43:11,167 INFO L414 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:11,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1885791811, now seen corresponding path program 98 times [2018-07-23 13:43:11,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-07-23 13:43:12,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:12,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 13:43:12,153 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:12,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:43:12,154 INFO L185 omatonBuilderFactory]: Interpolants [201987#(<= ULTIMATE.start_main_~x~4 83), 201986#(<= ULTIMATE.start_main_~x~4 82), 201985#(<= ULTIMATE.start_main_~x~4 81), 201984#(<= ULTIMATE.start_main_~x~4 80), 201991#(<= ULTIMATE.start_main_~x~4 87), 201990#(<= ULTIMATE.start_main_~x~4 86), 201989#(<= ULTIMATE.start_main_~x~4 85), 201988#(<= ULTIMATE.start_main_~x~4 84), 201993#(<= ULTIMATE.start_main_~x~4 89), 201992#(<= ULTIMATE.start_main_~x~4 88), 201903#false, 201902#true, 201907#(<= ULTIMATE.start_main_~x~4 3), 201906#(<= ULTIMATE.start_main_~x~4 2), 201905#(<= ULTIMATE.start_main_~x~4 1), 201904#(<= ULTIMATE.start_main_~x~4 0), 201911#(<= ULTIMATE.start_main_~x~4 7), 201910#(<= ULTIMATE.start_main_~x~4 6), 201909#(<= ULTIMATE.start_main_~x~4 5), 201908#(<= ULTIMATE.start_main_~x~4 4), 201915#(<= ULTIMATE.start_main_~x~4 11), 201914#(<= ULTIMATE.start_main_~x~4 10), 201913#(<= ULTIMATE.start_main_~x~4 9), 201912#(<= ULTIMATE.start_main_~x~4 8), 201919#(<= ULTIMATE.start_main_~x~4 15), 201918#(<= ULTIMATE.start_main_~x~4 14), 201917#(<= ULTIMATE.start_main_~x~4 13), 201916#(<= ULTIMATE.start_main_~x~4 12), 201923#(<= ULTIMATE.start_main_~x~4 19), 201922#(<= ULTIMATE.start_main_~x~4 18), 201921#(<= ULTIMATE.start_main_~x~4 17), 201920#(<= ULTIMATE.start_main_~x~4 16), 201927#(<= ULTIMATE.start_main_~x~4 23), 201926#(<= ULTIMATE.start_main_~x~4 22), 201925#(<= ULTIMATE.start_main_~x~4 21), 201924#(<= ULTIMATE.start_main_~x~4 20), 201931#(<= ULTIMATE.start_main_~x~4 27), 201930#(<= ULTIMATE.start_main_~x~4 26), 201929#(<= ULTIMATE.start_main_~x~4 25), 201928#(<= ULTIMATE.start_main_~x~4 24), 201935#(<= ULTIMATE.start_main_~x~4 31), 201934#(<= ULTIMATE.start_main_~x~4 30), 201933#(<= ULTIMATE.start_main_~x~4 29), 201932#(<= ULTIMATE.start_main_~x~4 28), 201939#(<= ULTIMATE.start_main_~x~4 35), 201938#(<= ULTIMATE.start_main_~x~4 34), 201937#(<= ULTIMATE.start_main_~x~4 33), 201936#(<= ULTIMATE.start_main_~x~4 32), 201943#(<= ULTIMATE.start_main_~x~4 39), 201942#(<= ULTIMATE.start_main_~x~4 38), 201941#(<= ULTIMATE.start_main_~x~4 37), 201940#(<= ULTIMATE.start_main_~x~4 36), 201947#(<= ULTIMATE.start_main_~x~4 43), 201946#(<= ULTIMATE.start_main_~x~4 42), 201945#(<= ULTIMATE.start_main_~x~4 41), 201944#(<= ULTIMATE.start_main_~x~4 40), 201951#(<= ULTIMATE.start_main_~x~4 47), 201950#(<= ULTIMATE.start_main_~x~4 46), 201949#(<= ULTIMATE.start_main_~x~4 45), 201948#(<= ULTIMATE.start_main_~x~4 44), 201955#(<= ULTIMATE.start_main_~x~4 51), 201954#(<= ULTIMATE.start_main_~x~4 50), 201953#(<= ULTIMATE.start_main_~x~4 49), 201952#(<= ULTIMATE.start_main_~x~4 48), 201959#(<= ULTIMATE.start_main_~x~4 55), 201958#(<= ULTIMATE.start_main_~x~4 54), 201957#(<= ULTIMATE.start_main_~x~4 53), 201956#(<= ULTIMATE.start_main_~x~4 52), 201963#(<= ULTIMATE.start_main_~x~4 59), 201962#(<= ULTIMATE.start_main_~x~4 58), 201961#(<= ULTIMATE.start_main_~x~4 57), 201960#(<= ULTIMATE.start_main_~x~4 56), 201967#(<= ULTIMATE.start_main_~x~4 63), 201966#(<= ULTIMATE.start_main_~x~4 62), 201965#(<= ULTIMATE.start_main_~x~4 61), 201964#(<= ULTIMATE.start_main_~x~4 60), 201971#(<= ULTIMATE.start_main_~x~4 67), 201970#(<= ULTIMATE.start_main_~x~4 66), 201969#(<= ULTIMATE.start_main_~x~4 65), 201968#(<= ULTIMATE.start_main_~x~4 64), 201975#(<= ULTIMATE.start_main_~x~4 71), 201974#(<= ULTIMATE.start_main_~x~4 70), 201973#(<= ULTIMATE.start_main_~x~4 69), 201972#(<= ULTIMATE.start_main_~x~4 68), 201979#(<= ULTIMATE.start_main_~x~4 75), 201978#(<= ULTIMATE.start_main_~x~4 74), 201977#(<= ULTIMATE.start_main_~x~4 73), 201976#(<= ULTIMATE.start_main_~x~4 72), 201983#(<= ULTIMATE.start_main_~x~4 79), 201982#(<= ULTIMATE.start_main_~x~4 78), 201981#(<= ULTIMATE.start_main_~x~4 77), 201980#(<= ULTIMATE.start_main_~x~4 76)] [2018-07-23 13:43:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-07-23 13:43:12,168 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 13:43:12,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 13:43:12,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 13:43:12,169 INFO L87 Difference]: Start difference. First operand 1072 states and 1161 transitions. Second operand 92 states. [2018-07-23 13:43:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:13,421 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-07-23 13:43:13,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 13:43:13,421 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1071 [2018-07-23 13:43:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:13,423 INFO L225 Difference]: With dead ends: 1097 [2018-07-23 13:43:13,423 INFO L226 Difference]: Without dead ends: 1095 [2018-07-23 13:43:13,424 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 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:43:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-07-23 13:43:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1084. [2018-07-23 13:43:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-07-23 13:43:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1174 transitions. [2018-07-23 13:43:14,596 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1174 transitions. Word has length 1071 [2018-07-23 13:43:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:14,597 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1174 transitions. [2018-07-23 13:43:14,597 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 13:43:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1174 transitions. [2018-07-23 13:43:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-07-23 13:43:14,605 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:14,605 INFO L357 BasicCegarLoop]: trace histogram [900, 90, 90, 1, 1, 1] [2018-07-23 13:43:14,605 INFO L414 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:14,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1501124089, now seen corresponding path program 99 times [2018-07-23 13:43:14,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-07-23 13:43:15,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:15,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 13:43:15,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:15,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:43:15,638 INFO L185 omatonBuilderFactory]: Interpolants [206359#(<= ULTIMATE.start_main_~x~4 1), 206358#(<= ULTIMATE.start_main_~x~4 0), 206357#false, 206356#true, 206363#(<= ULTIMATE.start_main_~x~4 5), 206362#(<= ULTIMATE.start_main_~x~4 4), 206361#(<= ULTIMATE.start_main_~x~4 3), 206360#(<= ULTIMATE.start_main_~x~4 2), 206367#(<= ULTIMATE.start_main_~x~4 9), 206366#(<= ULTIMATE.start_main_~x~4 8), 206365#(<= ULTIMATE.start_main_~x~4 7), 206364#(<= ULTIMATE.start_main_~x~4 6), 206371#(<= ULTIMATE.start_main_~x~4 13), 206370#(<= ULTIMATE.start_main_~x~4 12), 206369#(<= ULTIMATE.start_main_~x~4 11), 206368#(<= ULTIMATE.start_main_~x~4 10), 206375#(<= ULTIMATE.start_main_~x~4 17), 206374#(<= ULTIMATE.start_main_~x~4 16), 206373#(<= ULTIMATE.start_main_~x~4 15), 206372#(<= ULTIMATE.start_main_~x~4 14), 206379#(<= ULTIMATE.start_main_~x~4 21), 206378#(<= ULTIMATE.start_main_~x~4 20), 206377#(<= ULTIMATE.start_main_~x~4 19), 206376#(<= ULTIMATE.start_main_~x~4 18), 206383#(<= ULTIMATE.start_main_~x~4 25), 206382#(<= ULTIMATE.start_main_~x~4 24), 206381#(<= ULTIMATE.start_main_~x~4 23), 206380#(<= ULTIMATE.start_main_~x~4 22), 206387#(<= ULTIMATE.start_main_~x~4 29), 206386#(<= ULTIMATE.start_main_~x~4 28), 206385#(<= ULTIMATE.start_main_~x~4 27), 206384#(<= ULTIMATE.start_main_~x~4 26), 206391#(<= ULTIMATE.start_main_~x~4 33), 206390#(<= ULTIMATE.start_main_~x~4 32), 206389#(<= ULTIMATE.start_main_~x~4 31), 206388#(<= ULTIMATE.start_main_~x~4 30), 206395#(<= ULTIMATE.start_main_~x~4 37), 206394#(<= ULTIMATE.start_main_~x~4 36), 206393#(<= ULTIMATE.start_main_~x~4 35), 206392#(<= ULTIMATE.start_main_~x~4 34), 206399#(<= ULTIMATE.start_main_~x~4 41), 206398#(<= ULTIMATE.start_main_~x~4 40), 206397#(<= ULTIMATE.start_main_~x~4 39), 206396#(<= ULTIMATE.start_main_~x~4 38), 206403#(<= ULTIMATE.start_main_~x~4 45), 206402#(<= ULTIMATE.start_main_~x~4 44), 206401#(<= ULTIMATE.start_main_~x~4 43), 206400#(<= ULTIMATE.start_main_~x~4 42), 206407#(<= ULTIMATE.start_main_~x~4 49), 206406#(<= ULTIMATE.start_main_~x~4 48), 206405#(<= ULTIMATE.start_main_~x~4 47), 206404#(<= ULTIMATE.start_main_~x~4 46), 206411#(<= ULTIMATE.start_main_~x~4 53), 206410#(<= ULTIMATE.start_main_~x~4 52), 206409#(<= ULTIMATE.start_main_~x~4 51), 206408#(<= ULTIMATE.start_main_~x~4 50), 206415#(<= ULTIMATE.start_main_~x~4 57), 206414#(<= ULTIMATE.start_main_~x~4 56), 206413#(<= ULTIMATE.start_main_~x~4 55), 206412#(<= ULTIMATE.start_main_~x~4 54), 206419#(<= ULTIMATE.start_main_~x~4 61), 206418#(<= ULTIMATE.start_main_~x~4 60), 206417#(<= ULTIMATE.start_main_~x~4 59), 206416#(<= ULTIMATE.start_main_~x~4 58), 206423#(<= ULTIMATE.start_main_~x~4 65), 206422#(<= ULTIMATE.start_main_~x~4 64), 206421#(<= ULTIMATE.start_main_~x~4 63), 206420#(<= ULTIMATE.start_main_~x~4 62), 206427#(<= ULTIMATE.start_main_~x~4 69), 206426#(<= ULTIMATE.start_main_~x~4 68), 206425#(<= ULTIMATE.start_main_~x~4 67), 206424#(<= ULTIMATE.start_main_~x~4 66), 206431#(<= ULTIMATE.start_main_~x~4 73), 206430#(<= ULTIMATE.start_main_~x~4 72), 206429#(<= ULTIMATE.start_main_~x~4 71), 206428#(<= ULTIMATE.start_main_~x~4 70), 206435#(<= ULTIMATE.start_main_~x~4 77), 206434#(<= ULTIMATE.start_main_~x~4 76), 206433#(<= ULTIMATE.start_main_~x~4 75), 206432#(<= ULTIMATE.start_main_~x~4 74), 206439#(<= ULTIMATE.start_main_~x~4 81), 206438#(<= ULTIMATE.start_main_~x~4 80), 206437#(<= ULTIMATE.start_main_~x~4 79), 206436#(<= ULTIMATE.start_main_~x~4 78), 206443#(<= ULTIMATE.start_main_~x~4 85), 206442#(<= ULTIMATE.start_main_~x~4 84), 206441#(<= ULTIMATE.start_main_~x~4 83), 206440#(<= ULTIMATE.start_main_~x~4 82), 206447#(<= ULTIMATE.start_main_~x~4 89), 206446#(<= ULTIMATE.start_main_~x~4 88), 206445#(<= ULTIMATE.start_main_~x~4 87), 206444#(<= ULTIMATE.start_main_~x~4 86), 206448#(<= ULTIMATE.start_main_~x~4 90)] [2018-07-23 13:43:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-07-23 13:43:15,653 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 13:43:15,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 13:43:15,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 13:43:15,654 INFO L87 Difference]: Start difference. First operand 1084 states and 1174 transitions. Second operand 93 states. [2018-07-23 13:43:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:17,007 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-07-23 13:43:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 13:43:17,007 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1083 [2018-07-23 13:43:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:17,008 INFO L225 Difference]: With dead ends: 1109 [2018-07-23 13:43:17,008 INFO L226 Difference]: Without dead ends: 1107 [2018-07-23 13:43:17,009 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 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:43:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-07-23 13:43:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1096. [2018-07-23 13:43:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-07-23 13:43:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1187 transitions. [2018-07-23 13:43:18,201 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1187 transitions. Word has length 1083 [2018-07-23 13:43:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:18,202 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1187 transitions. [2018-07-23 13:43:18,202 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 13:43:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1187 transitions. [2018-07-23 13:43:18,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-07-23 13:43:18,210 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:18,210 INFO L357 BasicCegarLoop]: trace histogram [910, 91, 91, 1, 1, 1] [2018-07-23 13:43:18,210 INFO L414 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:18,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1736186705, now seen corresponding path program 100 times [2018-07-23 13:43:18,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-07-23 13:43:19,285 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:19,285 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 13:43:19,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:43:19,287 INFO L185 omatonBuilderFactory]: Interpolants [210947#(<= ULTIMATE.start_main_~x~4 86), 210946#(<= ULTIMATE.start_main_~x~4 85), 210945#(<= ULTIMATE.start_main_~x~4 84), 210944#(<= ULTIMATE.start_main_~x~4 83), 210951#(<= ULTIMATE.start_main_~x~4 90), 210950#(<= ULTIMATE.start_main_~x~4 89), 210949#(<= ULTIMATE.start_main_~x~4 88), 210948#(<= ULTIMATE.start_main_~x~4 87), 210952#(<= ULTIMATE.start_main_~x~4 91), 210859#true, 210863#(<= ULTIMATE.start_main_~x~4 2), 210862#(<= ULTIMATE.start_main_~x~4 1), 210861#(<= ULTIMATE.start_main_~x~4 0), 210860#false, 210867#(<= ULTIMATE.start_main_~x~4 6), 210866#(<= ULTIMATE.start_main_~x~4 5), 210865#(<= ULTIMATE.start_main_~x~4 4), 210864#(<= ULTIMATE.start_main_~x~4 3), 210871#(<= ULTIMATE.start_main_~x~4 10), 210870#(<= ULTIMATE.start_main_~x~4 9), 210869#(<= ULTIMATE.start_main_~x~4 8), 210868#(<= ULTIMATE.start_main_~x~4 7), 210875#(<= ULTIMATE.start_main_~x~4 14), 210874#(<= ULTIMATE.start_main_~x~4 13), 210873#(<= ULTIMATE.start_main_~x~4 12), 210872#(<= ULTIMATE.start_main_~x~4 11), 210879#(<= ULTIMATE.start_main_~x~4 18), 210878#(<= ULTIMATE.start_main_~x~4 17), 210877#(<= ULTIMATE.start_main_~x~4 16), 210876#(<= ULTIMATE.start_main_~x~4 15), 210883#(<= ULTIMATE.start_main_~x~4 22), 210882#(<= ULTIMATE.start_main_~x~4 21), 210881#(<= ULTIMATE.start_main_~x~4 20), 210880#(<= ULTIMATE.start_main_~x~4 19), 210887#(<= ULTIMATE.start_main_~x~4 26), 210886#(<= ULTIMATE.start_main_~x~4 25), 210885#(<= ULTIMATE.start_main_~x~4 24), 210884#(<= ULTIMATE.start_main_~x~4 23), 210891#(<= ULTIMATE.start_main_~x~4 30), 210890#(<= ULTIMATE.start_main_~x~4 29), 210889#(<= ULTIMATE.start_main_~x~4 28), 210888#(<= ULTIMATE.start_main_~x~4 27), 210895#(<= ULTIMATE.start_main_~x~4 34), 210894#(<= ULTIMATE.start_main_~x~4 33), 210893#(<= ULTIMATE.start_main_~x~4 32), 210892#(<= ULTIMATE.start_main_~x~4 31), 210899#(<= ULTIMATE.start_main_~x~4 38), 210898#(<= ULTIMATE.start_main_~x~4 37), 210897#(<= ULTIMATE.start_main_~x~4 36), 210896#(<= ULTIMATE.start_main_~x~4 35), 210903#(<= ULTIMATE.start_main_~x~4 42), 210902#(<= ULTIMATE.start_main_~x~4 41), 210901#(<= ULTIMATE.start_main_~x~4 40), 210900#(<= ULTIMATE.start_main_~x~4 39), 210907#(<= ULTIMATE.start_main_~x~4 46), 210906#(<= ULTIMATE.start_main_~x~4 45), 210905#(<= ULTIMATE.start_main_~x~4 44), 210904#(<= ULTIMATE.start_main_~x~4 43), 210911#(<= ULTIMATE.start_main_~x~4 50), 210910#(<= ULTIMATE.start_main_~x~4 49), 210909#(<= ULTIMATE.start_main_~x~4 48), 210908#(<= ULTIMATE.start_main_~x~4 47), 210915#(<= ULTIMATE.start_main_~x~4 54), 210914#(<= ULTIMATE.start_main_~x~4 53), 210913#(<= ULTIMATE.start_main_~x~4 52), 210912#(<= ULTIMATE.start_main_~x~4 51), 210919#(<= ULTIMATE.start_main_~x~4 58), 210918#(<= ULTIMATE.start_main_~x~4 57), 210917#(<= ULTIMATE.start_main_~x~4 56), 210916#(<= ULTIMATE.start_main_~x~4 55), 210923#(<= ULTIMATE.start_main_~x~4 62), 210922#(<= ULTIMATE.start_main_~x~4 61), 210921#(<= ULTIMATE.start_main_~x~4 60), 210920#(<= ULTIMATE.start_main_~x~4 59), 210927#(<= ULTIMATE.start_main_~x~4 66), 210926#(<= ULTIMATE.start_main_~x~4 65), 210925#(<= ULTIMATE.start_main_~x~4 64), 210924#(<= ULTIMATE.start_main_~x~4 63), 210931#(<= ULTIMATE.start_main_~x~4 70), 210930#(<= ULTIMATE.start_main_~x~4 69), 210929#(<= ULTIMATE.start_main_~x~4 68), 210928#(<= ULTIMATE.start_main_~x~4 67), 210935#(<= ULTIMATE.start_main_~x~4 74), 210934#(<= ULTIMATE.start_main_~x~4 73), 210933#(<= ULTIMATE.start_main_~x~4 72), 210932#(<= ULTIMATE.start_main_~x~4 71), 210939#(<= ULTIMATE.start_main_~x~4 78), 210938#(<= ULTIMATE.start_main_~x~4 77), 210937#(<= ULTIMATE.start_main_~x~4 76), 210936#(<= ULTIMATE.start_main_~x~4 75), 210943#(<= ULTIMATE.start_main_~x~4 82), 210942#(<= ULTIMATE.start_main_~x~4 81), 210941#(<= ULTIMATE.start_main_~x~4 80), 210940#(<= ULTIMATE.start_main_~x~4 79)] [2018-07-23 13:43:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-07-23 13:43:19,301 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 13:43:19,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 13:43:19,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 13:43:19,302 INFO L87 Difference]: Start difference. First operand 1096 states and 1187 transitions. Second operand 94 states. [2018-07-23 13:43:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:20,613 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-07-23 13:43:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 13:43:20,613 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1095 [2018-07-23 13:43:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:20,614 INFO L225 Difference]: With dead ends: 1121 [2018-07-23 13:43:20,614 INFO L226 Difference]: Without dead ends: 1119 [2018-07-23 13:43:20,615 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 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:43:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-07-23 13:43:21,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2018-07-23 13:43:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-07-23 13:43:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1200 transitions. [2018-07-23 13:43:21,802 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1200 transitions. Word has length 1095 [2018-07-23 13:43:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:21,803 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1200 transitions. [2018-07-23 13:43:21,803 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 13:43:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1200 transitions. [2018-07-23 13:43:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-07-23 13:43:21,809 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:21,809 INFO L357 BasicCegarLoop]: trace histogram [920, 92, 92, 1, 1, 1] [2018-07-23 13:43:21,809 INFO L414 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:21,810 INFO L82 PathProgramCache]: Analyzing trace with hash 682618267, now seen corresponding path program 101 times [2018-07-23 13:43:21,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:22,889 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-07-23 13:43:22,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:22,890 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 13:43:22,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:43:22,890 INFO L185 omatonBuilderFactory]: Interpolants [215427#(<= ULTIMATE.start_main_~x~4 14), 215426#(<= ULTIMATE.start_main_~x~4 13), 215425#(<= ULTIMATE.start_main_~x~4 12), 215424#(<= ULTIMATE.start_main_~x~4 11), 215431#(<= ULTIMATE.start_main_~x~4 18), 215430#(<= ULTIMATE.start_main_~x~4 17), 215429#(<= ULTIMATE.start_main_~x~4 16), 215428#(<= ULTIMATE.start_main_~x~4 15), 215435#(<= ULTIMATE.start_main_~x~4 22), 215434#(<= ULTIMATE.start_main_~x~4 21), 215433#(<= ULTIMATE.start_main_~x~4 20), 215432#(<= ULTIMATE.start_main_~x~4 19), 215439#(<= ULTIMATE.start_main_~x~4 26), 215438#(<= ULTIMATE.start_main_~x~4 25), 215437#(<= ULTIMATE.start_main_~x~4 24), 215436#(<= ULTIMATE.start_main_~x~4 23), 215443#(<= ULTIMATE.start_main_~x~4 30), 215442#(<= ULTIMATE.start_main_~x~4 29), 215441#(<= ULTIMATE.start_main_~x~4 28), 215440#(<= ULTIMATE.start_main_~x~4 27), 215447#(<= ULTIMATE.start_main_~x~4 34), 215446#(<= ULTIMATE.start_main_~x~4 33), 215445#(<= ULTIMATE.start_main_~x~4 32), 215444#(<= ULTIMATE.start_main_~x~4 31), 215451#(<= ULTIMATE.start_main_~x~4 38), 215450#(<= ULTIMATE.start_main_~x~4 37), 215449#(<= ULTIMATE.start_main_~x~4 36), 215448#(<= ULTIMATE.start_main_~x~4 35), 215455#(<= ULTIMATE.start_main_~x~4 42), 215454#(<= ULTIMATE.start_main_~x~4 41), 215453#(<= ULTIMATE.start_main_~x~4 40), 215452#(<= ULTIMATE.start_main_~x~4 39), 215459#(<= ULTIMATE.start_main_~x~4 46), 215458#(<= ULTIMATE.start_main_~x~4 45), 215457#(<= ULTIMATE.start_main_~x~4 44), 215456#(<= ULTIMATE.start_main_~x~4 43), 215463#(<= ULTIMATE.start_main_~x~4 50), 215462#(<= ULTIMATE.start_main_~x~4 49), 215461#(<= ULTIMATE.start_main_~x~4 48), 215460#(<= ULTIMATE.start_main_~x~4 47), 215467#(<= ULTIMATE.start_main_~x~4 54), 215466#(<= ULTIMATE.start_main_~x~4 53), 215465#(<= ULTIMATE.start_main_~x~4 52), 215464#(<= ULTIMATE.start_main_~x~4 51), 215471#(<= ULTIMATE.start_main_~x~4 58), 215470#(<= ULTIMATE.start_main_~x~4 57), 215469#(<= ULTIMATE.start_main_~x~4 56), 215468#(<= ULTIMATE.start_main_~x~4 55), 215475#(<= ULTIMATE.start_main_~x~4 62), 215474#(<= ULTIMATE.start_main_~x~4 61), 215473#(<= ULTIMATE.start_main_~x~4 60), 215472#(<= ULTIMATE.start_main_~x~4 59), 215479#(<= ULTIMATE.start_main_~x~4 66), 215478#(<= ULTIMATE.start_main_~x~4 65), 215477#(<= ULTIMATE.start_main_~x~4 64), 215476#(<= ULTIMATE.start_main_~x~4 63), 215483#(<= ULTIMATE.start_main_~x~4 70), 215482#(<= ULTIMATE.start_main_~x~4 69), 215481#(<= ULTIMATE.start_main_~x~4 68), 215480#(<= ULTIMATE.start_main_~x~4 67), 215487#(<= ULTIMATE.start_main_~x~4 74), 215486#(<= ULTIMATE.start_main_~x~4 73), 215485#(<= ULTIMATE.start_main_~x~4 72), 215484#(<= ULTIMATE.start_main_~x~4 71), 215491#(<= ULTIMATE.start_main_~x~4 78), 215490#(<= ULTIMATE.start_main_~x~4 77), 215489#(<= ULTIMATE.start_main_~x~4 76), 215488#(<= ULTIMATE.start_main_~x~4 75), 215495#(<= ULTIMATE.start_main_~x~4 82), 215494#(<= ULTIMATE.start_main_~x~4 81), 215493#(<= ULTIMATE.start_main_~x~4 80), 215492#(<= ULTIMATE.start_main_~x~4 79), 215499#(<= ULTIMATE.start_main_~x~4 86), 215498#(<= ULTIMATE.start_main_~x~4 85), 215497#(<= ULTIMATE.start_main_~x~4 84), 215496#(<= ULTIMATE.start_main_~x~4 83), 215503#(<= ULTIMATE.start_main_~x~4 90), 215502#(<= ULTIMATE.start_main_~x~4 89), 215501#(<= ULTIMATE.start_main_~x~4 88), 215500#(<= ULTIMATE.start_main_~x~4 87), 215505#(<= ULTIMATE.start_main_~x~4 92), 215504#(<= ULTIMATE.start_main_~x~4 91), 215411#true, 215415#(<= ULTIMATE.start_main_~x~4 2), 215414#(<= ULTIMATE.start_main_~x~4 1), 215413#(<= ULTIMATE.start_main_~x~4 0), 215412#false, 215419#(<= ULTIMATE.start_main_~x~4 6), 215418#(<= ULTIMATE.start_main_~x~4 5), 215417#(<= ULTIMATE.start_main_~x~4 4), 215416#(<= ULTIMATE.start_main_~x~4 3), 215423#(<= ULTIMATE.start_main_~x~4 10), 215422#(<= ULTIMATE.start_main_~x~4 9), 215421#(<= ULTIMATE.start_main_~x~4 8), 215420#(<= ULTIMATE.start_main_~x~4 7)] [2018-07-23 13:43:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-07-23 13:43:22,905 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 13:43:22,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 13:43:22,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 13:43:22,906 INFO L87 Difference]: Start difference. First operand 1108 states and 1200 transitions. Second operand 95 states. [2018-07-23 13:43:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:24,279 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-07-23 13:43:24,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 13:43:24,279 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1107 [2018-07-23 13:43:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:24,281 INFO L225 Difference]: With dead ends: 1133 [2018-07-23 13:43:24,281 INFO L226 Difference]: Without dead ends: 1131 [2018-07-23 13:43:24,282 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 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:43:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-07-23 13:43:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1120. [2018-07-23 13:43:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-07-23 13:43:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1213 transitions. [2018-07-23 13:43:25,503 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1213 transitions. Word has length 1107 [2018-07-23 13:43:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:25,503 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1213 transitions. [2018-07-23 13:43:25,503 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 13:43:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1213 transitions. [2018-07-23 13:43:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-07-23 13:43:25,510 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:25,510 INFO L357 BasicCegarLoop]: trace histogram [930, 93, 93, 1, 1, 1] [2018-07-23 13:43:25,510 INFO L414 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash 580428005, now seen corresponding path program 102 times [2018-07-23 13:43:25,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-07-23 13:43:26,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:26,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 13:43:26,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:26,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:43:26,630 INFO L185 omatonBuilderFactory]: Interpolants [220035#(<= ULTIMATE.start_main_~x~4 21), 220034#(<= ULTIMATE.start_main_~x~4 20), 220033#(<= ULTIMATE.start_main_~x~4 19), 220032#(<= ULTIMATE.start_main_~x~4 18), 220039#(<= ULTIMATE.start_main_~x~4 25), 220038#(<= ULTIMATE.start_main_~x~4 24), 220037#(<= ULTIMATE.start_main_~x~4 23), 220036#(<= ULTIMATE.start_main_~x~4 22), 220043#(<= ULTIMATE.start_main_~x~4 29), 220042#(<= ULTIMATE.start_main_~x~4 28), 220041#(<= ULTIMATE.start_main_~x~4 27), 220040#(<= ULTIMATE.start_main_~x~4 26), 220047#(<= ULTIMATE.start_main_~x~4 33), 220046#(<= ULTIMATE.start_main_~x~4 32), 220045#(<= ULTIMATE.start_main_~x~4 31), 220044#(<= ULTIMATE.start_main_~x~4 30), 220051#(<= ULTIMATE.start_main_~x~4 37), 220050#(<= ULTIMATE.start_main_~x~4 36), 220049#(<= ULTIMATE.start_main_~x~4 35), 220048#(<= ULTIMATE.start_main_~x~4 34), 220055#(<= ULTIMATE.start_main_~x~4 41), 220054#(<= ULTIMATE.start_main_~x~4 40), 220053#(<= ULTIMATE.start_main_~x~4 39), 220052#(<= ULTIMATE.start_main_~x~4 38), 220059#(<= ULTIMATE.start_main_~x~4 45), 220058#(<= ULTIMATE.start_main_~x~4 44), 220057#(<= ULTIMATE.start_main_~x~4 43), 220056#(<= ULTIMATE.start_main_~x~4 42), 220063#(<= ULTIMATE.start_main_~x~4 49), 220062#(<= ULTIMATE.start_main_~x~4 48), 220061#(<= ULTIMATE.start_main_~x~4 47), 220060#(<= ULTIMATE.start_main_~x~4 46), 220067#(<= ULTIMATE.start_main_~x~4 53), 220066#(<= ULTIMATE.start_main_~x~4 52), 220065#(<= ULTIMATE.start_main_~x~4 51), 220064#(<= ULTIMATE.start_main_~x~4 50), 220071#(<= ULTIMATE.start_main_~x~4 57), 220070#(<= ULTIMATE.start_main_~x~4 56), 220069#(<= ULTIMATE.start_main_~x~4 55), 220068#(<= ULTIMATE.start_main_~x~4 54), 220075#(<= ULTIMATE.start_main_~x~4 61), 220074#(<= ULTIMATE.start_main_~x~4 60), 220073#(<= ULTIMATE.start_main_~x~4 59), 220072#(<= ULTIMATE.start_main_~x~4 58), 220079#(<= ULTIMATE.start_main_~x~4 65), 220078#(<= ULTIMATE.start_main_~x~4 64), 220077#(<= ULTIMATE.start_main_~x~4 63), 220076#(<= ULTIMATE.start_main_~x~4 62), 220083#(<= ULTIMATE.start_main_~x~4 69), 220082#(<= ULTIMATE.start_main_~x~4 68), 220081#(<= ULTIMATE.start_main_~x~4 67), 220080#(<= ULTIMATE.start_main_~x~4 66), 220087#(<= ULTIMATE.start_main_~x~4 73), 220086#(<= ULTIMATE.start_main_~x~4 72), 220085#(<= ULTIMATE.start_main_~x~4 71), 220084#(<= ULTIMATE.start_main_~x~4 70), 220091#(<= ULTIMATE.start_main_~x~4 77), 220090#(<= ULTIMATE.start_main_~x~4 76), 220089#(<= ULTIMATE.start_main_~x~4 75), 220088#(<= ULTIMATE.start_main_~x~4 74), 220095#(<= ULTIMATE.start_main_~x~4 81), 220094#(<= ULTIMATE.start_main_~x~4 80), 220093#(<= ULTIMATE.start_main_~x~4 79), 220092#(<= ULTIMATE.start_main_~x~4 78), 220099#(<= ULTIMATE.start_main_~x~4 85), 220098#(<= ULTIMATE.start_main_~x~4 84), 220097#(<= ULTIMATE.start_main_~x~4 83), 220096#(<= ULTIMATE.start_main_~x~4 82), 220103#(<= ULTIMATE.start_main_~x~4 89), 220102#(<= ULTIMATE.start_main_~x~4 88), 220101#(<= ULTIMATE.start_main_~x~4 87), 220100#(<= ULTIMATE.start_main_~x~4 86), 220107#(<= ULTIMATE.start_main_~x~4 93), 220106#(<= ULTIMATE.start_main_~x~4 92), 220105#(<= ULTIMATE.start_main_~x~4 91), 220104#(<= ULTIMATE.start_main_~x~4 90), 220015#(<= ULTIMATE.start_main_~x~4 1), 220014#(<= ULTIMATE.start_main_~x~4 0), 220013#false, 220012#true, 220019#(<= ULTIMATE.start_main_~x~4 5), 220018#(<= ULTIMATE.start_main_~x~4 4), 220017#(<= ULTIMATE.start_main_~x~4 3), 220016#(<= ULTIMATE.start_main_~x~4 2), 220023#(<= ULTIMATE.start_main_~x~4 9), 220022#(<= ULTIMATE.start_main_~x~4 8), 220021#(<= ULTIMATE.start_main_~x~4 7), 220020#(<= ULTIMATE.start_main_~x~4 6), 220027#(<= ULTIMATE.start_main_~x~4 13), 220026#(<= ULTIMATE.start_main_~x~4 12), 220025#(<= ULTIMATE.start_main_~x~4 11), 220024#(<= ULTIMATE.start_main_~x~4 10), 220031#(<= ULTIMATE.start_main_~x~4 17), 220030#(<= ULTIMATE.start_main_~x~4 16), 220029#(<= ULTIMATE.start_main_~x~4 15), 220028#(<= ULTIMATE.start_main_~x~4 14)] [2018-07-23 13:43:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-07-23 13:43:26,645 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 13:43:26,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 13:43:26,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 13:43:26,647 INFO L87 Difference]: Start difference. First operand 1120 states and 1213 transitions. Second operand 96 states. [2018-07-23 13:43:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:28,065 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-07-23 13:43:28,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 13:43:28,066 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1119 [2018-07-23 13:43:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:28,067 INFO L225 Difference]: With dead ends: 1145 [2018-07-23 13:43:28,068 INFO L226 Difference]: Without dead ends: 1143 [2018-07-23 13:43:28,068 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 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:43:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-07-23 13:43:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2018-07-23 13:43:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-07-23 13:43:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1226 transitions. [2018-07-23 13:43:29,338 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1226 transitions. Word has length 1119 [2018-07-23 13:43:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:29,338 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1226 transitions. [2018-07-23 13:43:29,338 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 13:43:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1226 transitions. [2018-07-23 13:43:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-07-23 13:43:29,344 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:29,345 INFO L357 BasicCegarLoop]: trace histogram [940, 94, 94, 1, 1, 1] [2018-07-23 13:43:29,345 INFO L414 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:29,345 INFO L82 PathProgramCache]: Analyzing trace with hash 267171119, now seen corresponding path program 103 times [2018-07-23 13:43:29,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-07-23 13:43:30,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:30,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 13:43:30,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:30,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:43:30,447 INFO L185 omatonBuilderFactory]: Interpolants [224663#false, 224662#true, 224667#(<= ULTIMATE.start_main_~x~4 3), 224666#(<= ULTIMATE.start_main_~x~4 2), 224665#(<= ULTIMATE.start_main_~x~4 1), 224664#(<= ULTIMATE.start_main_~x~4 0), 224671#(<= ULTIMATE.start_main_~x~4 7), 224670#(<= ULTIMATE.start_main_~x~4 6), 224669#(<= ULTIMATE.start_main_~x~4 5), 224668#(<= ULTIMATE.start_main_~x~4 4), 224675#(<= ULTIMATE.start_main_~x~4 11), 224674#(<= ULTIMATE.start_main_~x~4 10), 224673#(<= ULTIMATE.start_main_~x~4 9), 224672#(<= ULTIMATE.start_main_~x~4 8), 224679#(<= ULTIMATE.start_main_~x~4 15), 224678#(<= ULTIMATE.start_main_~x~4 14), 224677#(<= ULTIMATE.start_main_~x~4 13), 224676#(<= ULTIMATE.start_main_~x~4 12), 224683#(<= ULTIMATE.start_main_~x~4 19), 224682#(<= ULTIMATE.start_main_~x~4 18), 224681#(<= ULTIMATE.start_main_~x~4 17), 224680#(<= ULTIMATE.start_main_~x~4 16), 224687#(<= ULTIMATE.start_main_~x~4 23), 224686#(<= ULTIMATE.start_main_~x~4 22), 224685#(<= ULTIMATE.start_main_~x~4 21), 224684#(<= ULTIMATE.start_main_~x~4 20), 224691#(<= ULTIMATE.start_main_~x~4 27), 224690#(<= ULTIMATE.start_main_~x~4 26), 224689#(<= ULTIMATE.start_main_~x~4 25), 224688#(<= ULTIMATE.start_main_~x~4 24), 224695#(<= ULTIMATE.start_main_~x~4 31), 224694#(<= ULTIMATE.start_main_~x~4 30), 224693#(<= ULTIMATE.start_main_~x~4 29), 224692#(<= ULTIMATE.start_main_~x~4 28), 224699#(<= ULTIMATE.start_main_~x~4 35), 224698#(<= ULTIMATE.start_main_~x~4 34), 224697#(<= ULTIMATE.start_main_~x~4 33), 224696#(<= ULTIMATE.start_main_~x~4 32), 224703#(<= ULTIMATE.start_main_~x~4 39), 224702#(<= ULTIMATE.start_main_~x~4 38), 224701#(<= ULTIMATE.start_main_~x~4 37), 224700#(<= ULTIMATE.start_main_~x~4 36), 224707#(<= ULTIMATE.start_main_~x~4 43), 224706#(<= ULTIMATE.start_main_~x~4 42), 224705#(<= ULTIMATE.start_main_~x~4 41), 224704#(<= ULTIMATE.start_main_~x~4 40), 224711#(<= ULTIMATE.start_main_~x~4 47), 224710#(<= ULTIMATE.start_main_~x~4 46), 224709#(<= ULTIMATE.start_main_~x~4 45), 224708#(<= ULTIMATE.start_main_~x~4 44), 224715#(<= ULTIMATE.start_main_~x~4 51), 224714#(<= ULTIMATE.start_main_~x~4 50), 224713#(<= ULTIMATE.start_main_~x~4 49), 224712#(<= ULTIMATE.start_main_~x~4 48), 224719#(<= ULTIMATE.start_main_~x~4 55), 224718#(<= ULTIMATE.start_main_~x~4 54), 224717#(<= ULTIMATE.start_main_~x~4 53), 224716#(<= ULTIMATE.start_main_~x~4 52), 224723#(<= ULTIMATE.start_main_~x~4 59), 224722#(<= ULTIMATE.start_main_~x~4 58), 224721#(<= ULTIMATE.start_main_~x~4 57), 224720#(<= ULTIMATE.start_main_~x~4 56), 224727#(<= ULTIMATE.start_main_~x~4 63), 224726#(<= ULTIMATE.start_main_~x~4 62), 224725#(<= ULTIMATE.start_main_~x~4 61), 224724#(<= ULTIMATE.start_main_~x~4 60), 224731#(<= ULTIMATE.start_main_~x~4 67), 224730#(<= ULTIMATE.start_main_~x~4 66), 224729#(<= ULTIMATE.start_main_~x~4 65), 224728#(<= ULTIMATE.start_main_~x~4 64), 224735#(<= ULTIMATE.start_main_~x~4 71), 224734#(<= ULTIMATE.start_main_~x~4 70), 224733#(<= ULTIMATE.start_main_~x~4 69), 224732#(<= ULTIMATE.start_main_~x~4 68), 224739#(<= ULTIMATE.start_main_~x~4 75), 224738#(<= ULTIMATE.start_main_~x~4 74), 224737#(<= ULTIMATE.start_main_~x~4 73), 224736#(<= ULTIMATE.start_main_~x~4 72), 224743#(<= ULTIMATE.start_main_~x~4 79), 224742#(<= ULTIMATE.start_main_~x~4 78), 224741#(<= ULTIMATE.start_main_~x~4 77), 224740#(<= ULTIMATE.start_main_~x~4 76), 224747#(<= ULTIMATE.start_main_~x~4 83), 224746#(<= ULTIMATE.start_main_~x~4 82), 224745#(<= ULTIMATE.start_main_~x~4 81), 224744#(<= ULTIMATE.start_main_~x~4 80), 224751#(<= ULTIMATE.start_main_~x~4 87), 224750#(<= ULTIMATE.start_main_~x~4 86), 224749#(<= ULTIMATE.start_main_~x~4 85), 224748#(<= ULTIMATE.start_main_~x~4 84), 224755#(<= ULTIMATE.start_main_~x~4 91), 224754#(<= ULTIMATE.start_main_~x~4 90), 224753#(<= ULTIMATE.start_main_~x~4 89), 224752#(<= ULTIMATE.start_main_~x~4 88), 224758#(<= ULTIMATE.start_main_~x~4 94), 224757#(<= ULTIMATE.start_main_~x~4 93), 224756#(<= ULTIMATE.start_main_~x~4 92)] [2018-07-23 13:43:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-07-23 13:43:30,463 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 13:43:30,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 13:43:30,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 13:43:30,464 INFO L87 Difference]: Start difference. First operand 1132 states and 1226 transitions. Second operand 97 states. [2018-07-23 13:43:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:31,979 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-07-23 13:43:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 13:43:31,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1131 [2018-07-23 13:43:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:31,980 INFO L225 Difference]: With dead ends: 1157 [2018-07-23 13:43:31,980 INFO L226 Difference]: Without dead ends: 1155 [2018-07-23 13:43:31,980 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 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:43:31,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-07-23 13:43:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1144. [2018-07-23 13:43:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-07-23 13:43:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1239 transitions. [2018-07-23 13:43:33,264 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1239 transitions. Word has length 1131 [2018-07-23 13:43:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:33,264 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1239 transitions. [2018-07-23 13:43:33,264 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 13:43:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1239 transitions. [2018-07-23 13:43:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2018-07-23 13:43:33,271 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:33,271 INFO L357 BasicCegarLoop]: trace histogram [950, 95, 95, 1, 1, 1] [2018-07-23 13:43:33,271 INFO L414 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash -844977543, now seen corresponding path program 104 times [2018-07-23 13:43:33,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-07-23 13:43:34,416 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:34,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 13:43:34,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:43:34,417 INFO L185 omatonBuilderFactory]: Interpolants [229379#(<= ULTIMATE.start_main_~x~4 16), 229378#(<= ULTIMATE.start_main_~x~4 15), 229377#(<= ULTIMATE.start_main_~x~4 14), 229376#(<= ULTIMATE.start_main_~x~4 13), 229383#(<= ULTIMATE.start_main_~x~4 20), 229382#(<= ULTIMATE.start_main_~x~4 19), 229381#(<= ULTIMATE.start_main_~x~4 18), 229380#(<= ULTIMATE.start_main_~x~4 17), 229387#(<= ULTIMATE.start_main_~x~4 24), 229386#(<= ULTIMATE.start_main_~x~4 23), 229385#(<= ULTIMATE.start_main_~x~4 22), 229384#(<= ULTIMATE.start_main_~x~4 21), 229391#(<= ULTIMATE.start_main_~x~4 28), 229390#(<= ULTIMATE.start_main_~x~4 27), 229389#(<= ULTIMATE.start_main_~x~4 26), 229388#(<= ULTIMATE.start_main_~x~4 25), 229395#(<= ULTIMATE.start_main_~x~4 32), 229394#(<= ULTIMATE.start_main_~x~4 31), 229393#(<= ULTIMATE.start_main_~x~4 30), 229392#(<= ULTIMATE.start_main_~x~4 29), 229399#(<= ULTIMATE.start_main_~x~4 36), 229398#(<= ULTIMATE.start_main_~x~4 35), 229397#(<= ULTIMATE.start_main_~x~4 34), 229396#(<= ULTIMATE.start_main_~x~4 33), 229403#(<= ULTIMATE.start_main_~x~4 40), 229402#(<= ULTIMATE.start_main_~x~4 39), 229401#(<= ULTIMATE.start_main_~x~4 38), 229400#(<= ULTIMATE.start_main_~x~4 37), 229407#(<= ULTIMATE.start_main_~x~4 44), 229406#(<= ULTIMATE.start_main_~x~4 43), 229405#(<= ULTIMATE.start_main_~x~4 42), 229404#(<= ULTIMATE.start_main_~x~4 41), 229411#(<= ULTIMATE.start_main_~x~4 48), 229410#(<= ULTIMATE.start_main_~x~4 47), 229409#(<= ULTIMATE.start_main_~x~4 46), 229408#(<= ULTIMATE.start_main_~x~4 45), 229415#(<= ULTIMATE.start_main_~x~4 52), 229414#(<= ULTIMATE.start_main_~x~4 51), 229413#(<= ULTIMATE.start_main_~x~4 50), 229412#(<= ULTIMATE.start_main_~x~4 49), 229419#(<= ULTIMATE.start_main_~x~4 56), 229418#(<= ULTIMATE.start_main_~x~4 55), 229417#(<= ULTIMATE.start_main_~x~4 54), 229416#(<= ULTIMATE.start_main_~x~4 53), 229423#(<= ULTIMATE.start_main_~x~4 60), 229422#(<= ULTIMATE.start_main_~x~4 59), 229421#(<= ULTIMATE.start_main_~x~4 58), 229420#(<= ULTIMATE.start_main_~x~4 57), 229427#(<= ULTIMATE.start_main_~x~4 64), 229426#(<= ULTIMATE.start_main_~x~4 63), 229425#(<= ULTIMATE.start_main_~x~4 62), 229424#(<= ULTIMATE.start_main_~x~4 61), 229431#(<= ULTIMATE.start_main_~x~4 68), 229430#(<= ULTIMATE.start_main_~x~4 67), 229429#(<= ULTIMATE.start_main_~x~4 66), 229428#(<= ULTIMATE.start_main_~x~4 65), 229435#(<= ULTIMATE.start_main_~x~4 72), 229434#(<= ULTIMATE.start_main_~x~4 71), 229433#(<= ULTIMATE.start_main_~x~4 70), 229432#(<= ULTIMATE.start_main_~x~4 69), 229439#(<= ULTIMATE.start_main_~x~4 76), 229438#(<= ULTIMATE.start_main_~x~4 75), 229437#(<= ULTIMATE.start_main_~x~4 74), 229436#(<= ULTIMATE.start_main_~x~4 73), 229443#(<= ULTIMATE.start_main_~x~4 80), 229442#(<= ULTIMATE.start_main_~x~4 79), 229441#(<= ULTIMATE.start_main_~x~4 78), 229440#(<= ULTIMATE.start_main_~x~4 77), 229447#(<= ULTIMATE.start_main_~x~4 84), 229446#(<= ULTIMATE.start_main_~x~4 83), 229445#(<= ULTIMATE.start_main_~x~4 82), 229444#(<= ULTIMATE.start_main_~x~4 81), 229451#(<= ULTIMATE.start_main_~x~4 88), 229450#(<= ULTIMATE.start_main_~x~4 87), 229449#(<= ULTIMATE.start_main_~x~4 86), 229448#(<= ULTIMATE.start_main_~x~4 85), 229455#(<= ULTIMATE.start_main_~x~4 92), 229454#(<= ULTIMATE.start_main_~x~4 91), 229453#(<= ULTIMATE.start_main_~x~4 90), 229452#(<= ULTIMATE.start_main_~x~4 89), 229458#(<= ULTIMATE.start_main_~x~4 95), 229457#(<= ULTIMATE.start_main_~x~4 94), 229456#(<= ULTIMATE.start_main_~x~4 93), 229363#(<= ULTIMATE.start_main_~x~4 0), 229362#false, 229361#true, 229367#(<= ULTIMATE.start_main_~x~4 4), 229366#(<= ULTIMATE.start_main_~x~4 3), 229365#(<= ULTIMATE.start_main_~x~4 2), 229364#(<= ULTIMATE.start_main_~x~4 1), 229371#(<= ULTIMATE.start_main_~x~4 8), 229370#(<= ULTIMATE.start_main_~x~4 7), 229369#(<= ULTIMATE.start_main_~x~4 6), 229368#(<= ULTIMATE.start_main_~x~4 5), 229375#(<= ULTIMATE.start_main_~x~4 12), 229374#(<= ULTIMATE.start_main_~x~4 11), 229373#(<= ULTIMATE.start_main_~x~4 10), 229372#(<= ULTIMATE.start_main_~x~4 9)] [2018-07-23 13:43:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-07-23 13:43:34,433 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 13:43:34,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 13:43:34,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 13:43:34,434 INFO L87 Difference]: Start difference. First operand 1144 states and 1239 transitions. Second operand 98 states. [2018-07-23 13:43:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:35,923 INFO L93 Difference]: Finished difference Result 1169 states and 1266 transitions. [2018-07-23 13:43:35,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 13:43:35,923 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 1143 [2018-07-23 13:43:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:35,925 INFO L225 Difference]: With dead ends: 1169 [2018-07-23 13:43:35,925 INFO L226 Difference]: Without dead ends: 1167 [2018-07-23 13:43:35,925 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 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:43:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-07-23 13:43:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1156. [2018-07-23 13:43:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-07-23 13:43:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1252 transitions. [2018-07-23 13:43:37,248 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1252 transitions. Word has length 1143 [2018-07-23 13:43:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:37,249 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1252 transitions. [2018-07-23 13:43:37,249 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 13:43:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1252 transitions. [2018-07-23 13:43:37,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2018-07-23 13:43:37,256 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:37,256 INFO L357 BasicCegarLoop]: trace histogram [960, 96, 96, 1, 1, 1] [2018-07-23 13:43:37,256 INFO L414 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:37,256 INFO L82 PathProgramCache]: Analyzing trace with hash -84868925, now seen corresponding path program 105 times [2018-07-23 13:43:37,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 561696 backedges. 0 proven. 556416 refuted. 0 times theorem prover too weak. 5280 trivial. 0 not checked. [2018-07-23 13:43:38,426 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:38,427 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 13:43:38,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:43:38,428 INFO L185 omatonBuilderFactory]: Interpolants [234111#(<= ULTIMATE.start_main_~x~4 0), 234110#false, 234109#true, 234115#(<= ULTIMATE.start_main_~x~4 4), 234114#(<= ULTIMATE.start_main_~x~4 3), 234113#(<= ULTIMATE.start_main_~x~4 2), 234112#(<= ULTIMATE.start_main_~x~4 1), 234119#(<= ULTIMATE.start_main_~x~4 8), 234118#(<= ULTIMATE.start_main_~x~4 7), 234117#(<= ULTIMATE.start_main_~x~4 6), 234116#(<= ULTIMATE.start_main_~x~4 5), 234123#(<= ULTIMATE.start_main_~x~4 12), 234122#(<= ULTIMATE.start_main_~x~4 11), 234121#(<= ULTIMATE.start_main_~x~4 10), 234120#(<= ULTIMATE.start_main_~x~4 9), 234127#(<= ULTIMATE.start_main_~x~4 16), 234126#(<= ULTIMATE.start_main_~x~4 15), 234125#(<= ULTIMATE.start_main_~x~4 14), 234124#(<= ULTIMATE.start_main_~x~4 13), 234131#(<= ULTIMATE.start_main_~x~4 20), 234130#(<= ULTIMATE.start_main_~x~4 19), 234129#(<= ULTIMATE.start_main_~x~4 18), 234128#(<= ULTIMATE.start_main_~x~4 17), 234135#(<= ULTIMATE.start_main_~x~4 24), 234134#(<= ULTIMATE.start_main_~x~4 23), 234133#(<= ULTIMATE.start_main_~x~4 22), 234132#(<= ULTIMATE.start_main_~x~4 21), 234139#(<= ULTIMATE.start_main_~x~4 28), 234138#(<= ULTIMATE.start_main_~x~4 27), 234137#(<= ULTIMATE.start_main_~x~4 26), 234136#(<= ULTIMATE.start_main_~x~4 25), 234143#(<= ULTIMATE.start_main_~x~4 32), 234142#(<= ULTIMATE.start_main_~x~4 31), 234141#(<= ULTIMATE.start_main_~x~4 30), 234140#(<= ULTIMATE.start_main_~x~4 29), 234147#(<= ULTIMATE.start_main_~x~4 36), 234146#(<= ULTIMATE.start_main_~x~4 35), 234145#(<= ULTIMATE.start_main_~x~4 34), 234144#(<= ULTIMATE.start_main_~x~4 33), 234151#(<= ULTIMATE.start_main_~x~4 40), 234150#(<= ULTIMATE.start_main_~x~4 39), 234149#(<= ULTIMATE.start_main_~x~4 38), 234148#(<= ULTIMATE.start_main_~x~4 37), 234155#(<= ULTIMATE.start_main_~x~4 44), 234154#(<= ULTIMATE.start_main_~x~4 43), 234153#(<= ULTIMATE.start_main_~x~4 42), 234152#(<= ULTIMATE.start_main_~x~4 41), 234159#(<= ULTIMATE.start_main_~x~4 48), 234158#(<= ULTIMATE.start_main_~x~4 47), 234157#(<= ULTIMATE.start_main_~x~4 46), 234156#(<= ULTIMATE.start_main_~x~4 45), 234163#(<= ULTIMATE.start_main_~x~4 52), 234162#(<= ULTIMATE.start_main_~x~4 51), 234161#(<= ULTIMATE.start_main_~x~4 50), 234160#(<= ULTIMATE.start_main_~x~4 49), 234167#(<= ULTIMATE.start_main_~x~4 56), 234166#(<= ULTIMATE.start_main_~x~4 55), 234165#(<= ULTIMATE.start_main_~x~4 54), 234164#(<= ULTIMATE.start_main_~x~4 53), 234171#(<= ULTIMATE.start_main_~x~4 60), 234170#(<= ULTIMATE.start_main_~x~4 59), 234169#(<= ULTIMATE.start_main_~x~4 58), 234168#(<= ULTIMATE.start_main_~x~4 57), 234175#(<= ULTIMATE.start_main_~x~4 64), 234174#(<= ULTIMATE.start_main_~x~4 63), 234173#(<= ULTIMATE.start_main_~x~4 62), 234172#(<= ULTIMATE.start_main_~x~4 61), 234179#(<= ULTIMATE.start_main_~x~4 68), 234178#(<= ULTIMATE.start_main_~x~4 67), 234177#(<= ULTIMATE.start_main_~x~4 66), 234176#(<= ULTIMATE.start_main_~x~4 65), 234183#(<= ULTIMATE.start_main_~x~4 72), 234182#(<= ULTIMATE.start_main_~x~4 71), 234181#(<= ULTIMATE.start_main_~x~4 70), 234180#(<= ULTIMATE.start_main_~x~4 69), 234187#(<= ULTIMATE.start_main_~x~4 76), 234186#(<= ULTIMATE.start_main_~x~4 75), 234185#(<= ULTIMATE.start_main_~x~4 74), 234184#(<= ULTIMATE.start_main_~x~4 73), 234191#(<= ULTIMATE.start_main_~x~4 80), 234190#(<= ULTIMATE.start_main_~x~4 79), 234189#(<= ULTIMATE.start_main_~x~4 78), 234188#(<= ULTIMATE.start_main_~x~4 77), 234195#(<= ULTIMATE.start_main_~x~4 84), 234194#(<= ULTIMATE.start_main_~x~4 83), 234193#(<= ULTIMATE.start_main_~x~4 82), 234192#(<= ULTIMATE.start_main_~x~4 81), 234199#(<= ULTIMATE.start_main_~x~4 88), 234198#(<= ULTIMATE.start_main_~x~4 87), 234197#(<= ULTIMATE.start_main_~x~4 86), 234196#(<= ULTIMATE.start_main_~x~4 85), 234203#(<= ULTIMATE.start_main_~x~4 92), 234202#(<= ULTIMATE.start_main_~x~4 91), 234201#(<= ULTIMATE.start_main_~x~4 90), 234200#(<= ULTIMATE.start_main_~x~4 89), 234207#(<= ULTIMATE.start_main_~x~4 96), 234206#(<= ULTIMATE.start_main_~x~4 95), 234205#(<= ULTIMATE.start_main_~x~4 94), 234204#(<= ULTIMATE.start_main_~x~4 93)] [2018-07-23 13:43:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 561696 backedges. 0 proven. 556416 refuted. 0 times theorem prover too weak. 5280 trivial. 0 not checked. [2018-07-23 13:43:38,444 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 13:43:38,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 13:43:38,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 13:43:38,445 INFO L87 Difference]: Start difference. First operand 1156 states and 1252 transitions. Second operand 99 states. [2018-07-23 13:43:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:39,999 INFO L93 Difference]: Finished difference Result 1181 states and 1279 transitions. [2018-07-23 13:43:39,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 13:43:40,000 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1155 [2018-07-23 13:43:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:40,001 INFO L225 Difference]: With dead ends: 1181 [2018-07-23 13:43:40,001 INFO L226 Difference]: Without dead ends: 1179 [2018-07-23 13:43:40,002 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 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:43:40,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-07-23 13:43:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1168. [2018-07-23 13:43:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-07-23 13:43:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1265 transitions. [2018-07-23 13:43:41,355 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1265 transitions. Word has length 1155 [2018-07-23 13:43:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:41,356 INFO L471 AbstractCegarLoop]: Abstraction has 1168 states and 1265 transitions. [2018-07-23 13:43:41,356 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 13:43:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1265 transitions. [2018-07-23 13:43:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1168 [2018-07-23 13:43:41,363 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:41,363 INFO L357 BasicCegarLoop]: trace histogram [970, 97, 97, 1, 1, 1] [2018-07-23 13:43:41,363 INFO L414 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1722927091, now seen corresponding path program 106 times [2018-07-23 13:43:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 573464 backedges. 0 proven. 568129 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2018-07-23 13:43:42,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:42,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 13:43:42,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:43:42,623 INFO L185 omatonBuilderFactory]: Interpolants [238907#false, 238906#true, 238911#(<= ULTIMATE.start_main_~x~4 3), 238910#(<= ULTIMATE.start_main_~x~4 2), 238909#(<= ULTIMATE.start_main_~x~4 1), 238908#(<= ULTIMATE.start_main_~x~4 0), 238915#(<= ULTIMATE.start_main_~x~4 7), 238914#(<= ULTIMATE.start_main_~x~4 6), 238913#(<= ULTIMATE.start_main_~x~4 5), 238912#(<= ULTIMATE.start_main_~x~4 4), 238919#(<= ULTIMATE.start_main_~x~4 11), 238918#(<= ULTIMATE.start_main_~x~4 10), 238917#(<= ULTIMATE.start_main_~x~4 9), 238916#(<= ULTIMATE.start_main_~x~4 8), 238923#(<= ULTIMATE.start_main_~x~4 15), 238922#(<= ULTIMATE.start_main_~x~4 14), 238921#(<= ULTIMATE.start_main_~x~4 13), 238920#(<= ULTIMATE.start_main_~x~4 12), 238927#(<= ULTIMATE.start_main_~x~4 19), 238926#(<= ULTIMATE.start_main_~x~4 18), 238925#(<= ULTIMATE.start_main_~x~4 17), 238924#(<= ULTIMATE.start_main_~x~4 16), 238931#(<= ULTIMATE.start_main_~x~4 23), 238930#(<= ULTIMATE.start_main_~x~4 22), 238929#(<= ULTIMATE.start_main_~x~4 21), 238928#(<= ULTIMATE.start_main_~x~4 20), 238935#(<= ULTIMATE.start_main_~x~4 27), 238934#(<= ULTIMATE.start_main_~x~4 26), 238933#(<= ULTIMATE.start_main_~x~4 25), 238932#(<= ULTIMATE.start_main_~x~4 24), 238939#(<= ULTIMATE.start_main_~x~4 31), 238938#(<= ULTIMATE.start_main_~x~4 30), 238937#(<= ULTIMATE.start_main_~x~4 29), 238936#(<= ULTIMATE.start_main_~x~4 28), 238943#(<= ULTIMATE.start_main_~x~4 35), 238942#(<= ULTIMATE.start_main_~x~4 34), 238941#(<= ULTIMATE.start_main_~x~4 33), 238940#(<= ULTIMATE.start_main_~x~4 32), 238947#(<= ULTIMATE.start_main_~x~4 39), 238946#(<= ULTIMATE.start_main_~x~4 38), 238945#(<= ULTIMATE.start_main_~x~4 37), 238944#(<= ULTIMATE.start_main_~x~4 36), 238951#(<= ULTIMATE.start_main_~x~4 43), 238950#(<= ULTIMATE.start_main_~x~4 42), 238949#(<= ULTIMATE.start_main_~x~4 41), 238948#(<= ULTIMATE.start_main_~x~4 40), 238955#(<= ULTIMATE.start_main_~x~4 47), 238954#(<= ULTIMATE.start_main_~x~4 46), 238953#(<= ULTIMATE.start_main_~x~4 45), 238952#(<= ULTIMATE.start_main_~x~4 44), 238959#(<= ULTIMATE.start_main_~x~4 51), 238958#(<= ULTIMATE.start_main_~x~4 50), 238957#(<= ULTIMATE.start_main_~x~4 49), 238956#(<= ULTIMATE.start_main_~x~4 48), 238963#(<= ULTIMATE.start_main_~x~4 55), 238962#(<= ULTIMATE.start_main_~x~4 54), 238961#(<= ULTIMATE.start_main_~x~4 53), 238960#(<= ULTIMATE.start_main_~x~4 52), 238967#(<= ULTIMATE.start_main_~x~4 59), 238966#(<= ULTIMATE.start_main_~x~4 58), 238965#(<= ULTIMATE.start_main_~x~4 57), 238964#(<= ULTIMATE.start_main_~x~4 56), 238971#(<= ULTIMATE.start_main_~x~4 63), 238970#(<= ULTIMATE.start_main_~x~4 62), 238969#(<= ULTIMATE.start_main_~x~4 61), 238968#(<= ULTIMATE.start_main_~x~4 60), 238975#(<= ULTIMATE.start_main_~x~4 67), 238974#(<= ULTIMATE.start_main_~x~4 66), 238973#(<= ULTIMATE.start_main_~x~4 65), 238972#(<= ULTIMATE.start_main_~x~4 64), 238979#(<= ULTIMATE.start_main_~x~4 71), 238978#(<= ULTIMATE.start_main_~x~4 70), 238977#(<= ULTIMATE.start_main_~x~4 69), 238976#(<= ULTIMATE.start_main_~x~4 68), 238983#(<= ULTIMATE.start_main_~x~4 75), 238982#(<= ULTIMATE.start_main_~x~4 74), 238981#(<= ULTIMATE.start_main_~x~4 73), 238980#(<= ULTIMATE.start_main_~x~4 72), 238987#(<= ULTIMATE.start_main_~x~4 79), 238986#(<= ULTIMATE.start_main_~x~4 78), 238985#(<= ULTIMATE.start_main_~x~4 77), 238984#(<= ULTIMATE.start_main_~x~4 76), 238991#(<= ULTIMATE.start_main_~x~4 83), 238990#(<= ULTIMATE.start_main_~x~4 82), 238989#(<= ULTIMATE.start_main_~x~4 81), 238988#(<= ULTIMATE.start_main_~x~4 80), 238995#(<= ULTIMATE.start_main_~x~4 87), 238994#(<= ULTIMATE.start_main_~x~4 86), 238993#(<= ULTIMATE.start_main_~x~4 85), 238992#(<= ULTIMATE.start_main_~x~4 84), 238999#(<= ULTIMATE.start_main_~x~4 91), 238998#(<= ULTIMATE.start_main_~x~4 90), 238997#(<= ULTIMATE.start_main_~x~4 89), 238996#(<= ULTIMATE.start_main_~x~4 88), 239003#(<= ULTIMATE.start_main_~x~4 95), 239002#(<= ULTIMATE.start_main_~x~4 94), 239001#(<= ULTIMATE.start_main_~x~4 93), 239000#(<= ULTIMATE.start_main_~x~4 92), 239005#(<= ULTIMATE.start_main_~x~4 97), 239004#(<= ULTIMATE.start_main_~x~4 96)] [2018-07-23 13:43:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 573464 backedges. 0 proven. 568129 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2018-07-23 13:43:42,640 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 13:43:42,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 13:43:42,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:43:42,641 INFO L87 Difference]: Start difference. First operand 1168 states and 1265 transitions. Second operand 100 states. [2018-07-23 13:43:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:44,185 INFO L93 Difference]: Finished difference Result 1193 states and 1292 transitions. [2018-07-23 13:43:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 13:43:44,185 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 1167 [2018-07-23 13:43:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:44,186 INFO L225 Difference]: With dead ends: 1193 [2018-07-23 13:43:44,186 INFO L226 Difference]: Without dead ends: 1191 [2018-07-23 13:43:44,187 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 13:43:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-07-23 13:43:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1180. [2018-07-23 13:43:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2018-07-23 13:43:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1278 transitions. [2018-07-23 13:43:45,581 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1278 transitions. Word has length 1167 [2018-07-23 13:43:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:45,582 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1278 transitions. [2018-07-23 13:43:45,582 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 13:43:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1278 transitions. [2018-07-23 13:43:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2018-07-23 13:43:45,589 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:45,589 INFO L357 BasicCegarLoop]: trace histogram [980, 98, 98, 1, 1, 1] [2018-07-23 13:43:45,589 INFO L414 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:45,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1401892777, now seen corresponding path program 107 times [2018-07-23 13:43:45,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 585354 backedges. 0 proven. 579964 refuted. 0 times theorem prover too weak. 5390 trivial. 0 not checked. [2018-07-23 13:43:46,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:46,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 13:43:46,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:43:46,835 INFO L185 omatonBuilderFactory]: Interpolants [243755#(<= ULTIMATE.start_main_~x~4 1), 243754#(<= ULTIMATE.start_main_~x~4 0), 243753#false, 243752#true, 243759#(<= ULTIMATE.start_main_~x~4 5), 243758#(<= ULTIMATE.start_main_~x~4 4), 243757#(<= ULTIMATE.start_main_~x~4 3), 243756#(<= ULTIMATE.start_main_~x~4 2), 243763#(<= ULTIMATE.start_main_~x~4 9), 243762#(<= ULTIMATE.start_main_~x~4 8), 243761#(<= ULTIMATE.start_main_~x~4 7), 243760#(<= ULTIMATE.start_main_~x~4 6), 243767#(<= ULTIMATE.start_main_~x~4 13), 243766#(<= ULTIMATE.start_main_~x~4 12), 243765#(<= ULTIMATE.start_main_~x~4 11), 243764#(<= ULTIMATE.start_main_~x~4 10), 243771#(<= ULTIMATE.start_main_~x~4 17), 243770#(<= ULTIMATE.start_main_~x~4 16), 243769#(<= ULTIMATE.start_main_~x~4 15), 243768#(<= ULTIMATE.start_main_~x~4 14), 243775#(<= ULTIMATE.start_main_~x~4 21), 243774#(<= ULTIMATE.start_main_~x~4 20), 243773#(<= ULTIMATE.start_main_~x~4 19), 243772#(<= ULTIMATE.start_main_~x~4 18), 243779#(<= ULTIMATE.start_main_~x~4 25), 243778#(<= ULTIMATE.start_main_~x~4 24), 243777#(<= ULTIMATE.start_main_~x~4 23), 243776#(<= ULTIMATE.start_main_~x~4 22), 243783#(<= ULTIMATE.start_main_~x~4 29), 243782#(<= ULTIMATE.start_main_~x~4 28), 243781#(<= ULTIMATE.start_main_~x~4 27), 243780#(<= ULTIMATE.start_main_~x~4 26), 243787#(<= ULTIMATE.start_main_~x~4 33), 243786#(<= ULTIMATE.start_main_~x~4 32), 243785#(<= ULTIMATE.start_main_~x~4 31), 243784#(<= ULTIMATE.start_main_~x~4 30), 243791#(<= ULTIMATE.start_main_~x~4 37), 243790#(<= ULTIMATE.start_main_~x~4 36), 243789#(<= ULTIMATE.start_main_~x~4 35), 243788#(<= ULTIMATE.start_main_~x~4 34), 243795#(<= ULTIMATE.start_main_~x~4 41), 243794#(<= ULTIMATE.start_main_~x~4 40), 243793#(<= ULTIMATE.start_main_~x~4 39), 243792#(<= ULTIMATE.start_main_~x~4 38), 243799#(<= ULTIMATE.start_main_~x~4 45), 243798#(<= ULTIMATE.start_main_~x~4 44), 243797#(<= ULTIMATE.start_main_~x~4 43), 243796#(<= ULTIMATE.start_main_~x~4 42), 243803#(<= ULTIMATE.start_main_~x~4 49), 243802#(<= ULTIMATE.start_main_~x~4 48), 243801#(<= ULTIMATE.start_main_~x~4 47), 243800#(<= ULTIMATE.start_main_~x~4 46), 243807#(<= ULTIMATE.start_main_~x~4 53), 243806#(<= ULTIMATE.start_main_~x~4 52), 243805#(<= ULTIMATE.start_main_~x~4 51), 243804#(<= ULTIMATE.start_main_~x~4 50), 243811#(<= ULTIMATE.start_main_~x~4 57), 243810#(<= ULTIMATE.start_main_~x~4 56), 243809#(<= ULTIMATE.start_main_~x~4 55), 243808#(<= ULTIMATE.start_main_~x~4 54), 243815#(<= ULTIMATE.start_main_~x~4 61), 243814#(<= ULTIMATE.start_main_~x~4 60), 243813#(<= ULTIMATE.start_main_~x~4 59), 243812#(<= ULTIMATE.start_main_~x~4 58), 243819#(<= ULTIMATE.start_main_~x~4 65), 243818#(<= ULTIMATE.start_main_~x~4 64), 243817#(<= ULTIMATE.start_main_~x~4 63), 243816#(<= ULTIMATE.start_main_~x~4 62), 243823#(<= ULTIMATE.start_main_~x~4 69), 243822#(<= ULTIMATE.start_main_~x~4 68), 243821#(<= ULTIMATE.start_main_~x~4 67), 243820#(<= ULTIMATE.start_main_~x~4 66), 243827#(<= ULTIMATE.start_main_~x~4 73), 243826#(<= ULTIMATE.start_main_~x~4 72), 243825#(<= ULTIMATE.start_main_~x~4 71), 243824#(<= ULTIMATE.start_main_~x~4 70), 243831#(<= ULTIMATE.start_main_~x~4 77), 243830#(<= ULTIMATE.start_main_~x~4 76), 243829#(<= ULTIMATE.start_main_~x~4 75), 243828#(<= ULTIMATE.start_main_~x~4 74), 243835#(<= ULTIMATE.start_main_~x~4 81), 243834#(<= ULTIMATE.start_main_~x~4 80), 243833#(<= ULTIMATE.start_main_~x~4 79), 243832#(<= ULTIMATE.start_main_~x~4 78), 243839#(<= ULTIMATE.start_main_~x~4 85), 243838#(<= ULTIMATE.start_main_~x~4 84), 243837#(<= ULTIMATE.start_main_~x~4 83), 243836#(<= ULTIMATE.start_main_~x~4 82), 243843#(<= ULTIMATE.start_main_~x~4 89), 243842#(<= ULTIMATE.start_main_~x~4 88), 243841#(<= ULTIMATE.start_main_~x~4 87), 243840#(<= ULTIMATE.start_main_~x~4 86), 243847#(<= ULTIMATE.start_main_~x~4 93), 243846#(<= ULTIMATE.start_main_~x~4 92), 243845#(<= ULTIMATE.start_main_~x~4 91), 243844#(<= ULTIMATE.start_main_~x~4 90), 243851#(<= ULTIMATE.start_main_~x~4 97), 243850#(<= ULTIMATE.start_main_~x~4 96), 243849#(<= ULTIMATE.start_main_~x~4 95), 243848#(<= ULTIMATE.start_main_~x~4 94), 243852#(<= ULTIMATE.start_main_~x~4 98)] [2018-07-23 13:43:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 585354 backedges. 0 proven. 579964 refuted. 0 times theorem prover too weak. 5390 trivial. 0 not checked. [2018-07-23 13:43:46,852 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 13:43:46,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 13:43:46,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 13:43:46,853 INFO L87 Difference]: Start difference. First operand 1180 states and 1278 transitions. Second operand 101 states. [2018-07-23 13:43:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:48,429 INFO L93 Difference]: Finished difference Result 1205 states and 1305 transitions. [2018-07-23 13:43:48,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 13:43:48,429 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1179 [2018-07-23 13:43:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:48,431 INFO L225 Difference]: With dead ends: 1205 [2018-07-23 13:43:48,431 INFO L226 Difference]: Without dead ends: 1203 [2018-07-23 13:43:48,431 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 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:43:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-07-23 13:43:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1192. [2018-07-23 13:43:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-07-23 13:43:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1291 transitions. [2018-07-23 13:43:49,850 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1291 transitions. Word has length 1179 [2018-07-23 13:43:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:49,850 INFO L471 AbstractCegarLoop]: Abstraction has 1192 states and 1291 transitions. [2018-07-23 13:43:49,850 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 13:43:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1291 transitions. [2018-07-23 13:43:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1192 [2018-07-23 13:43:49,857 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:49,858 INFO L357 BasicCegarLoop]: trace histogram [990, 99, 99, 1, 1, 1] [2018-07-23 13:43:49,858 INFO L414 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash -632338015, now seen corresponding path program 108 times [2018-07-23 13:43:49,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 597366 backedges. 0 proven. 591921 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2018-07-23 13:43:51,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:51,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 13:43:51,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:43:51,122 INFO L185 omatonBuilderFactory]: Interpolants [248647#true, 248651#(<= ULTIMATE.start_main_~x~4 2), 248650#(<= ULTIMATE.start_main_~x~4 1), 248649#(<= ULTIMATE.start_main_~x~4 0), 248648#false, 248655#(<= ULTIMATE.start_main_~x~4 6), 248654#(<= ULTIMATE.start_main_~x~4 5), 248653#(<= ULTIMATE.start_main_~x~4 4), 248652#(<= ULTIMATE.start_main_~x~4 3), 248659#(<= ULTIMATE.start_main_~x~4 10), 248658#(<= ULTIMATE.start_main_~x~4 9), 248657#(<= ULTIMATE.start_main_~x~4 8), 248656#(<= ULTIMATE.start_main_~x~4 7), 248663#(<= ULTIMATE.start_main_~x~4 14), 248662#(<= ULTIMATE.start_main_~x~4 13), 248661#(<= ULTIMATE.start_main_~x~4 12), 248660#(<= ULTIMATE.start_main_~x~4 11), 248667#(<= ULTIMATE.start_main_~x~4 18), 248666#(<= ULTIMATE.start_main_~x~4 17), 248665#(<= ULTIMATE.start_main_~x~4 16), 248664#(<= ULTIMATE.start_main_~x~4 15), 248671#(<= ULTIMATE.start_main_~x~4 22), 248670#(<= ULTIMATE.start_main_~x~4 21), 248669#(<= ULTIMATE.start_main_~x~4 20), 248668#(<= ULTIMATE.start_main_~x~4 19), 248675#(<= ULTIMATE.start_main_~x~4 26), 248674#(<= ULTIMATE.start_main_~x~4 25), 248673#(<= ULTIMATE.start_main_~x~4 24), 248672#(<= ULTIMATE.start_main_~x~4 23), 248679#(<= ULTIMATE.start_main_~x~4 30), 248678#(<= ULTIMATE.start_main_~x~4 29), 248677#(<= ULTIMATE.start_main_~x~4 28), 248676#(<= ULTIMATE.start_main_~x~4 27), 248683#(<= ULTIMATE.start_main_~x~4 34), 248682#(<= ULTIMATE.start_main_~x~4 33), 248681#(<= ULTIMATE.start_main_~x~4 32), 248680#(<= ULTIMATE.start_main_~x~4 31), 248687#(<= ULTIMATE.start_main_~x~4 38), 248686#(<= ULTIMATE.start_main_~x~4 37), 248685#(<= ULTIMATE.start_main_~x~4 36), 248684#(<= ULTIMATE.start_main_~x~4 35), 248691#(<= ULTIMATE.start_main_~x~4 42), 248690#(<= ULTIMATE.start_main_~x~4 41), 248689#(<= ULTIMATE.start_main_~x~4 40), 248688#(<= ULTIMATE.start_main_~x~4 39), 248695#(<= ULTIMATE.start_main_~x~4 46), 248694#(<= ULTIMATE.start_main_~x~4 45), 248693#(<= ULTIMATE.start_main_~x~4 44), 248692#(<= ULTIMATE.start_main_~x~4 43), 248699#(<= ULTIMATE.start_main_~x~4 50), 248698#(<= ULTIMATE.start_main_~x~4 49), 248697#(<= ULTIMATE.start_main_~x~4 48), 248696#(<= ULTIMATE.start_main_~x~4 47), 248703#(<= ULTIMATE.start_main_~x~4 54), 248702#(<= ULTIMATE.start_main_~x~4 53), 248701#(<= ULTIMATE.start_main_~x~4 52), 248700#(<= ULTIMATE.start_main_~x~4 51), 248707#(<= ULTIMATE.start_main_~x~4 58), 248706#(<= ULTIMATE.start_main_~x~4 57), 248705#(<= ULTIMATE.start_main_~x~4 56), 248704#(<= ULTIMATE.start_main_~x~4 55), 248711#(<= ULTIMATE.start_main_~x~4 62), 248710#(<= ULTIMATE.start_main_~x~4 61), 248709#(<= ULTIMATE.start_main_~x~4 60), 248708#(<= ULTIMATE.start_main_~x~4 59), 248715#(<= ULTIMATE.start_main_~x~4 66), 248714#(<= ULTIMATE.start_main_~x~4 65), 248713#(<= ULTIMATE.start_main_~x~4 64), 248712#(<= ULTIMATE.start_main_~x~4 63), 248719#(<= ULTIMATE.start_main_~x~4 70), 248718#(<= ULTIMATE.start_main_~x~4 69), 248717#(<= ULTIMATE.start_main_~x~4 68), 248716#(<= ULTIMATE.start_main_~x~4 67), 248723#(<= ULTIMATE.start_main_~x~4 74), 248722#(<= ULTIMATE.start_main_~x~4 73), 248721#(<= ULTIMATE.start_main_~x~4 72), 248720#(<= ULTIMATE.start_main_~x~4 71), 248727#(<= ULTIMATE.start_main_~x~4 78), 248726#(<= ULTIMATE.start_main_~x~4 77), 248725#(<= ULTIMATE.start_main_~x~4 76), 248724#(<= ULTIMATE.start_main_~x~4 75), 248731#(<= ULTIMATE.start_main_~x~4 82), 248730#(<= ULTIMATE.start_main_~x~4 81), 248729#(<= ULTIMATE.start_main_~x~4 80), 248728#(<= ULTIMATE.start_main_~x~4 79), 248735#(<= ULTIMATE.start_main_~x~4 86), 248734#(<= ULTIMATE.start_main_~x~4 85), 248733#(<= ULTIMATE.start_main_~x~4 84), 248732#(<= ULTIMATE.start_main_~x~4 83), 248739#(<= ULTIMATE.start_main_~x~4 90), 248738#(<= ULTIMATE.start_main_~x~4 89), 248737#(<= ULTIMATE.start_main_~x~4 88), 248736#(<= ULTIMATE.start_main_~x~4 87), 248743#(<= ULTIMATE.start_main_~x~4 94), 248742#(<= ULTIMATE.start_main_~x~4 93), 248741#(<= ULTIMATE.start_main_~x~4 92), 248740#(<= ULTIMATE.start_main_~x~4 91), 248747#(<= ULTIMATE.start_main_~x~4 98), 248746#(<= ULTIMATE.start_main_~x~4 97), 248745#(<= ULTIMATE.start_main_~x~4 96), 248744#(<= ULTIMATE.start_main_~x~4 95), 248748#(<= ULTIMATE.start_main_~x~4 99)] [2018-07-23 13:43:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 597366 backedges. 0 proven. 591921 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2018-07-23 13:43:51,141 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 13:43:51,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 13:43:51,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 13:43:51,142 INFO L87 Difference]: Start difference. First operand 1192 states and 1291 transitions. Second operand 102 states. [2018-07-23 13:43:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:52,726 INFO L93 Difference]: Finished difference Result 1217 states and 1318 transitions. [2018-07-23 13:43:52,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 13:43:52,726 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 1191 [2018-07-23 13:43:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:52,728 INFO L225 Difference]: With dead ends: 1217 [2018-07-23 13:43:52,728 INFO L226 Difference]: Without dead ends: 1215 [2018-07-23 13:43:52,728 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 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:43:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2018-07-23 13:43:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1204. [2018-07-23 13:43:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-07-23 13:43:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1304 transitions. [2018-07-23 13:43:54,239 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1304 transitions. Word has length 1191 [2018-07-23 13:43:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:54,239 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1304 transitions. [2018-07-23 13:43:54,239 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 13:43:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1304 transitions. [2018-07-23 13:43:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1204 [2018-07-23 13:43:54,247 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:54,247 INFO L357 BasicCegarLoop]: trace histogram [1000, 100, 100, 1, 1, 1] [2018-07-23 13:43:54,247 INFO L414 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash 186655723, now seen corresponding path program 109 times [2018-07-23 13:43:54,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:43:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 609500 backedges. 0 proven. 604000 refuted. 0 times theorem prover too weak. 5500 trivial. 0 not checked. [2018-07-23 13:43:55,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:43:55,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 13:43:55,514 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:43:55,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:43:55,515 INFO L185 omatonBuilderFactory]: Interpolants [253591#true, 253595#(<= ULTIMATE.start_main_~x~4 2), 253594#(<= ULTIMATE.start_main_~x~4 1), 253593#(<= ULTIMATE.start_main_~x~4 0), 253592#false, 253599#(<= ULTIMATE.start_main_~x~4 6), 253598#(<= ULTIMATE.start_main_~x~4 5), 253597#(<= ULTIMATE.start_main_~x~4 4), 253596#(<= ULTIMATE.start_main_~x~4 3), 253603#(<= ULTIMATE.start_main_~x~4 10), 253602#(<= ULTIMATE.start_main_~x~4 9), 253601#(<= ULTIMATE.start_main_~x~4 8), 253600#(<= ULTIMATE.start_main_~x~4 7), 253607#(<= ULTIMATE.start_main_~x~4 14), 253606#(<= ULTIMATE.start_main_~x~4 13), 253605#(<= ULTIMATE.start_main_~x~4 12), 253604#(<= ULTIMATE.start_main_~x~4 11), 253611#(<= ULTIMATE.start_main_~x~4 18), 253610#(<= ULTIMATE.start_main_~x~4 17), 253609#(<= ULTIMATE.start_main_~x~4 16), 253608#(<= ULTIMATE.start_main_~x~4 15), 253615#(<= ULTIMATE.start_main_~x~4 22), 253614#(<= ULTIMATE.start_main_~x~4 21), 253613#(<= ULTIMATE.start_main_~x~4 20), 253612#(<= ULTIMATE.start_main_~x~4 19), 253619#(<= ULTIMATE.start_main_~x~4 26), 253618#(<= ULTIMATE.start_main_~x~4 25), 253617#(<= ULTIMATE.start_main_~x~4 24), 253616#(<= ULTIMATE.start_main_~x~4 23), 253623#(<= ULTIMATE.start_main_~x~4 30), 253622#(<= ULTIMATE.start_main_~x~4 29), 253621#(<= ULTIMATE.start_main_~x~4 28), 253620#(<= ULTIMATE.start_main_~x~4 27), 253627#(<= ULTIMATE.start_main_~x~4 34), 253626#(<= ULTIMATE.start_main_~x~4 33), 253625#(<= ULTIMATE.start_main_~x~4 32), 253624#(<= ULTIMATE.start_main_~x~4 31), 253631#(<= ULTIMATE.start_main_~x~4 38), 253630#(<= ULTIMATE.start_main_~x~4 37), 253629#(<= ULTIMATE.start_main_~x~4 36), 253628#(<= ULTIMATE.start_main_~x~4 35), 253635#(<= ULTIMATE.start_main_~x~4 42), 253634#(<= ULTIMATE.start_main_~x~4 41), 253633#(<= ULTIMATE.start_main_~x~4 40), 253632#(<= ULTIMATE.start_main_~x~4 39), 253639#(<= ULTIMATE.start_main_~x~4 46), 253638#(<= ULTIMATE.start_main_~x~4 45), 253637#(<= ULTIMATE.start_main_~x~4 44), 253636#(<= ULTIMATE.start_main_~x~4 43), 253643#(<= ULTIMATE.start_main_~x~4 50), 253642#(<= ULTIMATE.start_main_~x~4 49), 253641#(<= ULTIMATE.start_main_~x~4 48), 253640#(<= ULTIMATE.start_main_~x~4 47), 253647#(<= ULTIMATE.start_main_~x~4 54), 253646#(<= ULTIMATE.start_main_~x~4 53), 253645#(<= ULTIMATE.start_main_~x~4 52), 253644#(<= ULTIMATE.start_main_~x~4 51), 253651#(<= ULTIMATE.start_main_~x~4 58), 253650#(<= ULTIMATE.start_main_~x~4 57), 253649#(<= ULTIMATE.start_main_~x~4 56), 253648#(<= ULTIMATE.start_main_~x~4 55), 253655#(<= ULTIMATE.start_main_~x~4 62), 253654#(<= ULTIMATE.start_main_~x~4 61), 253653#(<= ULTIMATE.start_main_~x~4 60), 253652#(<= ULTIMATE.start_main_~x~4 59), 253659#(<= ULTIMATE.start_main_~x~4 66), 253658#(<= ULTIMATE.start_main_~x~4 65), 253657#(<= ULTIMATE.start_main_~x~4 64), 253656#(<= ULTIMATE.start_main_~x~4 63), 253663#(<= ULTIMATE.start_main_~x~4 70), 253662#(<= ULTIMATE.start_main_~x~4 69), 253661#(<= ULTIMATE.start_main_~x~4 68), 253660#(<= ULTIMATE.start_main_~x~4 67), 253667#(<= ULTIMATE.start_main_~x~4 74), 253666#(<= ULTIMATE.start_main_~x~4 73), 253665#(<= ULTIMATE.start_main_~x~4 72), 253664#(<= ULTIMATE.start_main_~x~4 71), 253671#(<= ULTIMATE.start_main_~x~4 78), 253670#(<= ULTIMATE.start_main_~x~4 77), 253669#(<= ULTIMATE.start_main_~x~4 76), 253668#(<= ULTIMATE.start_main_~x~4 75), 253675#(<= ULTIMATE.start_main_~x~4 82), 253674#(<= ULTIMATE.start_main_~x~4 81), 253673#(<= ULTIMATE.start_main_~x~4 80), 253672#(<= ULTIMATE.start_main_~x~4 79), 253679#(<= ULTIMATE.start_main_~x~4 86), 253678#(<= ULTIMATE.start_main_~x~4 85), 253677#(<= ULTIMATE.start_main_~x~4 84), 253676#(<= ULTIMATE.start_main_~x~4 83), 253683#(<= ULTIMATE.start_main_~x~4 90), 253682#(<= ULTIMATE.start_main_~x~4 89), 253681#(<= ULTIMATE.start_main_~x~4 88), 253680#(<= ULTIMATE.start_main_~x~4 87), 253687#(<= ULTIMATE.start_main_~x~4 94), 253686#(<= ULTIMATE.start_main_~x~4 93), 253685#(<= ULTIMATE.start_main_~x~4 92), 253684#(<= ULTIMATE.start_main_~x~4 91), 253691#(<= ULTIMATE.start_main_~x~4 98), 253690#(<= ULTIMATE.start_main_~x~4 97), 253689#(<= ULTIMATE.start_main_~x~4 96), 253688#(<= ULTIMATE.start_main_~x~4 95), 253693#(<= ULTIMATE.start_main_~x~4 100), 253692#(<= ULTIMATE.start_main_~x~4 99)] [2018-07-23 13:43:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 609500 backedges. 0 proven. 604000 refuted. 0 times theorem prover too weak. 5500 trivial. 0 not checked. [2018-07-23 13:43:55,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 13:43:55,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 13:43:55,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 13:43:55,534 INFO L87 Difference]: Start difference. First operand 1204 states and 1304 transitions. Second operand 103 states. [2018-07-23 13:43:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:43:57,271 INFO L93 Difference]: Finished difference Result 1229 states and 1331 transitions. [2018-07-23 13:43:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 13:43:57,271 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1203 [2018-07-23 13:43:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:43:57,273 INFO L225 Difference]: With dead ends: 1229 [2018-07-23 13:43:57,273 INFO L226 Difference]: Without dead ends: 1227 [2018-07-23 13:43:57,274 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 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:43:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-07-23 13:43:58,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1216. [2018-07-23 13:43:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-07-23 13:43:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1317 transitions. [2018-07-23 13:43:58,751 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1317 transitions. Word has length 1203 [2018-07-23 13:43:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:43:58,752 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1317 transitions. [2018-07-23 13:43:58,752 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 13:43:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1317 transitions. [2018-07-23 13:43:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2018-07-23 13:43:58,760 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:43:58,760 INFO L357 BasicCegarLoop]: trace histogram [1010, 101, 101, 1, 1, 1] [2018-07-23 13:43:58,760 INFO L414 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:43:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash 156884789, now seen corresponding path program 110 times [2018-07-23 13:43:58,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:43:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 621756 backedges. 0 proven. 616201 refuted. 0 times theorem prover too weak. 5555 trivial. 0 not checked. [2018-07-23 13:44:00,722 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:00,722 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 13:44:00,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:00,723 INFO L185 omatonBuilderFactory]: Interpolants [258587#(<= ULTIMATE.start_main_~x~4 1), 258586#(<= ULTIMATE.start_main_~x~4 0), 258585#false, 258584#true, 258591#(<= ULTIMATE.start_main_~x~4 5), 258590#(<= ULTIMATE.start_main_~x~4 4), 258589#(<= ULTIMATE.start_main_~x~4 3), 258588#(<= ULTIMATE.start_main_~x~4 2), 258595#(<= ULTIMATE.start_main_~x~4 9), 258594#(<= ULTIMATE.start_main_~x~4 8), 258593#(<= ULTIMATE.start_main_~x~4 7), 258592#(<= ULTIMATE.start_main_~x~4 6), 258599#(<= ULTIMATE.start_main_~x~4 13), 258598#(<= ULTIMATE.start_main_~x~4 12), 258597#(<= ULTIMATE.start_main_~x~4 11), 258596#(<= ULTIMATE.start_main_~x~4 10), 258603#(<= ULTIMATE.start_main_~x~4 17), 258602#(<= ULTIMATE.start_main_~x~4 16), 258601#(<= ULTIMATE.start_main_~x~4 15), 258600#(<= ULTIMATE.start_main_~x~4 14), 258607#(<= ULTIMATE.start_main_~x~4 21), 258606#(<= ULTIMATE.start_main_~x~4 20), 258605#(<= ULTIMATE.start_main_~x~4 19), 258604#(<= ULTIMATE.start_main_~x~4 18), 258611#(<= ULTIMATE.start_main_~x~4 25), 258610#(<= ULTIMATE.start_main_~x~4 24), 258609#(<= ULTIMATE.start_main_~x~4 23), 258608#(<= ULTIMATE.start_main_~x~4 22), 258615#(<= ULTIMATE.start_main_~x~4 29), 258614#(<= ULTIMATE.start_main_~x~4 28), 258613#(<= ULTIMATE.start_main_~x~4 27), 258612#(<= ULTIMATE.start_main_~x~4 26), 258619#(<= ULTIMATE.start_main_~x~4 33), 258618#(<= ULTIMATE.start_main_~x~4 32), 258617#(<= ULTIMATE.start_main_~x~4 31), 258616#(<= ULTIMATE.start_main_~x~4 30), 258623#(<= ULTIMATE.start_main_~x~4 37), 258622#(<= ULTIMATE.start_main_~x~4 36), 258621#(<= ULTIMATE.start_main_~x~4 35), 258620#(<= ULTIMATE.start_main_~x~4 34), 258627#(<= ULTIMATE.start_main_~x~4 41), 258626#(<= ULTIMATE.start_main_~x~4 40), 258625#(<= ULTIMATE.start_main_~x~4 39), 258624#(<= ULTIMATE.start_main_~x~4 38), 258631#(<= ULTIMATE.start_main_~x~4 45), 258630#(<= ULTIMATE.start_main_~x~4 44), 258629#(<= ULTIMATE.start_main_~x~4 43), 258628#(<= ULTIMATE.start_main_~x~4 42), 258635#(<= ULTIMATE.start_main_~x~4 49), 258634#(<= ULTIMATE.start_main_~x~4 48), 258633#(<= ULTIMATE.start_main_~x~4 47), 258632#(<= ULTIMATE.start_main_~x~4 46), 258639#(<= ULTIMATE.start_main_~x~4 53), 258638#(<= ULTIMATE.start_main_~x~4 52), 258637#(<= ULTIMATE.start_main_~x~4 51), 258636#(<= ULTIMATE.start_main_~x~4 50), 258643#(<= ULTIMATE.start_main_~x~4 57), 258642#(<= ULTIMATE.start_main_~x~4 56), 258641#(<= ULTIMATE.start_main_~x~4 55), 258640#(<= ULTIMATE.start_main_~x~4 54), 258647#(<= ULTIMATE.start_main_~x~4 61), 258646#(<= ULTIMATE.start_main_~x~4 60), 258645#(<= ULTIMATE.start_main_~x~4 59), 258644#(<= ULTIMATE.start_main_~x~4 58), 258651#(<= ULTIMATE.start_main_~x~4 65), 258650#(<= ULTIMATE.start_main_~x~4 64), 258649#(<= ULTIMATE.start_main_~x~4 63), 258648#(<= ULTIMATE.start_main_~x~4 62), 258655#(<= ULTIMATE.start_main_~x~4 69), 258654#(<= ULTIMATE.start_main_~x~4 68), 258653#(<= ULTIMATE.start_main_~x~4 67), 258652#(<= ULTIMATE.start_main_~x~4 66), 258659#(<= ULTIMATE.start_main_~x~4 73), 258658#(<= ULTIMATE.start_main_~x~4 72), 258657#(<= ULTIMATE.start_main_~x~4 71), 258656#(<= ULTIMATE.start_main_~x~4 70), 258663#(<= ULTIMATE.start_main_~x~4 77), 258662#(<= ULTIMATE.start_main_~x~4 76), 258661#(<= ULTIMATE.start_main_~x~4 75), 258660#(<= ULTIMATE.start_main_~x~4 74), 258667#(<= ULTIMATE.start_main_~x~4 81), 258666#(<= ULTIMATE.start_main_~x~4 80), 258665#(<= ULTIMATE.start_main_~x~4 79), 258664#(<= ULTIMATE.start_main_~x~4 78), 258671#(<= ULTIMATE.start_main_~x~4 85), 258670#(<= ULTIMATE.start_main_~x~4 84), 258669#(<= ULTIMATE.start_main_~x~4 83), 258668#(<= ULTIMATE.start_main_~x~4 82), 258675#(<= ULTIMATE.start_main_~x~4 89), 258674#(<= ULTIMATE.start_main_~x~4 88), 258673#(<= ULTIMATE.start_main_~x~4 87), 258672#(<= ULTIMATE.start_main_~x~4 86), 258679#(<= ULTIMATE.start_main_~x~4 93), 258678#(<= ULTIMATE.start_main_~x~4 92), 258677#(<= ULTIMATE.start_main_~x~4 91), 258676#(<= ULTIMATE.start_main_~x~4 90), 258683#(<= ULTIMATE.start_main_~x~4 97), 258682#(<= ULTIMATE.start_main_~x~4 96), 258681#(<= ULTIMATE.start_main_~x~4 95), 258680#(<= ULTIMATE.start_main_~x~4 94), 258687#(<= ULTIMATE.start_main_~x~4 101), 258686#(<= ULTIMATE.start_main_~x~4 100), 258685#(<= ULTIMATE.start_main_~x~4 99), 258684#(<= ULTIMATE.start_main_~x~4 98)] [2018-07-23 13:44:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 621756 backedges. 0 proven. 616201 refuted. 0 times theorem prover too weak. 5555 trivial. 0 not checked. [2018-07-23 13:44:00,741 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 13:44:00,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 13:44:00,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:44:00,742 INFO L87 Difference]: Start difference. First operand 1216 states and 1317 transitions. Second operand 104 states. [2018-07-23 13:44:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:02,510 INFO L93 Difference]: Finished difference Result 1241 states and 1344 transitions. [2018-07-23 13:44:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 13:44:02,511 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 1215 [2018-07-23 13:44:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:02,512 INFO L225 Difference]: With dead ends: 1241 [2018-07-23 13:44:02,512 INFO L226 Difference]: Without dead ends: 1239 [2018-07-23 13:44:02,513 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 13:44:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-07-23 13:44:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1228. [2018-07-23 13:44:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-07-23 13:44:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1330 transitions. [2018-07-23 13:44:04,068 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1330 transitions. Word has length 1215 [2018-07-23 13:44:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:04,069 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1330 transitions. [2018-07-23 13:44:04,069 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 13:44:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1330 transitions. [2018-07-23 13:44:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2018-07-23 13:44:04,076 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:04,077 INFO L357 BasicCegarLoop]: trace histogram [1020, 102, 102, 1, 1, 1] [2018-07-23 13:44:04,077 INFO L414 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash 565377919, now seen corresponding path program 111 times [2018-07-23 13:44:04,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 634134 backedges. 0 proven. 628524 refuted. 0 times theorem prover too weak. 5610 trivial. 0 not checked. [2018-07-23 13:44:05,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:05,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 13:44:05,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:05,395 INFO L185 omatonBuilderFactory]: Interpolants [263684#(<= ULTIMATE.start_main_~x~4 56), 263685#(<= ULTIMATE.start_main_~x~4 57), 263686#(<= ULTIMATE.start_main_~x~4 58), 263687#(<= ULTIMATE.start_main_~x~4 59), 263680#(<= ULTIMATE.start_main_~x~4 52), 263681#(<= ULTIMATE.start_main_~x~4 53), 263682#(<= ULTIMATE.start_main_~x~4 54), 263683#(<= ULTIMATE.start_main_~x~4 55), 263692#(<= ULTIMATE.start_main_~x~4 64), 263693#(<= ULTIMATE.start_main_~x~4 65), 263694#(<= ULTIMATE.start_main_~x~4 66), 263695#(<= ULTIMATE.start_main_~x~4 67), 263688#(<= ULTIMATE.start_main_~x~4 60), 263689#(<= ULTIMATE.start_main_~x~4 61), 263690#(<= ULTIMATE.start_main_~x~4 62), 263691#(<= ULTIMATE.start_main_~x~4 63), 263700#(<= ULTIMATE.start_main_~x~4 72), 263701#(<= ULTIMATE.start_main_~x~4 73), 263702#(<= ULTIMATE.start_main_~x~4 74), 263703#(<= ULTIMATE.start_main_~x~4 75), 263696#(<= ULTIMATE.start_main_~x~4 68), 263697#(<= ULTIMATE.start_main_~x~4 69), 263698#(<= ULTIMATE.start_main_~x~4 70), 263699#(<= ULTIMATE.start_main_~x~4 71), 263708#(<= ULTIMATE.start_main_~x~4 80), 263709#(<= ULTIMATE.start_main_~x~4 81), 263710#(<= ULTIMATE.start_main_~x~4 82), 263711#(<= ULTIMATE.start_main_~x~4 83), 263704#(<= ULTIMATE.start_main_~x~4 76), 263705#(<= ULTIMATE.start_main_~x~4 77), 263706#(<= ULTIMATE.start_main_~x~4 78), 263707#(<= ULTIMATE.start_main_~x~4 79), 263716#(<= ULTIMATE.start_main_~x~4 88), 263717#(<= ULTIMATE.start_main_~x~4 89), 263718#(<= ULTIMATE.start_main_~x~4 90), 263719#(<= ULTIMATE.start_main_~x~4 91), 263712#(<= ULTIMATE.start_main_~x~4 84), 263713#(<= ULTIMATE.start_main_~x~4 85), 263714#(<= ULTIMATE.start_main_~x~4 86), 263715#(<= ULTIMATE.start_main_~x~4 87), 263724#(<= ULTIMATE.start_main_~x~4 96), 263725#(<= ULTIMATE.start_main_~x~4 97), 263726#(<= ULTIMATE.start_main_~x~4 98), 263727#(<= ULTIMATE.start_main_~x~4 99), 263720#(<= ULTIMATE.start_main_~x~4 92), 263721#(<= ULTIMATE.start_main_~x~4 93), 263722#(<= ULTIMATE.start_main_~x~4 94), 263723#(<= ULTIMATE.start_main_~x~4 95), 263728#(<= ULTIMATE.start_main_~x~4 100), 263729#(<= ULTIMATE.start_main_~x~4 101), 263730#(<= ULTIMATE.start_main_~x~4 102), 263628#(<= ULTIMATE.start_main_~x~4 0), 263629#(<= ULTIMATE.start_main_~x~4 1), 263630#(<= ULTIMATE.start_main_~x~4 2), 263631#(<= ULTIMATE.start_main_~x~4 3), 263626#true, 263627#false, 263636#(<= ULTIMATE.start_main_~x~4 8), 263637#(<= ULTIMATE.start_main_~x~4 9), 263638#(<= ULTIMATE.start_main_~x~4 10), 263639#(<= ULTIMATE.start_main_~x~4 11), 263632#(<= ULTIMATE.start_main_~x~4 4), 263633#(<= ULTIMATE.start_main_~x~4 5), 263634#(<= ULTIMATE.start_main_~x~4 6), 263635#(<= ULTIMATE.start_main_~x~4 7), 263644#(<= ULTIMATE.start_main_~x~4 16), 263645#(<= ULTIMATE.start_main_~x~4 17), 263646#(<= ULTIMATE.start_main_~x~4 18), 263647#(<= ULTIMATE.start_main_~x~4 19), 263640#(<= ULTIMATE.start_main_~x~4 12), 263641#(<= ULTIMATE.start_main_~x~4 13), 263642#(<= ULTIMATE.start_main_~x~4 14), 263643#(<= ULTIMATE.start_main_~x~4 15), 263652#(<= ULTIMATE.start_main_~x~4 24), 263653#(<= ULTIMATE.start_main_~x~4 25), 263654#(<= ULTIMATE.start_main_~x~4 26), 263655#(<= ULTIMATE.start_main_~x~4 27), 263648#(<= ULTIMATE.start_main_~x~4 20), 263649#(<= ULTIMATE.start_main_~x~4 21), 263650#(<= ULTIMATE.start_main_~x~4 22), 263651#(<= ULTIMATE.start_main_~x~4 23), 263660#(<= ULTIMATE.start_main_~x~4 32), 263661#(<= ULTIMATE.start_main_~x~4 33), 263662#(<= ULTIMATE.start_main_~x~4 34), 263663#(<= ULTIMATE.start_main_~x~4 35), 263656#(<= ULTIMATE.start_main_~x~4 28), 263657#(<= ULTIMATE.start_main_~x~4 29), 263658#(<= ULTIMATE.start_main_~x~4 30), 263659#(<= ULTIMATE.start_main_~x~4 31), 263668#(<= ULTIMATE.start_main_~x~4 40), 263669#(<= ULTIMATE.start_main_~x~4 41), 263670#(<= ULTIMATE.start_main_~x~4 42), 263671#(<= ULTIMATE.start_main_~x~4 43), 263664#(<= ULTIMATE.start_main_~x~4 36), 263665#(<= ULTIMATE.start_main_~x~4 37), 263666#(<= ULTIMATE.start_main_~x~4 38), 263667#(<= ULTIMATE.start_main_~x~4 39), 263676#(<= ULTIMATE.start_main_~x~4 48), 263677#(<= ULTIMATE.start_main_~x~4 49), 263678#(<= ULTIMATE.start_main_~x~4 50), 263679#(<= ULTIMATE.start_main_~x~4 51), 263672#(<= ULTIMATE.start_main_~x~4 44), 263673#(<= ULTIMATE.start_main_~x~4 45), 263674#(<= ULTIMATE.start_main_~x~4 46), 263675#(<= ULTIMATE.start_main_~x~4 47)] [2018-07-23 13:44:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 634134 backedges. 0 proven. 628524 refuted. 0 times theorem prover too weak. 5610 trivial. 0 not checked. [2018-07-23 13:44:05,414 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 13:44:05,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 13:44:05,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:44:05,415 INFO L87 Difference]: Start difference. First operand 1228 states and 1330 transitions. Second operand 105 states. [2018-07-23 13:44:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:07,069 INFO L93 Difference]: Finished difference Result 1253 states and 1357 transitions. [2018-07-23 13:44:07,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 13:44:07,069 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1227 [2018-07-23 13:44:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:07,071 INFO L225 Difference]: With dead ends: 1253 [2018-07-23 13:44:07,071 INFO L226 Difference]: Without dead ends: 1251 [2018-07-23 13:44:07,071 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 13:44:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-07-23 13:44:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1240. [2018-07-23 13:44:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2018-07-23 13:44:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1343 transitions. [2018-07-23 13:44:08,640 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1343 transitions. Word has length 1227 [2018-07-23 13:44:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:08,640 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1343 transitions. [2018-07-23 13:44:08,640 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 13:44:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1343 transitions. [2018-07-23 13:44:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1240 [2018-07-23 13:44:08,648 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:08,649 INFO L357 BasicCegarLoop]: trace histogram [1030, 103, 103, 1, 1, 1] [2018-07-23 13:44:08,649 INFO L414 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1021183799, now seen corresponding path program 112 times [2018-07-23 13:44:08,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 646634 backedges. 0 proven. 640969 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2018-07-23 13:44:09,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:09,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 13:44:09,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:09,982 INFO L185 omatonBuilderFactory]: Interpolants [268804#(<= ULTIMATE.start_main_~x~4 85), 268805#(<= ULTIMATE.start_main_~x~4 86), 268806#(<= ULTIMATE.start_main_~x~4 87), 268807#(<= ULTIMATE.start_main_~x~4 88), 268800#(<= ULTIMATE.start_main_~x~4 81), 268801#(<= ULTIMATE.start_main_~x~4 82), 268802#(<= ULTIMATE.start_main_~x~4 83), 268803#(<= ULTIMATE.start_main_~x~4 84), 268812#(<= ULTIMATE.start_main_~x~4 93), 268813#(<= ULTIMATE.start_main_~x~4 94), 268814#(<= ULTIMATE.start_main_~x~4 95), 268815#(<= ULTIMATE.start_main_~x~4 96), 268808#(<= ULTIMATE.start_main_~x~4 89), 268809#(<= ULTIMATE.start_main_~x~4 90), 268810#(<= ULTIMATE.start_main_~x~4 91), 268811#(<= ULTIMATE.start_main_~x~4 92), 268820#(<= ULTIMATE.start_main_~x~4 101), 268821#(<= ULTIMATE.start_main_~x~4 102), 268822#(<= ULTIMATE.start_main_~x~4 103), 268816#(<= ULTIMATE.start_main_~x~4 97), 268817#(<= ULTIMATE.start_main_~x~4 98), 268818#(<= ULTIMATE.start_main_~x~4 99), 268819#(<= ULTIMATE.start_main_~x~4 100), 268717#true, 268718#false, 268719#(<= ULTIMATE.start_main_~x~4 0), 268724#(<= ULTIMATE.start_main_~x~4 5), 268725#(<= ULTIMATE.start_main_~x~4 6), 268726#(<= ULTIMATE.start_main_~x~4 7), 268727#(<= ULTIMATE.start_main_~x~4 8), 268720#(<= ULTIMATE.start_main_~x~4 1), 268721#(<= ULTIMATE.start_main_~x~4 2), 268722#(<= ULTIMATE.start_main_~x~4 3), 268723#(<= ULTIMATE.start_main_~x~4 4), 268732#(<= ULTIMATE.start_main_~x~4 13), 268733#(<= ULTIMATE.start_main_~x~4 14), 268734#(<= ULTIMATE.start_main_~x~4 15), 268735#(<= ULTIMATE.start_main_~x~4 16), 268728#(<= ULTIMATE.start_main_~x~4 9), 268729#(<= ULTIMATE.start_main_~x~4 10), 268730#(<= ULTIMATE.start_main_~x~4 11), 268731#(<= ULTIMATE.start_main_~x~4 12), 268740#(<= ULTIMATE.start_main_~x~4 21), 268741#(<= ULTIMATE.start_main_~x~4 22), 268742#(<= ULTIMATE.start_main_~x~4 23), 268743#(<= ULTIMATE.start_main_~x~4 24), 268736#(<= ULTIMATE.start_main_~x~4 17), 268737#(<= ULTIMATE.start_main_~x~4 18), 268738#(<= ULTIMATE.start_main_~x~4 19), 268739#(<= ULTIMATE.start_main_~x~4 20), 268748#(<= ULTIMATE.start_main_~x~4 29), 268749#(<= ULTIMATE.start_main_~x~4 30), 268750#(<= ULTIMATE.start_main_~x~4 31), 268751#(<= ULTIMATE.start_main_~x~4 32), 268744#(<= ULTIMATE.start_main_~x~4 25), 268745#(<= ULTIMATE.start_main_~x~4 26), 268746#(<= ULTIMATE.start_main_~x~4 27), 268747#(<= ULTIMATE.start_main_~x~4 28), 268756#(<= ULTIMATE.start_main_~x~4 37), 268757#(<= ULTIMATE.start_main_~x~4 38), 268758#(<= ULTIMATE.start_main_~x~4 39), 268759#(<= ULTIMATE.start_main_~x~4 40), 268752#(<= ULTIMATE.start_main_~x~4 33), 268753#(<= ULTIMATE.start_main_~x~4 34), 268754#(<= ULTIMATE.start_main_~x~4 35), 268755#(<= ULTIMATE.start_main_~x~4 36), 268764#(<= ULTIMATE.start_main_~x~4 45), 268765#(<= ULTIMATE.start_main_~x~4 46), 268766#(<= ULTIMATE.start_main_~x~4 47), 268767#(<= ULTIMATE.start_main_~x~4 48), 268760#(<= ULTIMATE.start_main_~x~4 41), 268761#(<= ULTIMATE.start_main_~x~4 42), 268762#(<= ULTIMATE.start_main_~x~4 43), 268763#(<= ULTIMATE.start_main_~x~4 44), 268772#(<= ULTIMATE.start_main_~x~4 53), 268773#(<= ULTIMATE.start_main_~x~4 54), 268774#(<= ULTIMATE.start_main_~x~4 55), 268775#(<= ULTIMATE.start_main_~x~4 56), 268768#(<= ULTIMATE.start_main_~x~4 49), 268769#(<= ULTIMATE.start_main_~x~4 50), 268770#(<= ULTIMATE.start_main_~x~4 51), 268771#(<= ULTIMATE.start_main_~x~4 52), 268780#(<= ULTIMATE.start_main_~x~4 61), 268781#(<= ULTIMATE.start_main_~x~4 62), 268782#(<= ULTIMATE.start_main_~x~4 63), 268783#(<= ULTIMATE.start_main_~x~4 64), 268776#(<= ULTIMATE.start_main_~x~4 57), 268777#(<= ULTIMATE.start_main_~x~4 58), 268778#(<= ULTIMATE.start_main_~x~4 59), 268779#(<= ULTIMATE.start_main_~x~4 60), 268788#(<= ULTIMATE.start_main_~x~4 69), 268789#(<= ULTIMATE.start_main_~x~4 70), 268790#(<= ULTIMATE.start_main_~x~4 71), 268791#(<= ULTIMATE.start_main_~x~4 72), 268784#(<= ULTIMATE.start_main_~x~4 65), 268785#(<= ULTIMATE.start_main_~x~4 66), 268786#(<= ULTIMATE.start_main_~x~4 67), 268787#(<= ULTIMATE.start_main_~x~4 68), 268796#(<= ULTIMATE.start_main_~x~4 77), 268797#(<= ULTIMATE.start_main_~x~4 78), 268798#(<= ULTIMATE.start_main_~x~4 79), 268799#(<= ULTIMATE.start_main_~x~4 80), 268792#(<= ULTIMATE.start_main_~x~4 73), 268793#(<= ULTIMATE.start_main_~x~4 74), 268794#(<= ULTIMATE.start_main_~x~4 75), 268795#(<= ULTIMATE.start_main_~x~4 76)] [2018-07-23 13:44:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 646634 backedges. 0 proven. 640969 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2018-07-23 13:44:10,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 13:44:10,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 13:44:10,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:44:10,002 INFO L87 Difference]: Start difference. First operand 1240 states and 1343 transitions. Second operand 106 states. [2018-07-23 13:44:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:11,766 INFO L93 Difference]: Finished difference Result 1265 states and 1370 transitions. [2018-07-23 13:44:11,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 13:44:11,766 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 1239 [2018-07-23 13:44:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:11,768 INFO L225 Difference]: With dead ends: 1265 [2018-07-23 13:44:11,768 INFO L226 Difference]: Without dead ends: 1263 [2018-07-23 13:44:11,769 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 13:44:11,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-07-23 13:44:13,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1252. [2018-07-23 13:44:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-07-23 13:44:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1356 transitions. [2018-07-23 13:44:13,391 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1356 transitions. Word has length 1239 [2018-07-23 13:44:13,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:13,392 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1356 transitions. [2018-07-23 13:44:13,392 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 13:44:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1356 transitions. [2018-07-23 13:44:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1252 [2018-07-23 13:44:13,399 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:13,400 INFO L357 BasicCegarLoop]: trace histogram [1040, 104, 104, 1, 1, 1] [2018-07-23 13:44:13,400 INFO L414 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash 517822227, now seen corresponding path program 113 times [2018-07-23 13:44:13,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 659256 backedges. 0 proven. 653536 refuted. 0 times theorem prover too weak. 5720 trivial. 0 not checked. [2018-07-23 13:44:14,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:14,792 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 13:44:14,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:14,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:14,793 INFO L185 omatonBuilderFactory]: Interpolants [273924#(<= ULTIMATE.start_main_~x~4 65), 273925#(<= ULTIMATE.start_main_~x~4 66), 273926#(<= ULTIMATE.start_main_~x~4 67), 273927#(<= ULTIMATE.start_main_~x~4 68), 273920#(<= ULTIMATE.start_main_~x~4 61), 273921#(<= ULTIMATE.start_main_~x~4 62), 273922#(<= ULTIMATE.start_main_~x~4 63), 273923#(<= ULTIMATE.start_main_~x~4 64), 273932#(<= ULTIMATE.start_main_~x~4 73), 273933#(<= ULTIMATE.start_main_~x~4 74), 273934#(<= ULTIMATE.start_main_~x~4 75), 273935#(<= ULTIMATE.start_main_~x~4 76), 273928#(<= ULTIMATE.start_main_~x~4 69), 273929#(<= ULTIMATE.start_main_~x~4 70), 273930#(<= ULTIMATE.start_main_~x~4 71), 273931#(<= ULTIMATE.start_main_~x~4 72), 273940#(<= ULTIMATE.start_main_~x~4 81), 273941#(<= ULTIMATE.start_main_~x~4 82), 273942#(<= ULTIMATE.start_main_~x~4 83), 273943#(<= ULTIMATE.start_main_~x~4 84), 273936#(<= ULTIMATE.start_main_~x~4 77), 273937#(<= ULTIMATE.start_main_~x~4 78), 273938#(<= ULTIMATE.start_main_~x~4 79), 273939#(<= ULTIMATE.start_main_~x~4 80), 273948#(<= ULTIMATE.start_main_~x~4 89), 273949#(<= ULTIMATE.start_main_~x~4 90), 273950#(<= ULTIMATE.start_main_~x~4 91), 273951#(<= ULTIMATE.start_main_~x~4 92), 273944#(<= ULTIMATE.start_main_~x~4 85), 273945#(<= ULTIMATE.start_main_~x~4 86), 273946#(<= ULTIMATE.start_main_~x~4 87), 273947#(<= ULTIMATE.start_main_~x~4 88), 273956#(<= ULTIMATE.start_main_~x~4 97), 273957#(<= ULTIMATE.start_main_~x~4 98), 273958#(<= ULTIMATE.start_main_~x~4 99), 273959#(<= ULTIMATE.start_main_~x~4 100), 273952#(<= ULTIMATE.start_main_~x~4 93), 273953#(<= ULTIMATE.start_main_~x~4 94), 273954#(<= ULTIMATE.start_main_~x~4 95), 273955#(<= ULTIMATE.start_main_~x~4 96), 273960#(<= ULTIMATE.start_main_~x~4 101), 273961#(<= ULTIMATE.start_main_~x~4 102), 273962#(<= ULTIMATE.start_main_~x~4 103), 273963#(<= ULTIMATE.start_main_~x~4 104), 273860#(<= ULTIMATE.start_main_~x~4 1), 273861#(<= ULTIMATE.start_main_~x~4 2), 273862#(<= ULTIMATE.start_main_~x~4 3), 273863#(<= ULTIMATE.start_main_~x~4 4), 273857#true, 273858#false, 273859#(<= ULTIMATE.start_main_~x~4 0), 273868#(<= ULTIMATE.start_main_~x~4 9), 273869#(<= ULTIMATE.start_main_~x~4 10), 273870#(<= ULTIMATE.start_main_~x~4 11), 273871#(<= ULTIMATE.start_main_~x~4 12), 273864#(<= ULTIMATE.start_main_~x~4 5), 273865#(<= ULTIMATE.start_main_~x~4 6), 273866#(<= ULTIMATE.start_main_~x~4 7), 273867#(<= ULTIMATE.start_main_~x~4 8), 273876#(<= ULTIMATE.start_main_~x~4 17), 273877#(<= ULTIMATE.start_main_~x~4 18), 273878#(<= ULTIMATE.start_main_~x~4 19), 273879#(<= ULTIMATE.start_main_~x~4 20), 273872#(<= ULTIMATE.start_main_~x~4 13), 273873#(<= ULTIMATE.start_main_~x~4 14), 273874#(<= ULTIMATE.start_main_~x~4 15), 273875#(<= ULTIMATE.start_main_~x~4 16), 273884#(<= ULTIMATE.start_main_~x~4 25), 273885#(<= ULTIMATE.start_main_~x~4 26), 273886#(<= ULTIMATE.start_main_~x~4 27), 273887#(<= ULTIMATE.start_main_~x~4 28), 273880#(<= ULTIMATE.start_main_~x~4 21), 273881#(<= ULTIMATE.start_main_~x~4 22), 273882#(<= ULTIMATE.start_main_~x~4 23), 273883#(<= ULTIMATE.start_main_~x~4 24), 273892#(<= ULTIMATE.start_main_~x~4 33), 273893#(<= ULTIMATE.start_main_~x~4 34), 273894#(<= ULTIMATE.start_main_~x~4 35), 273895#(<= ULTIMATE.start_main_~x~4 36), 273888#(<= ULTIMATE.start_main_~x~4 29), 273889#(<= ULTIMATE.start_main_~x~4 30), 273890#(<= ULTIMATE.start_main_~x~4 31), 273891#(<= ULTIMATE.start_main_~x~4 32), 273900#(<= ULTIMATE.start_main_~x~4 41), 273901#(<= ULTIMATE.start_main_~x~4 42), 273902#(<= ULTIMATE.start_main_~x~4 43), 273903#(<= ULTIMATE.start_main_~x~4 44), 273896#(<= ULTIMATE.start_main_~x~4 37), 273897#(<= ULTIMATE.start_main_~x~4 38), 273898#(<= ULTIMATE.start_main_~x~4 39), 273899#(<= ULTIMATE.start_main_~x~4 40), 273908#(<= ULTIMATE.start_main_~x~4 49), 273909#(<= ULTIMATE.start_main_~x~4 50), 273910#(<= ULTIMATE.start_main_~x~4 51), 273911#(<= ULTIMATE.start_main_~x~4 52), 273904#(<= ULTIMATE.start_main_~x~4 45), 273905#(<= ULTIMATE.start_main_~x~4 46), 273906#(<= ULTIMATE.start_main_~x~4 47), 273907#(<= ULTIMATE.start_main_~x~4 48), 273916#(<= ULTIMATE.start_main_~x~4 57), 273917#(<= ULTIMATE.start_main_~x~4 58), 273918#(<= ULTIMATE.start_main_~x~4 59), 273919#(<= ULTIMATE.start_main_~x~4 60), 273912#(<= ULTIMATE.start_main_~x~4 53), 273913#(<= ULTIMATE.start_main_~x~4 54), 273914#(<= ULTIMATE.start_main_~x~4 55), 273915#(<= ULTIMATE.start_main_~x~4 56)] [2018-07-23 13:44:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 659256 backedges. 0 proven. 653536 refuted. 0 times theorem prover too weak. 5720 trivial. 0 not checked. [2018-07-23 13:44:14,812 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 13:44:14,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 13:44:14,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 13:44:14,813 INFO L87 Difference]: Start difference. First operand 1252 states and 1356 transitions. Second operand 107 states. [2018-07-23 13:44:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:16,564 INFO L93 Difference]: Finished difference Result 1277 states and 1383 transitions. [2018-07-23 13:44:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 13:44:16,564 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 1251 [2018-07-23 13:44:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:16,566 INFO L225 Difference]: With dead ends: 1277 [2018-07-23 13:44:16,566 INFO L226 Difference]: Without dead ends: 1275 [2018-07-23 13:44:16,567 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 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:44:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-07-23 13:44:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1264. [2018-07-23 13:44:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2018-07-23 13:44:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1369 transitions. [2018-07-23 13:44:18,208 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1369 transitions. Word has length 1251 [2018-07-23 13:44:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:18,208 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1369 transitions. [2018-07-23 13:44:18,208 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 13:44:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1369 transitions. [2018-07-23 13:44:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1264 [2018-07-23 13:44:18,216 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:18,216 INFO L357 BasicCegarLoop]: trace histogram [1050, 105, 105, 1, 1, 1] [2018-07-23 13:44:18,217 INFO L414 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash -933521827, now seen corresponding path program 114 times [2018-07-23 13:44:18,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 672000 backedges. 0 proven. 666225 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-07-23 13:44:19,593 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:19,593 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 13:44:19,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:19,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:44:19,594 INFO L185 omatonBuilderFactory]: Interpolants [279046#true, 279047#false, 279052#(<= ULTIMATE.start_main_~x~4 4), 279053#(<= ULTIMATE.start_main_~x~4 5), 279054#(<= ULTIMATE.start_main_~x~4 6), 279055#(<= ULTIMATE.start_main_~x~4 7), 279048#(<= ULTIMATE.start_main_~x~4 0), 279049#(<= ULTIMATE.start_main_~x~4 1), 279050#(<= ULTIMATE.start_main_~x~4 2), 279051#(<= ULTIMATE.start_main_~x~4 3), 279060#(<= ULTIMATE.start_main_~x~4 12), 279061#(<= ULTIMATE.start_main_~x~4 13), 279062#(<= ULTIMATE.start_main_~x~4 14), 279063#(<= ULTIMATE.start_main_~x~4 15), 279056#(<= ULTIMATE.start_main_~x~4 8), 279057#(<= ULTIMATE.start_main_~x~4 9), 279058#(<= ULTIMATE.start_main_~x~4 10), 279059#(<= ULTIMATE.start_main_~x~4 11), 279068#(<= ULTIMATE.start_main_~x~4 20), 279069#(<= ULTIMATE.start_main_~x~4 21), 279070#(<= ULTIMATE.start_main_~x~4 22), 279071#(<= ULTIMATE.start_main_~x~4 23), 279064#(<= ULTIMATE.start_main_~x~4 16), 279065#(<= ULTIMATE.start_main_~x~4 17), 279066#(<= ULTIMATE.start_main_~x~4 18), 279067#(<= ULTIMATE.start_main_~x~4 19), 279076#(<= ULTIMATE.start_main_~x~4 28), 279077#(<= ULTIMATE.start_main_~x~4 29), 279078#(<= ULTIMATE.start_main_~x~4 30), 279079#(<= ULTIMATE.start_main_~x~4 31), 279072#(<= ULTIMATE.start_main_~x~4 24), 279073#(<= ULTIMATE.start_main_~x~4 25), 279074#(<= ULTIMATE.start_main_~x~4 26), 279075#(<= ULTIMATE.start_main_~x~4 27), 279084#(<= ULTIMATE.start_main_~x~4 36), 279085#(<= ULTIMATE.start_main_~x~4 37), 279086#(<= ULTIMATE.start_main_~x~4 38), 279087#(<= ULTIMATE.start_main_~x~4 39), 279080#(<= ULTIMATE.start_main_~x~4 32), 279081#(<= ULTIMATE.start_main_~x~4 33), 279082#(<= ULTIMATE.start_main_~x~4 34), 279083#(<= ULTIMATE.start_main_~x~4 35), 279092#(<= ULTIMATE.start_main_~x~4 44), 279093#(<= ULTIMATE.start_main_~x~4 45), 279094#(<= ULTIMATE.start_main_~x~4 46), 279095#(<= ULTIMATE.start_main_~x~4 47), 279088#(<= ULTIMATE.start_main_~x~4 40), 279089#(<= ULTIMATE.start_main_~x~4 41), 279090#(<= ULTIMATE.start_main_~x~4 42), 279091#(<= ULTIMATE.start_main_~x~4 43), 279100#(<= ULTIMATE.start_main_~x~4 52), 279101#(<= ULTIMATE.start_main_~x~4 53), 279102#(<= ULTIMATE.start_main_~x~4 54), 279103#(<= ULTIMATE.start_main_~x~4 55), 279096#(<= ULTIMATE.start_main_~x~4 48), 279097#(<= ULTIMATE.start_main_~x~4 49), 279098#(<= ULTIMATE.start_main_~x~4 50), 279099#(<= ULTIMATE.start_main_~x~4 51), 279108#(<= ULTIMATE.start_main_~x~4 60), 279109#(<= ULTIMATE.start_main_~x~4 61), 279110#(<= ULTIMATE.start_main_~x~4 62), 279111#(<= ULTIMATE.start_main_~x~4 63), 279104#(<= ULTIMATE.start_main_~x~4 56), 279105#(<= ULTIMATE.start_main_~x~4 57), 279106#(<= ULTIMATE.start_main_~x~4 58), 279107#(<= ULTIMATE.start_main_~x~4 59), 279116#(<= ULTIMATE.start_main_~x~4 68), 279117#(<= ULTIMATE.start_main_~x~4 69), 279118#(<= ULTIMATE.start_main_~x~4 70), 279119#(<= ULTIMATE.start_main_~x~4 71), 279112#(<= ULTIMATE.start_main_~x~4 64), 279113#(<= ULTIMATE.start_main_~x~4 65), 279114#(<= ULTIMATE.start_main_~x~4 66), 279115#(<= ULTIMATE.start_main_~x~4 67), 279124#(<= ULTIMATE.start_main_~x~4 76), 279125#(<= ULTIMATE.start_main_~x~4 77), 279126#(<= ULTIMATE.start_main_~x~4 78), 279127#(<= ULTIMATE.start_main_~x~4 79), 279120#(<= ULTIMATE.start_main_~x~4 72), 279121#(<= ULTIMATE.start_main_~x~4 73), 279122#(<= ULTIMATE.start_main_~x~4 74), 279123#(<= ULTIMATE.start_main_~x~4 75), 279132#(<= ULTIMATE.start_main_~x~4 84), 279133#(<= ULTIMATE.start_main_~x~4 85), 279134#(<= ULTIMATE.start_main_~x~4 86), 279135#(<= ULTIMATE.start_main_~x~4 87), 279128#(<= ULTIMATE.start_main_~x~4 80), 279129#(<= ULTIMATE.start_main_~x~4 81), 279130#(<= ULTIMATE.start_main_~x~4 82), 279131#(<= ULTIMATE.start_main_~x~4 83), 279140#(<= ULTIMATE.start_main_~x~4 92), 279141#(<= ULTIMATE.start_main_~x~4 93), 279142#(<= ULTIMATE.start_main_~x~4 94), 279143#(<= ULTIMATE.start_main_~x~4 95), 279136#(<= ULTIMATE.start_main_~x~4 88), 279137#(<= ULTIMATE.start_main_~x~4 89), 279138#(<= ULTIMATE.start_main_~x~4 90), 279139#(<= ULTIMATE.start_main_~x~4 91), 279148#(<= ULTIMATE.start_main_~x~4 100), 279149#(<= ULTIMATE.start_main_~x~4 101), 279150#(<= ULTIMATE.start_main_~x~4 102), 279151#(<= ULTIMATE.start_main_~x~4 103), 279144#(<= ULTIMATE.start_main_~x~4 96), 279145#(<= ULTIMATE.start_main_~x~4 97), 279146#(<= ULTIMATE.start_main_~x~4 98), 279147#(<= ULTIMATE.start_main_~x~4 99), 279152#(<= ULTIMATE.start_main_~x~4 104), 279153#(<= ULTIMATE.start_main_~x~4 105)] [2018-07-23 13:44:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 672000 backedges. 0 proven. 666225 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-07-23 13:44:19,613 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 13:44:19,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 13:44:19,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:44:19,614 INFO L87 Difference]: Start difference. First operand 1264 states and 1369 transitions. Second operand 108 states. [2018-07-23 13:44:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:21,597 INFO L93 Difference]: Finished difference Result 1289 states and 1396 transitions. [2018-07-23 13:44:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 13:44:21,598 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 1263 [2018-07-23 13:44:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:21,599 INFO L225 Difference]: With dead ends: 1289 [2018-07-23 13:44:21,599 INFO L226 Difference]: Without dead ends: 1287 [2018-07-23 13:44:21,599 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 13:44:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2018-07-23 13:44:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1276. [2018-07-23 13:44:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2018-07-23 13:44:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1382 transitions. [2018-07-23 13:44:23,275 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1382 transitions. Word has length 1263 [2018-07-23 13:44:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:23,275 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1382 transitions. [2018-07-23 13:44:23,275 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 13:44:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1382 transitions. [2018-07-23 13:44:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1276 [2018-07-23 13:44:23,284 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:23,284 INFO L357 BasicCegarLoop]: trace histogram [1060, 106, 106, 1, 1, 1] [2018-07-23 13:44:23,284 INFO L414 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1431516839, now seen corresponding path program 115 times [2018-07-23 13:44:23,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 684866 backedges. 0 proven. 679036 refuted. 0 times theorem prover too weak. 5830 trivial. 0 not checked. [2018-07-23 13:44:24,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:24,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 13:44:24,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:24,705 INFO L185 omatonBuilderFactory]: Interpolants [284284#true, 284285#false, 284286#(<= ULTIMATE.start_main_~x~4 0), 284287#(<= ULTIMATE.start_main_~x~4 1), 284292#(<= ULTIMATE.start_main_~x~4 6), 284293#(<= ULTIMATE.start_main_~x~4 7), 284294#(<= ULTIMATE.start_main_~x~4 8), 284295#(<= ULTIMATE.start_main_~x~4 9), 284288#(<= ULTIMATE.start_main_~x~4 2), 284289#(<= ULTIMATE.start_main_~x~4 3), 284290#(<= ULTIMATE.start_main_~x~4 4), 284291#(<= ULTIMATE.start_main_~x~4 5), 284300#(<= ULTIMATE.start_main_~x~4 14), 284301#(<= ULTIMATE.start_main_~x~4 15), 284302#(<= ULTIMATE.start_main_~x~4 16), 284303#(<= ULTIMATE.start_main_~x~4 17), 284296#(<= ULTIMATE.start_main_~x~4 10), 284297#(<= ULTIMATE.start_main_~x~4 11), 284298#(<= ULTIMATE.start_main_~x~4 12), 284299#(<= ULTIMATE.start_main_~x~4 13), 284308#(<= ULTIMATE.start_main_~x~4 22), 284309#(<= ULTIMATE.start_main_~x~4 23), 284310#(<= ULTIMATE.start_main_~x~4 24), 284311#(<= ULTIMATE.start_main_~x~4 25), 284304#(<= ULTIMATE.start_main_~x~4 18), 284305#(<= ULTIMATE.start_main_~x~4 19), 284306#(<= ULTIMATE.start_main_~x~4 20), 284307#(<= ULTIMATE.start_main_~x~4 21), 284316#(<= ULTIMATE.start_main_~x~4 30), 284317#(<= ULTIMATE.start_main_~x~4 31), 284318#(<= ULTIMATE.start_main_~x~4 32), 284319#(<= ULTIMATE.start_main_~x~4 33), 284312#(<= ULTIMATE.start_main_~x~4 26), 284313#(<= ULTIMATE.start_main_~x~4 27), 284314#(<= ULTIMATE.start_main_~x~4 28), 284315#(<= ULTIMATE.start_main_~x~4 29), 284324#(<= ULTIMATE.start_main_~x~4 38), 284325#(<= ULTIMATE.start_main_~x~4 39), 284326#(<= ULTIMATE.start_main_~x~4 40), 284327#(<= ULTIMATE.start_main_~x~4 41), 284320#(<= ULTIMATE.start_main_~x~4 34), 284321#(<= ULTIMATE.start_main_~x~4 35), 284322#(<= ULTIMATE.start_main_~x~4 36), 284323#(<= ULTIMATE.start_main_~x~4 37), 284332#(<= ULTIMATE.start_main_~x~4 46), 284333#(<= ULTIMATE.start_main_~x~4 47), 284334#(<= ULTIMATE.start_main_~x~4 48), 284335#(<= ULTIMATE.start_main_~x~4 49), 284328#(<= ULTIMATE.start_main_~x~4 42), 284329#(<= ULTIMATE.start_main_~x~4 43), 284330#(<= ULTIMATE.start_main_~x~4 44), 284331#(<= ULTIMATE.start_main_~x~4 45), 284340#(<= ULTIMATE.start_main_~x~4 54), 284341#(<= ULTIMATE.start_main_~x~4 55), 284342#(<= ULTIMATE.start_main_~x~4 56), 284343#(<= ULTIMATE.start_main_~x~4 57), 284336#(<= ULTIMATE.start_main_~x~4 50), 284337#(<= ULTIMATE.start_main_~x~4 51), 284338#(<= ULTIMATE.start_main_~x~4 52), 284339#(<= ULTIMATE.start_main_~x~4 53), 284348#(<= ULTIMATE.start_main_~x~4 62), 284349#(<= ULTIMATE.start_main_~x~4 63), 284350#(<= ULTIMATE.start_main_~x~4 64), 284351#(<= ULTIMATE.start_main_~x~4 65), 284344#(<= ULTIMATE.start_main_~x~4 58), 284345#(<= ULTIMATE.start_main_~x~4 59), 284346#(<= ULTIMATE.start_main_~x~4 60), 284347#(<= ULTIMATE.start_main_~x~4 61), 284356#(<= ULTIMATE.start_main_~x~4 70), 284357#(<= ULTIMATE.start_main_~x~4 71), 284358#(<= ULTIMATE.start_main_~x~4 72), 284359#(<= ULTIMATE.start_main_~x~4 73), 284352#(<= ULTIMATE.start_main_~x~4 66), 284353#(<= ULTIMATE.start_main_~x~4 67), 284354#(<= ULTIMATE.start_main_~x~4 68), 284355#(<= ULTIMATE.start_main_~x~4 69), 284364#(<= ULTIMATE.start_main_~x~4 78), 284365#(<= ULTIMATE.start_main_~x~4 79), 284366#(<= ULTIMATE.start_main_~x~4 80), 284367#(<= ULTIMATE.start_main_~x~4 81), 284360#(<= ULTIMATE.start_main_~x~4 74), 284361#(<= ULTIMATE.start_main_~x~4 75), 284362#(<= ULTIMATE.start_main_~x~4 76), 284363#(<= ULTIMATE.start_main_~x~4 77), 284372#(<= ULTIMATE.start_main_~x~4 86), 284373#(<= ULTIMATE.start_main_~x~4 87), 284374#(<= ULTIMATE.start_main_~x~4 88), 284375#(<= ULTIMATE.start_main_~x~4 89), 284368#(<= ULTIMATE.start_main_~x~4 82), 284369#(<= ULTIMATE.start_main_~x~4 83), 284370#(<= ULTIMATE.start_main_~x~4 84), 284371#(<= ULTIMATE.start_main_~x~4 85), 284380#(<= ULTIMATE.start_main_~x~4 94), 284381#(<= ULTIMATE.start_main_~x~4 95), 284382#(<= ULTIMATE.start_main_~x~4 96), 284383#(<= ULTIMATE.start_main_~x~4 97), 284376#(<= ULTIMATE.start_main_~x~4 90), 284377#(<= ULTIMATE.start_main_~x~4 91), 284378#(<= ULTIMATE.start_main_~x~4 92), 284379#(<= ULTIMATE.start_main_~x~4 93), 284388#(<= ULTIMATE.start_main_~x~4 102), 284389#(<= ULTIMATE.start_main_~x~4 103), 284390#(<= ULTIMATE.start_main_~x~4 104), 284391#(<= ULTIMATE.start_main_~x~4 105), 284384#(<= ULTIMATE.start_main_~x~4 98), 284385#(<= ULTIMATE.start_main_~x~4 99), 284386#(<= ULTIMATE.start_main_~x~4 100), 284387#(<= ULTIMATE.start_main_~x~4 101), 284392#(<= ULTIMATE.start_main_~x~4 106)] [2018-07-23 13:44:24,725 INFO L134 CoverageAnalysis]: Checked inductivity of 684866 backedges. 0 proven. 679036 refuted. 0 times theorem prover too weak. 5830 trivial. 0 not checked. [2018-07-23 13:44:24,725 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 13:44:24,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 13:44:24,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 13:44:24,726 INFO L87 Difference]: Start difference. First operand 1276 states and 1382 transitions. Second operand 109 states. [2018-07-23 13:44:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:26,710 INFO L93 Difference]: Finished difference Result 1301 states and 1409 transitions. [2018-07-23 13:44:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 13:44:26,710 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 1275 [2018-07-23 13:44:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:26,712 INFO L225 Difference]: With dead ends: 1301 [2018-07-23 13:44:26,712 INFO L226 Difference]: Without dead ends: 1299 [2018-07-23 13:44:26,712 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 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:44:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2018-07-23 13:44:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1288. [2018-07-23 13:44:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-07-23 13:44:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1395 transitions. [2018-07-23 13:44:28,482 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1395 transitions. Word has length 1275 [2018-07-23 13:44:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:28,483 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1395 transitions. [2018-07-23 13:44:28,483 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 13:44:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1395 transitions. [2018-07-23 13:44:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1288 [2018-07-23 13:44:28,491 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:28,491 INFO L357 BasicCegarLoop]: trace histogram [1070, 107, 107, 1, 1, 1] [2018-07-23 13:44:28,492 INFO L414 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:28,492 INFO L82 PathProgramCache]: Analyzing trace with hash -38094863, now seen corresponding path program 116 times [2018-07-23 13:44:28,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 697854 backedges. 0 proven. 691969 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-07-23 13:44:30,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:30,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 13:44:30,364 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:30,365 INFO L185 omatonBuilderFactory]: Interpolants [289572#false, 289573#(<= ULTIMATE.start_main_~x~4 0), 289574#(<= ULTIMATE.start_main_~x~4 1), 289575#(<= ULTIMATE.start_main_~x~4 2), 289571#true, 289580#(<= ULTIMATE.start_main_~x~4 7), 289581#(<= ULTIMATE.start_main_~x~4 8), 289582#(<= ULTIMATE.start_main_~x~4 9), 289583#(<= ULTIMATE.start_main_~x~4 10), 289576#(<= ULTIMATE.start_main_~x~4 3), 289577#(<= ULTIMATE.start_main_~x~4 4), 289578#(<= ULTIMATE.start_main_~x~4 5), 289579#(<= ULTIMATE.start_main_~x~4 6), 289588#(<= ULTIMATE.start_main_~x~4 15), 289589#(<= ULTIMATE.start_main_~x~4 16), 289590#(<= ULTIMATE.start_main_~x~4 17), 289591#(<= ULTIMATE.start_main_~x~4 18), 289584#(<= ULTIMATE.start_main_~x~4 11), 289585#(<= ULTIMATE.start_main_~x~4 12), 289586#(<= ULTIMATE.start_main_~x~4 13), 289587#(<= ULTIMATE.start_main_~x~4 14), 289596#(<= ULTIMATE.start_main_~x~4 23), 289597#(<= ULTIMATE.start_main_~x~4 24), 289598#(<= ULTIMATE.start_main_~x~4 25), 289599#(<= ULTIMATE.start_main_~x~4 26), 289592#(<= ULTIMATE.start_main_~x~4 19), 289593#(<= ULTIMATE.start_main_~x~4 20), 289594#(<= ULTIMATE.start_main_~x~4 21), 289595#(<= ULTIMATE.start_main_~x~4 22), 289604#(<= ULTIMATE.start_main_~x~4 31), 289605#(<= ULTIMATE.start_main_~x~4 32), 289606#(<= ULTIMATE.start_main_~x~4 33), 289607#(<= ULTIMATE.start_main_~x~4 34), 289600#(<= ULTIMATE.start_main_~x~4 27), 289601#(<= ULTIMATE.start_main_~x~4 28), 289602#(<= ULTIMATE.start_main_~x~4 29), 289603#(<= ULTIMATE.start_main_~x~4 30), 289612#(<= ULTIMATE.start_main_~x~4 39), 289613#(<= ULTIMATE.start_main_~x~4 40), 289614#(<= ULTIMATE.start_main_~x~4 41), 289615#(<= ULTIMATE.start_main_~x~4 42), 289608#(<= ULTIMATE.start_main_~x~4 35), 289609#(<= ULTIMATE.start_main_~x~4 36), 289610#(<= ULTIMATE.start_main_~x~4 37), 289611#(<= ULTIMATE.start_main_~x~4 38), 289620#(<= ULTIMATE.start_main_~x~4 47), 289621#(<= ULTIMATE.start_main_~x~4 48), 289622#(<= ULTIMATE.start_main_~x~4 49), 289623#(<= ULTIMATE.start_main_~x~4 50), 289616#(<= ULTIMATE.start_main_~x~4 43), 289617#(<= ULTIMATE.start_main_~x~4 44), 289618#(<= ULTIMATE.start_main_~x~4 45), 289619#(<= ULTIMATE.start_main_~x~4 46), 289628#(<= ULTIMATE.start_main_~x~4 55), 289629#(<= ULTIMATE.start_main_~x~4 56), 289630#(<= ULTIMATE.start_main_~x~4 57), 289631#(<= ULTIMATE.start_main_~x~4 58), 289624#(<= ULTIMATE.start_main_~x~4 51), 289625#(<= ULTIMATE.start_main_~x~4 52), 289626#(<= ULTIMATE.start_main_~x~4 53), 289627#(<= ULTIMATE.start_main_~x~4 54), 289636#(<= ULTIMATE.start_main_~x~4 63), 289637#(<= ULTIMATE.start_main_~x~4 64), 289638#(<= ULTIMATE.start_main_~x~4 65), 289639#(<= ULTIMATE.start_main_~x~4 66), 289632#(<= ULTIMATE.start_main_~x~4 59), 289633#(<= ULTIMATE.start_main_~x~4 60), 289634#(<= ULTIMATE.start_main_~x~4 61), 289635#(<= ULTIMATE.start_main_~x~4 62), 289644#(<= ULTIMATE.start_main_~x~4 71), 289645#(<= ULTIMATE.start_main_~x~4 72), 289646#(<= ULTIMATE.start_main_~x~4 73), 289647#(<= ULTIMATE.start_main_~x~4 74), 289640#(<= ULTIMATE.start_main_~x~4 67), 289641#(<= ULTIMATE.start_main_~x~4 68), 289642#(<= ULTIMATE.start_main_~x~4 69), 289643#(<= ULTIMATE.start_main_~x~4 70), 289652#(<= ULTIMATE.start_main_~x~4 79), 289653#(<= ULTIMATE.start_main_~x~4 80), 289654#(<= ULTIMATE.start_main_~x~4 81), 289655#(<= ULTIMATE.start_main_~x~4 82), 289648#(<= ULTIMATE.start_main_~x~4 75), 289649#(<= ULTIMATE.start_main_~x~4 76), 289650#(<= ULTIMATE.start_main_~x~4 77), 289651#(<= ULTIMATE.start_main_~x~4 78), 289660#(<= ULTIMATE.start_main_~x~4 87), 289661#(<= ULTIMATE.start_main_~x~4 88), 289662#(<= ULTIMATE.start_main_~x~4 89), 289663#(<= ULTIMATE.start_main_~x~4 90), 289656#(<= ULTIMATE.start_main_~x~4 83), 289657#(<= ULTIMATE.start_main_~x~4 84), 289658#(<= ULTIMATE.start_main_~x~4 85), 289659#(<= ULTIMATE.start_main_~x~4 86), 289668#(<= ULTIMATE.start_main_~x~4 95), 289669#(<= ULTIMATE.start_main_~x~4 96), 289670#(<= ULTIMATE.start_main_~x~4 97), 289671#(<= ULTIMATE.start_main_~x~4 98), 289664#(<= ULTIMATE.start_main_~x~4 91), 289665#(<= ULTIMATE.start_main_~x~4 92), 289666#(<= ULTIMATE.start_main_~x~4 93), 289667#(<= ULTIMATE.start_main_~x~4 94), 289676#(<= ULTIMATE.start_main_~x~4 103), 289677#(<= ULTIMATE.start_main_~x~4 104), 289678#(<= ULTIMATE.start_main_~x~4 105), 289679#(<= ULTIMATE.start_main_~x~4 106), 289672#(<= ULTIMATE.start_main_~x~4 99), 289673#(<= ULTIMATE.start_main_~x~4 100), 289674#(<= ULTIMATE.start_main_~x~4 101), 289675#(<= ULTIMATE.start_main_~x~4 102), 289680#(<= ULTIMATE.start_main_~x~4 107)] [2018-07-23 13:44:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 697854 backedges. 0 proven. 691969 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-07-23 13:44:30,386 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 13:44:30,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 13:44:30,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:44:30,387 INFO L87 Difference]: Start difference. First operand 1288 states and 1395 transitions. Second operand 110 states. [2018-07-23 13:44:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:32,400 INFO L93 Difference]: Finished difference Result 1313 states and 1422 transitions. [2018-07-23 13:44:32,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 13:44:32,400 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 1287 [2018-07-23 13:44:32,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:32,402 INFO L225 Difference]: With dead ends: 1313 [2018-07-23 13:44:32,402 INFO L226 Difference]: Without dead ends: 1311 [2018-07-23 13:44:32,403 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 13:44:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2018-07-23 13:44:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1300. [2018-07-23 13:44:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-07-23 13:44:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1408 transitions. [2018-07-23 13:44:34,172 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1408 transitions. Word has length 1287 [2018-07-23 13:44:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:34,172 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1408 transitions. [2018-07-23 13:44:34,172 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 13:44:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1408 transitions. [2018-07-23 13:44:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2018-07-23 13:44:34,181 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:34,181 INFO L357 BasicCegarLoop]: trace histogram [1080, 108, 108, 1, 1, 1] [2018-07-23 13:44:34,181 INFO L414 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:34,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1003002427, now seen corresponding path program 117 times [2018-07-23 13:44:34,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 710964 backedges. 0 proven. 705024 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2018-07-23 13:44:35,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:35,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 13:44:35,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:35,641 INFO L185 omatonBuilderFactory]: Interpolants [294916#(<= ULTIMATE.start_main_~x~4 7), 294917#(<= ULTIMATE.start_main_~x~4 8), 294918#(<= ULTIMATE.start_main_~x~4 9), 294919#(<= ULTIMATE.start_main_~x~4 10), 294912#(<= ULTIMATE.start_main_~x~4 3), 294913#(<= ULTIMATE.start_main_~x~4 4), 294914#(<= ULTIMATE.start_main_~x~4 5), 294915#(<= ULTIMATE.start_main_~x~4 6), 294924#(<= ULTIMATE.start_main_~x~4 15), 294925#(<= ULTIMATE.start_main_~x~4 16), 294926#(<= ULTIMATE.start_main_~x~4 17), 294927#(<= ULTIMATE.start_main_~x~4 18), 294920#(<= ULTIMATE.start_main_~x~4 11), 294921#(<= ULTIMATE.start_main_~x~4 12), 294922#(<= ULTIMATE.start_main_~x~4 13), 294923#(<= ULTIMATE.start_main_~x~4 14), 294932#(<= ULTIMATE.start_main_~x~4 23), 294933#(<= ULTIMATE.start_main_~x~4 24), 294934#(<= ULTIMATE.start_main_~x~4 25), 294935#(<= ULTIMATE.start_main_~x~4 26), 294928#(<= ULTIMATE.start_main_~x~4 19), 294929#(<= ULTIMATE.start_main_~x~4 20), 294930#(<= ULTIMATE.start_main_~x~4 21), 294931#(<= ULTIMATE.start_main_~x~4 22), 294940#(<= ULTIMATE.start_main_~x~4 31), 294941#(<= ULTIMATE.start_main_~x~4 32), 294942#(<= ULTIMATE.start_main_~x~4 33), 294943#(<= ULTIMATE.start_main_~x~4 34), 294936#(<= ULTIMATE.start_main_~x~4 27), 294937#(<= ULTIMATE.start_main_~x~4 28), 294938#(<= ULTIMATE.start_main_~x~4 29), 294939#(<= ULTIMATE.start_main_~x~4 30), 294948#(<= ULTIMATE.start_main_~x~4 39), 294949#(<= ULTIMATE.start_main_~x~4 40), 294950#(<= ULTIMATE.start_main_~x~4 41), 294951#(<= ULTIMATE.start_main_~x~4 42), 294944#(<= ULTIMATE.start_main_~x~4 35), 294945#(<= ULTIMATE.start_main_~x~4 36), 294946#(<= ULTIMATE.start_main_~x~4 37), 294947#(<= ULTIMATE.start_main_~x~4 38), 294956#(<= ULTIMATE.start_main_~x~4 47), 294957#(<= ULTIMATE.start_main_~x~4 48), 294958#(<= ULTIMATE.start_main_~x~4 49), 294959#(<= ULTIMATE.start_main_~x~4 50), 294952#(<= ULTIMATE.start_main_~x~4 43), 294953#(<= ULTIMATE.start_main_~x~4 44), 294954#(<= ULTIMATE.start_main_~x~4 45), 294955#(<= ULTIMATE.start_main_~x~4 46), 294964#(<= ULTIMATE.start_main_~x~4 55), 294965#(<= ULTIMATE.start_main_~x~4 56), 294966#(<= ULTIMATE.start_main_~x~4 57), 294967#(<= ULTIMATE.start_main_~x~4 58), 294960#(<= ULTIMATE.start_main_~x~4 51), 294961#(<= ULTIMATE.start_main_~x~4 52), 294962#(<= ULTIMATE.start_main_~x~4 53), 294963#(<= ULTIMATE.start_main_~x~4 54), 294972#(<= ULTIMATE.start_main_~x~4 63), 294973#(<= ULTIMATE.start_main_~x~4 64), 294974#(<= ULTIMATE.start_main_~x~4 65), 294975#(<= ULTIMATE.start_main_~x~4 66), 294968#(<= ULTIMATE.start_main_~x~4 59), 294969#(<= ULTIMATE.start_main_~x~4 60), 294970#(<= ULTIMATE.start_main_~x~4 61), 294971#(<= ULTIMATE.start_main_~x~4 62), 294980#(<= ULTIMATE.start_main_~x~4 71), 294981#(<= ULTIMATE.start_main_~x~4 72), 294982#(<= ULTIMATE.start_main_~x~4 73), 294983#(<= ULTIMATE.start_main_~x~4 74), 294976#(<= ULTIMATE.start_main_~x~4 67), 294977#(<= ULTIMATE.start_main_~x~4 68), 294978#(<= ULTIMATE.start_main_~x~4 69), 294979#(<= ULTIMATE.start_main_~x~4 70), 294988#(<= ULTIMATE.start_main_~x~4 79), 294989#(<= ULTIMATE.start_main_~x~4 80), 294990#(<= ULTIMATE.start_main_~x~4 81), 294991#(<= ULTIMATE.start_main_~x~4 82), 294984#(<= ULTIMATE.start_main_~x~4 75), 294985#(<= ULTIMATE.start_main_~x~4 76), 294986#(<= ULTIMATE.start_main_~x~4 77), 294987#(<= ULTIMATE.start_main_~x~4 78), 294996#(<= ULTIMATE.start_main_~x~4 87), 294997#(<= ULTIMATE.start_main_~x~4 88), 294998#(<= ULTIMATE.start_main_~x~4 89), 294999#(<= ULTIMATE.start_main_~x~4 90), 294992#(<= ULTIMATE.start_main_~x~4 83), 294993#(<= ULTIMATE.start_main_~x~4 84), 294994#(<= ULTIMATE.start_main_~x~4 85), 294995#(<= ULTIMATE.start_main_~x~4 86), 295004#(<= ULTIMATE.start_main_~x~4 95), 295005#(<= ULTIMATE.start_main_~x~4 96), 295006#(<= ULTIMATE.start_main_~x~4 97), 295007#(<= ULTIMATE.start_main_~x~4 98), 295000#(<= ULTIMATE.start_main_~x~4 91), 295001#(<= ULTIMATE.start_main_~x~4 92), 295002#(<= ULTIMATE.start_main_~x~4 93), 295003#(<= ULTIMATE.start_main_~x~4 94), 295012#(<= ULTIMATE.start_main_~x~4 103), 295013#(<= ULTIMATE.start_main_~x~4 104), 295014#(<= ULTIMATE.start_main_~x~4 105), 295015#(<= ULTIMATE.start_main_~x~4 106), 295008#(<= ULTIMATE.start_main_~x~4 99), 295009#(<= ULTIMATE.start_main_~x~4 100), 295010#(<= ULTIMATE.start_main_~x~4 101), 295011#(<= ULTIMATE.start_main_~x~4 102), 295016#(<= ULTIMATE.start_main_~x~4 107), 295017#(<= ULTIMATE.start_main_~x~4 108), 294908#false, 294909#(<= ULTIMATE.start_main_~x~4 0), 294910#(<= ULTIMATE.start_main_~x~4 1), 294911#(<= ULTIMATE.start_main_~x~4 2), 294907#true] [2018-07-23 13:44:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 710964 backedges. 0 proven. 705024 refuted. 0 times theorem prover too weak. 5940 trivial. 0 not checked. [2018-07-23 13:44:35,668 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 13:44:35,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 13:44:35,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 13:44:35,670 INFO L87 Difference]: Start difference. First operand 1300 states and 1408 transitions. Second operand 111 states. [2018-07-23 13:44:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:37,770 INFO L93 Difference]: Finished difference Result 1325 states and 1435 transitions. [2018-07-23 13:44:37,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 13:44:37,770 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1299 [2018-07-23 13:44:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:37,771 INFO L225 Difference]: With dead ends: 1325 [2018-07-23 13:44:37,771 INFO L226 Difference]: Without dead ends: 1323 [2018-07-23 13:44:37,772 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 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:44:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2018-07-23 13:44:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1312. [2018-07-23 13:44:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2018-07-23 13:44:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1421 transitions. [2018-07-23 13:44:39,592 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1421 transitions. Word has length 1299 [2018-07-23 13:44:39,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:39,592 INFO L471 AbstractCegarLoop]: Abstraction has 1312 states and 1421 transitions. [2018-07-23 13:44:39,592 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 13:44:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1421 transitions. [2018-07-23 13:44:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1312 [2018-07-23 13:44:39,601 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:39,601 INFO L357 BasicCegarLoop]: trace histogram [1090, 109, 109, 1, 1, 1] [2018-07-23 13:44:39,601 INFO L414 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1811111301, now seen corresponding path program 118 times [2018-07-23 13:44:39,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 724196 backedges. 0 proven. 718201 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2018-07-23 13:44:41,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:41,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 13:44:41,387 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:41,387 INFO L185 omatonBuilderFactory]: Interpolants [300292#true, 300293#false, 300294#(<= ULTIMATE.start_main_~x~4 0), 300295#(<= ULTIMATE.start_main_~x~4 1), 300300#(<= ULTIMATE.start_main_~x~4 6), 300301#(<= ULTIMATE.start_main_~x~4 7), 300302#(<= ULTIMATE.start_main_~x~4 8), 300303#(<= ULTIMATE.start_main_~x~4 9), 300296#(<= ULTIMATE.start_main_~x~4 2), 300297#(<= ULTIMATE.start_main_~x~4 3), 300298#(<= ULTIMATE.start_main_~x~4 4), 300299#(<= ULTIMATE.start_main_~x~4 5), 300308#(<= ULTIMATE.start_main_~x~4 14), 300309#(<= ULTIMATE.start_main_~x~4 15), 300310#(<= ULTIMATE.start_main_~x~4 16), 300311#(<= ULTIMATE.start_main_~x~4 17), 300304#(<= ULTIMATE.start_main_~x~4 10), 300305#(<= ULTIMATE.start_main_~x~4 11), 300306#(<= ULTIMATE.start_main_~x~4 12), 300307#(<= ULTIMATE.start_main_~x~4 13), 300316#(<= ULTIMATE.start_main_~x~4 22), 300317#(<= ULTIMATE.start_main_~x~4 23), 300318#(<= ULTIMATE.start_main_~x~4 24), 300319#(<= ULTIMATE.start_main_~x~4 25), 300312#(<= ULTIMATE.start_main_~x~4 18), 300313#(<= ULTIMATE.start_main_~x~4 19), 300314#(<= ULTIMATE.start_main_~x~4 20), 300315#(<= ULTIMATE.start_main_~x~4 21), 300324#(<= ULTIMATE.start_main_~x~4 30), 300325#(<= ULTIMATE.start_main_~x~4 31), 300326#(<= ULTIMATE.start_main_~x~4 32), 300327#(<= ULTIMATE.start_main_~x~4 33), 300320#(<= ULTIMATE.start_main_~x~4 26), 300321#(<= ULTIMATE.start_main_~x~4 27), 300322#(<= ULTIMATE.start_main_~x~4 28), 300323#(<= ULTIMATE.start_main_~x~4 29), 300332#(<= ULTIMATE.start_main_~x~4 38), 300333#(<= ULTIMATE.start_main_~x~4 39), 300334#(<= ULTIMATE.start_main_~x~4 40), 300335#(<= ULTIMATE.start_main_~x~4 41), 300328#(<= ULTIMATE.start_main_~x~4 34), 300329#(<= ULTIMATE.start_main_~x~4 35), 300330#(<= ULTIMATE.start_main_~x~4 36), 300331#(<= ULTIMATE.start_main_~x~4 37), 300340#(<= ULTIMATE.start_main_~x~4 46), 300341#(<= ULTIMATE.start_main_~x~4 47), 300342#(<= ULTIMATE.start_main_~x~4 48), 300343#(<= ULTIMATE.start_main_~x~4 49), 300336#(<= ULTIMATE.start_main_~x~4 42), 300337#(<= ULTIMATE.start_main_~x~4 43), 300338#(<= ULTIMATE.start_main_~x~4 44), 300339#(<= ULTIMATE.start_main_~x~4 45), 300348#(<= ULTIMATE.start_main_~x~4 54), 300349#(<= ULTIMATE.start_main_~x~4 55), 300350#(<= ULTIMATE.start_main_~x~4 56), 300351#(<= ULTIMATE.start_main_~x~4 57), 300344#(<= ULTIMATE.start_main_~x~4 50), 300345#(<= ULTIMATE.start_main_~x~4 51), 300346#(<= ULTIMATE.start_main_~x~4 52), 300347#(<= ULTIMATE.start_main_~x~4 53), 300356#(<= ULTIMATE.start_main_~x~4 62), 300357#(<= ULTIMATE.start_main_~x~4 63), 300358#(<= ULTIMATE.start_main_~x~4 64), 300359#(<= ULTIMATE.start_main_~x~4 65), 300352#(<= ULTIMATE.start_main_~x~4 58), 300353#(<= ULTIMATE.start_main_~x~4 59), 300354#(<= ULTIMATE.start_main_~x~4 60), 300355#(<= ULTIMATE.start_main_~x~4 61), 300364#(<= ULTIMATE.start_main_~x~4 70), 300365#(<= ULTIMATE.start_main_~x~4 71), 300366#(<= ULTIMATE.start_main_~x~4 72), 300367#(<= ULTIMATE.start_main_~x~4 73), 300360#(<= ULTIMATE.start_main_~x~4 66), 300361#(<= ULTIMATE.start_main_~x~4 67), 300362#(<= ULTIMATE.start_main_~x~4 68), 300363#(<= ULTIMATE.start_main_~x~4 69), 300372#(<= ULTIMATE.start_main_~x~4 78), 300373#(<= ULTIMATE.start_main_~x~4 79), 300374#(<= ULTIMATE.start_main_~x~4 80), 300375#(<= ULTIMATE.start_main_~x~4 81), 300368#(<= ULTIMATE.start_main_~x~4 74), 300369#(<= ULTIMATE.start_main_~x~4 75), 300370#(<= ULTIMATE.start_main_~x~4 76), 300371#(<= ULTIMATE.start_main_~x~4 77), 300380#(<= ULTIMATE.start_main_~x~4 86), 300381#(<= ULTIMATE.start_main_~x~4 87), 300382#(<= ULTIMATE.start_main_~x~4 88), 300383#(<= ULTIMATE.start_main_~x~4 89), 300376#(<= ULTIMATE.start_main_~x~4 82), 300377#(<= ULTIMATE.start_main_~x~4 83), 300378#(<= ULTIMATE.start_main_~x~4 84), 300379#(<= ULTIMATE.start_main_~x~4 85), 300388#(<= ULTIMATE.start_main_~x~4 94), 300389#(<= ULTIMATE.start_main_~x~4 95), 300390#(<= ULTIMATE.start_main_~x~4 96), 300391#(<= ULTIMATE.start_main_~x~4 97), 300384#(<= ULTIMATE.start_main_~x~4 90), 300385#(<= ULTIMATE.start_main_~x~4 91), 300386#(<= ULTIMATE.start_main_~x~4 92), 300387#(<= ULTIMATE.start_main_~x~4 93), 300396#(<= ULTIMATE.start_main_~x~4 102), 300397#(<= ULTIMATE.start_main_~x~4 103), 300398#(<= ULTIMATE.start_main_~x~4 104), 300399#(<= ULTIMATE.start_main_~x~4 105), 300392#(<= ULTIMATE.start_main_~x~4 98), 300393#(<= ULTIMATE.start_main_~x~4 99), 300394#(<= ULTIMATE.start_main_~x~4 100), 300395#(<= ULTIMATE.start_main_~x~4 101), 300400#(<= ULTIMATE.start_main_~x~4 106), 300401#(<= ULTIMATE.start_main_~x~4 107), 300402#(<= ULTIMATE.start_main_~x~4 108), 300403#(<= ULTIMATE.start_main_~x~4 109)] [2018-07-23 13:44:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 724196 backedges. 0 proven. 718201 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2018-07-23 13:44:41,408 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 13:44:41,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 13:44:41,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 13:44:41,409 INFO L87 Difference]: Start difference. First operand 1312 states and 1421 transitions. Second operand 112 states. [2018-07-23 13:44:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:43,553 INFO L93 Difference]: Finished difference Result 1337 states and 1448 transitions. [2018-07-23 13:44:43,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 13:44:43,553 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 1311 [2018-07-23 13:44:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:43,554 INFO L225 Difference]: With dead ends: 1337 [2018-07-23 13:44:43,555 INFO L226 Difference]: Without dead ends: 1335 [2018-07-23 13:44:43,555 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 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:44:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-07-23 13:44:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1324. [2018-07-23 13:44:45,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-07-23 13:44:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1434 transitions. [2018-07-23 13:44:45,421 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1434 transitions. Word has length 1311 [2018-07-23 13:44:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:45,422 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 1434 transitions. [2018-07-23 13:44:45,422 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 13:44:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1434 transitions. [2018-07-23 13:44:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1324 [2018-07-23 13:44:45,431 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:45,431 INFO L357 BasicCegarLoop]: trace histogram [1100, 110, 110, 1, 1, 1] [2018-07-23 13:44:45,431 INFO L414 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1827766735, now seen corresponding path program 119 times [2018-07-23 13:44:45,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 737550 backedges. 0 proven. 731500 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-07-23 13:44:46,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:46,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 13:44:46,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:46,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:44:46,931 INFO L185 omatonBuilderFactory]: Interpolants [305726#true, 305727#false, 305732#(<= ULTIMATE.start_main_~x~4 4), 305733#(<= ULTIMATE.start_main_~x~4 5), 305734#(<= ULTIMATE.start_main_~x~4 6), 305735#(<= ULTIMATE.start_main_~x~4 7), 305728#(<= ULTIMATE.start_main_~x~4 0), 305729#(<= ULTIMATE.start_main_~x~4 1), 305730#(<= ULTIMATE.start_main_~x~4 2), 305731#(<= ULTIMATE.start_main_~x~4 3), 305740#(<= ULTIMATE.start_main_~x~4 12), 305741#(<= ULTIMATE.start_main_~x~4 13), 305742#(<= ULTIMATE.start_main_~x~4 14), 305743#(<= ULTIMATE.start_main_~x~4 15), 305736#(<= ULTIMATE.start_main_~x~4 8), 305737#(<= ULTIMATE.start_main_~x~4 9), 305738#(<= ULTIMATE.start_main_~x~4 10), 305739#(<= ULTIMATE.start_main_~x~4 11), 305748#(<= ULTIMATE.start_main_~x~4 20), 305749#(<= ULTIMATE.start_main_~x~4 21), 305750#(<= ULTIMATE.start_main_~x~4 22), 305751#(<= ULTIMATE.start_main_~x~4 23), 305744#(<= ULTIMATE.start_main_~x~4 16), 305745#(<= ULTIMATE.start_main_~x~4 17), 305746#(<= ULTIMATE.start_main_~x~4 18), 305747#(<= ULTIMATE.start_main_~x~4 19), 305756#(<= ULTIMATE.start_main_~x~4 28), 305757#(<= ULTIMATE.start_main_~x~4 29), 305758#(<= ULTIMATE.start_main_~x~4 30), 305759#(<= ULTIMATE.start_main_~x~4 31), 305752#(<= ULTIMATE.start_main_~x~4 24), 305753#(<= ULTIMATE.start_main_~x~4 25), 305754#(<= ULTIMATE.start_main_~x~4 26), 305755#(<= ULTIMATE.start_main_~x~4 27), 305764#(<= ULTIMATE.start_main_~x~4 36), 305765#(<= ULTIMATE.start_main_~x~4 37), 305766#(<= ULTIMATE.start_main_~x~4 38), 305767#(<= ULTIMATE.start_main_~x~4 39), 305760#(<= ULTIMATE.start_main_~x~4 32), 305761#(<= ULTIMATE.start_main_~x~4 33), 305762#(<= ULTIMATE.start_main_~x~4 34), 305763#(<= ULTIMATE.start_main_~x~4 35), 305772#(<= ULTIMATE.start_main_~x~4 44), 305773#(<= ULTIMATE.start_main_~x~4 45), 305774#(<= ULTIMATE.start_main_~x~4 46), 305775#(<= ULTIMATE.start_main_~x~4 47), 305768#(<= ULTIMATE.start_main_~x~4 40), 305769#(<= ULTIMATE.start_main_~x~4 41), 305770#(<= ULTIMATE.start_main_~x~4 42), 305771#(<= ULTIMATE.start_main_~x~4 43), 305780#(<= ULTIMATE.start_main_~x~4 52), 305781#(<= ULTIMATE.start_main_~x~4 53), 305782#(<= ULTIMATE.start_main_~x~4 54), 305783#(<= ULTIMATE.start_main_~x~4 55), 305776#(<= ULTIMATE.start_main_~x~4 48), 305777#(<= ULTIMATE.start_main_~x~4 49), 305778#(<= ULTIMATE.start_main_~x~4 50), 305779#(<= ULTIMATE.start_main_~x~4 51), 305788#(<= ULTIMATE.start_main_~x~4 60), 305789#(<= ULTIMATE.start_main_~x~4 61), 305790#(<= ULTIMATE.start_main_~x~4 62), 305791#(<= ULTIMATE.start_main_~x~4 63), 305784#(<= ULTIMATE.start_main_~x~4 56), 305785#(<= ULTIMATE.start_main_~x~4 57), 305786#(<= ULTIMATE.start_main_~x~4 58), 305787#(<= ULTIMATE.start_main_~x~4 59), 305796#(<= ULTIMATE.start_main_~x~4 68), 305797#(<= ULTIMATE.start_main_~x~4 69), 305798#(<= ULTIMATE.start_main_~x~4 70), 305799#(<= ULTIMATE.start_main_~x~4 71), 305792#(<= ULTIMATE.start_main_~x~4 64), 305793#(<= ULTIMATE.start_main_~x~4 65), 305794#(<= ULTIMATE.start_main_~x~4 66), 305795#(<= ULTIMATE.start_main_~x~4 67), 305804#(<= ULTIMATE.start_main_~x~4 76), 305805#(<= ULTIMATE.start_main_~x~4 77), 305806#(<= ULTIMATE.start_main_~x~4 78), 305807#(<= ULTIMATE.start_main_~x~4 79), 305800#(<= ULTIMATE.start_main_~x~4 72), 305801#(<= ULTIMATE.start_main_~x~4 73), 305802#(<= ULTIMATE.start_main_~x~4 74), 305803#(<= ULTIMATE.start_main_~x~4 75), 305812#(<= ULTIMATE.start_main_~x~4 84), 305813#(<= ULTIMATE.start_main_~x~4 85), 305814#(<= ULTIMATE.start_main_~x~4 86), 305815#(<= ULTIMATE.start_main_~x~4 87), 305808#(<= ULTIMATE.start_main_~x~4 80), 305809#(<= ULTIMATE.start_main_~x~4 81), 305810#(<= ULTIMATE.start_main_~x~4 82), 305811#(<= ULTIMATE.start_main_~x~4 83), 305820#(<= ULTIMATE.start_main_~x~4 92), 305821#(<= ULTIMATE.start_main_~x~4 93), 305822#(<= ULTIMATE.start_main_~x~4 94), 305823#(<= ULTIMATE.start_main_~x~4 95), 305816#(<= ULTIMATE.start_main_~x~4 88), 305817#(<= ULTIMATE.start_main_~x~4 89), 305818#(<= ULTIMATE.start_main_~x~4 90), 305819#(<= ULTIMATE.start_main_~x~4 91), 305828#(<= ULTIMATE.start_main_~x~4 100), 305829#(<= ULTIMATE.start_main_~x~4 101), 305830#(<= ULTIMATE.start_main_~x~4 102), 305831#(<= ULTIMATE.start_main_~x~4 103), 305824#(<= ULTIMATE.start_main_~x~4 96), 305825#(<= ULTIMATE.start_main_~x~4 97), 305826#(<= ULTIMATE.start_main_~x~4 98), 305827#(<= ULTIMATE.start_main_~x~4 99), 305836#(<= ULTIMATE.start_main_~x~4 108), 305837#(<= ULTIMATE.start_main_~x~4 109), 305838#(<= ULTIMATE.start_main_~x~4 110), 305832#(<= ULTIMATE.start_main_~x~4 104), 305833#(<= ULTIMATE.start_main_~x~4 105), 305834#(<= ULTIMATE.start_main_~x~4 106), 305835#(<= ULTIMATE.start_main_~x~4 107)] [2018-07-23 13:44:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 737550 backedges. 0 proven. 731500 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2018-07-23 13:44:46,953 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 13:44:46,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 13:44:46,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 13:44:46,954 INFO L87 Difference]: Start difference. First operand 1324 states and 1434 transitions. Second operand 113 states. [2018-07-23 13:44:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:49,054 INFO L93 Difference]: Finished difference Result 1349 states and 1461 transitions. [2018-07-23 13:44:49,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 13:44:49,054 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 1323 [2018-07-23 13:44:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:49,056 INFO L225 Difference]: With dead ends: 1349 [2018-07-23 13:44:49,056 INFO L226 Difference]: Without dead ends: 1347 [2018-07-23 13:44:49,056 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 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:44:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-07-23 13:44:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1336. [2018-07-23 13:44:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2018-07-23 13:44:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1447 transitions. [2018-07-23 13:44:50,934 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1447 transitions. Word has length 1323 [2018-07-23 13:44:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:50,934 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1447 transitions. [2018-07-23 13:44:50,934 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 13:44:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1447 transitions. [2018-07-23 13:44:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1336 [2018-07-23 13:44:50,944 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:50,944 INFO L357 BasicCegarLoop]: trace histogram [1110, 111, 111, 1, 1, 1] [2018-07-23 13:44:50,944 INFO L414 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1069123353, now seen corresponding path program 120 times [2018-07-23 13:44:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:52,575 INFO L134 CoverageAnalysis]: Checked inductivity of 751026 backedges. 0 proven. 744921 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2018-07-23 13:44:52,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:52,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 13:44:52,576 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:44:52,576 INFO L185 omatonBuilderFactory]: Interpolants [311300#(<= ULTIMATE.start_main_~x~4 89), 311301#(<= ULTIMATE.start_main_~x~4 90), 311302#(<= ULTIMATE.start_main_~x~4 91), 311303#(<= ULTIMATE.start_main_~x~4 92), 311296#(<= ULTIMATE.start_main_~x~4 85), 311297#(<= ULTIMATE.start_main_~x~4 86), 311298#(<= ULTIMATE.start_main_~x~4 87), 311299#(<= ULTIMATE.start_main_~x~4 88), 311308#(<= ULTIMATE.start_main_~x~4 97), 311309#(<= ULTIMATE.start_main_~x~4 98), 311310#(<= ULTIMATE.start_main_~x~4 99), 311311#(<= ULTIMATE.start_main_~x~4 100), 311304#(<= ULTIMATE.start_main_~x~4 93), 311305#(<= ULTIMATE.start_main_~x~4 94), 311306#(<= ULTIMATE.start_main_~x~4 95), 311307#(<= ULTIMATE.start_main_~x~4 96), 311316#(<= ULTIMATE.start_main_~x~4 105), 311317#(<= ULTIMATE.start_main_~x~4 106), 311318#(<= ULTIMATE.start_main_~x~4 107), 311319#(<= ULTIMATE.start_main_~x~4 108), 311312#(<= ULTIMATE.start_main_~x~4 101), 311313#(<= ULTIMATE.start_main_~x~4 102), 311314#(<= ULTIMATE.start_main_~x~4 103), 311315#(<= ULTIMATE.start_main_~x~4 104), 311320#(<= ULTIMATE.start_main_~x~4 109), 311321#(<= ULTIMATE.start_main_~x~4 110), 311322#(<= ULTIMATE.start_main_~x~4 111), 311212#(<= ULTIMATE.start_main_~x~4 1), 311213#(<= ULTIMATE.start_main_~x~4 2), 311214#(<= ULTIMATE.start_main_~x~4 3), 311215#(<= ULTIMATE.start_main_~x~4 4), 311209#true, 311210#false, 311211#(<= ULTIMATE.start_main_~x~4 0), 311220#(<= ULTIMATE.start_main_~x~4 9), 311221#(<= ULTIMATE.start_main_~x~4 10), 311222#(<= ULTIMATE.start_main_~x~4 11), 311223#(<= ULTIMATE.start_main_~x~4 12), 311216#(<= ULTIMATE.start_main_~x~4 5), 311217#(<= ULTIMATE.start_main_~x~4 6), 311218#(<= ULTIMATE.start_main_~x~4 7), 311219#(<= ULTIMATE.start_main_~x~4 8), 311228#(<= ULTIMATE.start_main_~x~4 17), 311229#(<= ULTIMATE.start_main_~x~4 18), 311230#(<= ULTIMATE.start_main_~x~4 19), 311231#(<= ULTIMATE.start_main_~x~4 20), 311224#(<= ULTIMATE.start_main_~x~4 13), 311225#(<= ULTIMATE.start_main_~x~4 14), 311226#(<= ULTIMATE.start_main_~x~4 15), 311227#(<= ULTIMATE.start_main_~x~4 16), 311236#(<= ULTIMATE.start_main_~x~4 25), 311237#(<= ULTIMATE.start_main_~x~4 26), 311238#(<= ULTIMATE.start_main_~x~4 27), 311239#(<= ULTIMATE.start_main_~x~4 28), 311232#(<= ULTIMATE.start_main_~x~4 21), 311233#(<= ULTIMATE.start_main_~x~4 22), 311234#(<= ULTIMATE.start_main_~x~4 23), 311235#(<= ULTIMATE.start_main_~x~4 24), 311244#(<= ULTIMATE.start_main_~x~4 33), 311245#(<= ULTIMATE.start_main_~x~4 34), 311246#(<= ULTIMATE.start_main_~x~4 35), 311247#(<= ULTIMATE.start_main_~x~4 36), 311240#(<= ULTIMATE.start_main_~x~4 29), 311241#(<= ULTIMATE.start_main_~x~4 30), 311242#(<= ULTIMATE.start_main_~x~4 31), 311243#(<= ULTIMATE.start_main_~x~4 32), 311252#(<= ULTIMATE.start_main_~x~4 41), 311253#(<= ULTIMATE.start_main_~x~4 42), 311254#(<= ULTIMATE.start_main_~x~4 43), 311255#(<= ULTIMATE.start_main_~x~4 44), 311248#(<= ULTIMATE.start_main_~x~4 37), 311249#(<= ULTIMATE.start_main_~x~4 38), 311250#(<= ULTIMATE.start_main_~x~4 39), 311251#(<= ULTIMATE.start_main_~x~4 40), 311260#(<= ULTIMATE.start_main_~x~4 49), 311261#(<= ULTIMATE.start_main_~x~4 50), 311262#(<= ULTIMATE.start_main_~x~4 51), 311263#(<= ULTIMATE.start_main_~x~4 52), 311256#(<= ULTIMATE.start_main_~x~4 45), 311257#(<= ULTIMATE.start_main_~x~4 46), 311258#(<= ULTIMATE.start_main_~x~4 47), 311259#(<= ULTIMATE.start_main_~x~4 48), 311268#(<= ULTIMATE.start_main_~x~4 57), 311269#(<= ULTIMATE.start_main_~x~4 58), 311270#(<= ULTIMATE.start_main_~x~4 59), 311271#(<= ULTIMATE.start_main_~x~4 60), 311264#(<= ULTIMATE.start_main_~x~4 53), 311265#(<= ULTIMATE.start_main_~x~4 54), 311266#(<= ULTIMATE.start_main_~x~4 55), 311267#(<= ULTIMATE.start_main_~x~4 56), 311276#(<= ULTIMATE.start_main_~x~4 65), 311277#(<= ULTIMATE.start_main_~x~4 66), 311278#(<= ULTIMATE.start_main_~x~4 67), 311279#(<= ULTIMATE.start_main_~x~4 68), 311272#(<= ULTIMATE.start_main_~x~4 61), 311273#(<= ULTIMATE.start_main_~x~4 62), 311274#(<= ULTIMATE.start_main_~x~4 63), 311275#(<= ULTIMATE.start_main_~x~4 64), 311284#(<= ULTIMATE.start_main_~x~4 73), 311285#(<= ULTIMATE.start_main_~x~4 74), 311286#(<= ULTIMATE.start_main_~x~4 75), 311287#(<= ULTIMATE.start_main_~x~4 76), 311280#(<= ULTIMATE.start_main_~x~4 69), 311281#(<= ULTIMATE.start_main_~x~4 70), 311282#(<= ULTIMATE.start_main_~x~4 71), 311283#(<= ULTIMATE.start_main_~x~4 72), 311292#(<= ULTIMATE.start_main_~x~4 81), 311293#(<= ULTIMATE.start_main_~x~4 82), 311294#(<= ULTIMATE.start_main_~x~4 83), 311295#(<= ULTIMATE.start_main_~x~4 84), 311288#(<= ULTIMATE.start_main_~x~4 77), 311289#(<= ULTIMATE.start_main_~x~4 78), 311290#(<= ULTIMATE.start_main_~x~4 79), 311291#(<= ULTIMATE.start_main_~x~4 80)] [2018-07-23 13:44:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 751026 backedges. 0 proven. 744921 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2018-07-23 13:44:52,598 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 13:44:52,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 13:44:52,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 13:44:52,599 INFO L87 Difference]: Start difference. First operand 1336 states and 1447 transitions. Second operand 114 states. [2018-07-23 13:44:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:44:54,678 INFO L93 Difference]: Finished difference Result 1361 states and 1474 transitions. [2018-07-23 13:44:54,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 13:44:54,678 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 1335 [2018-07-23 13:44:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:44:54,680 INFO L225 Difference]: With dead ends: 1361 [2018-07-23 13:44:54,680 INFO L226 Difference]: Without dead ends: 1359 [2018-07-23 13:44:54,680 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 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:44:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2018-07-23 13:44:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1348. [2018-07-23 13:44:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-07-23 13:44:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1460 transitions. [2018-07-23 13:44:56,618 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1460 transitions. Word has length 1335 [2018-07-23 13:44:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:44:56,619 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1460 transitions. [2018-07-23 13:44:56,619 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 13:44:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1460 transitions. [2018-07-23 13:44:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1348 [2018-07-23 13:44:56,630 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:44:56,630 INFO L357 BasicCegarLoop]: trace histogram [1120, 112, 112, 1, 1, 1] [2018-07-23 13:44:56,630 INFO L414 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:44:56,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1484657309, now seen corresponding path program 121 times [2018-07-23 13:44:56,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:44:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:44:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 764624 backedges. 0 proven. 758464 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2018-07-23 13:44:58,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:44:58,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 13:44:58,223 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:44:58,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:44:58,224 INFO L185 omatonBuilderFactory]: Interpolants [316741#true, 316742#false, 316743#(<= ULTIMATE.start_main_~x~4 0), 316748#(<= ULTIMATE.start_main_~x~4 5), 316749#(<= ULTIMATE.start_main_~x~4 6), 316750#(<= ULTIMATE.start_main_~x~4 7), 316751#(<= ULTIMATE.start_main_~x~4 8), 316744#(<= ULTIMATE.start_main_~x~4 1), 316745#(<= ULTIMATE.start_main_~x~4 2), 316746#(<= ULTIMATE.start_main_~x~4 3), 316747#(<= ULTIMATE.start_main_~x~4 4), 316756#(<= ULTIMATE.start_main_~x~4 13), 316757#(<= ULTIMATE.start_main_~x~4 14), 316758#(<= ULTIMATE.start_main_~x~4 15), 316759#(<= ULTIMATE.start_main_~x~4 16), 316752#(<= ULTIMATE.start_main_~x~4 9), 316753#(<= ULTIMATE.start_main_~x~4 10), 316754#(<= ULTIMATE.start_main_~x~4 11), 316755#(<= ULTIMATE.start_main_~x~4 12), 316764#(<= ULTIMATE.start_main_~x~4 21), 316765#(<= ULTIMATE.start_main_~x~4 22), 316766#(<= ULTIMATE.start_main_~x~4 23), 316767#(<= ULTIMATE.start_main_~x~4 24), 316760#(<= ULTIMATE.start_main_~x~4 17), 316761#(<= ULTIMATE.start_main_~x~4 18), 316762#(<= ULTIMATE.start_main_~x~4 19), 316763#(<= ULTIMATE.start_main_~x~4 20), 316772#(<= ULTIMATE.start_main_~x~4 29), 316773#(<= ULTIMATE.start_main_~x~4 30), 316774#(<= ULTIMATE.start_main_~x~4 31), 316775#(<= ULTIMATE.start_main_~x~4 32), 316768#(<= ULTIMATE.start_main_~x~4 25), 316769#(<= ULTIMATE.start_main_~x~4 26), 316770#(<= ULTIMATE.start_main_~x~4 27), 316771#(<= ULTIMATE.start_main_~x~4 28), 316780#(<= ULTIMATE.start_main_~x~4 37), 316781#(<= ULTIMATE.start_main_~x~4 38), 316782#(<= ULTIMATE.start_main_~x~4 39), 316783#(<= ULTIMATE.start_main_~x~4 40), 316776#(<= ULTIMATE.start_main_~x~4 33), 316777#(<= ULTIMATE.start_main_~x~4 34), 316778#(<= ULTIMATE.start_main_~x~4 35), 316779#(<= ULTIMATE.start_main_~x~4 36), 316788#(<= ULTIMATE.start_main_~x~4 45), 316789#(<= ULTIMATE.start_main_~x~4 46), 316790#(<= ULTIMATE.start_main_~x~4 47), 316791#(<= ULTIMATE.start_main_~x~4 48), 316784#(<= ULTIMATE.start_main_~x~4 41), 316785#(<= ULTIMATE.start_main_~x~4 42), 316786#(<= ULTIMATE.start_main_~x~4 43), 316787#(<= ULTIMATE.start_main_~x~4 44), 316796#(<= ULTIMATE.start_main_~x~4 53), 316797#(<= ULTIMATE.start_main_~x~4 54), 316798#(<= ULTIMATE.start_main_~x~4 55), 316799#(<= ULTIMATE.start_main_~x~4 56), 316792#(<= ULTIMATE.start_main_~x~4 49), 316793#(<= ULTIMATE.start_main_~x~4 50), 316794#(<= ULTIMATE.start_main_~x~4 51), 316795#(<= ULTIMATE.start_main_~x~4 52), 316804#(<= ULTIMATE.start_main_~x~4 61), 316805#(<= ULTIMATE.start_main_~x~4 62), 316806#(<= ULTIMATE.start_main_~x~4 63), 316807#(<= ULTIMATE.start_main_~x~4 64), 316800#(<= ULTIMATE.start_main_~x~4 57), 316801#(<= ULTIMATE.start_main_~x~4 58), 316802#(<= ULTIMATE.start_main_~x~4 59), 316803#(<= ULTIMATE.start_main_~x~4 60), 316812#(<= ULTIMATE.start_main_~x~4 69), 316813#(<= ULTIMATE.start_main_~x~4 70), 316814#(<= ULTIMATE.start_main_~x~4 71), 316815#(<= ULTIMATE.start_main_~x~4 72), 316808#(<= ULTIMATE.start_main_~x~4 65), 316809#(<= ULTIMATE.start_main_~x~4 66), 316810#(<= ULTIMATE.start_main_~x~4 67), 316811#(<= ULTIMATE.start_main_~x~4 68), 316820#(<= ULTIMATE.start_main_~x~4 77), 316821#(<= ULTIMATE.start_main_~x~4 78), 316822#(<= ULTIMATE.start_main_~x~4 79), 316823#(<= ULTIMATE.start_main_~x~4 80), 316816#(<= ULTIMATE.start_main_~x~4 73), 316817#(<= ULTIMATE.start_main_~x~4 74), 316818#(<= ULTIMATE.start_main_~x~4 75), 316819#(<= ULTIMATE.start_main_~x~4 76), 316828#(<= ULTIMATE.start_main_~x~4 85), 316829#(<= ULTIMATE.start_main_~x~4 86), 316830#(<= ULTIMATE.start_main_~x~4 87), 316831#(<= ULTIMATE.start_main_~x~4 88), 316824#(<= ULTIMATE.start_main_~x~4 81), 316825#(<= ULTIMATE.start_main_~x~4 82), 316826#(<= ULTIMATE.start_main_~x~4 83), 316827#(<= ULTIMATE.start_main_~x~4 84), 316836#(<= ULTIMATE.start_main_~x~4 93), 316837#(<= ULTIMATE.start_main_~x~4 94), 316838#(<= ULTIMATE.start_main_~x~4 95), 316839#(<= ULTIMATE.start_main_~x~4 96), 316832#(<= ULTIMATE.start_main_~x~4 89), 316833#(<= ULTIMATE.start_main_~x~4 90), 316834#(<= ULTIMATE.start_main_~x~4 91), 316835#(<= ULTIMATE.start_main_~x~4 92), 316844#(<= ULTIMATE.start_main_~x~4 101), 316845#(<= ULTIMATE.start_main_~x~4 102), 316846#(<= ULTIMATE.start_main_~x~4 103), 316847#(<= ULTIMATE.start_main_~x~4 104), 316840#(<= ULTIMATE.start_main_~x~4 97), 316841#(<= ULTIMATE.start_main_~x~4 98), 316842#(<= ULTIMATE.start_main_~x~4 99), 316843#(<= ULTIMATE.start_main_~x~4 100), 316852#(<= ULTIMATE.start_main_~x~4 109), 316853#(<= ULTIMATE.start_main_~x~4 110), 316854#(<= ULTIMATE.start_main_~x~4 111), 316855#(<= ULTIMATE.start_main_~x~4 112), 316848#(<= ULTIMATE.start_main_~x~4 105), 316849#(<= ULTIMATE.start_main_~x~4 106), 316850#(<= ULTIMATE.start_main_~x~4 107), 316851#(<= ULTIMATE.start_main_~x~4 108)] [2018-07-23 13:44:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 764624 backedges. 0 proven. 758464 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2018-07-23 13:44:58,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 13:44:58,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 13:44:58,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 13:44:58,247 INFO L87 Difference]: Start difference. First operand 1348 states and 1460 transitions. Second operand 115 states. [2018-07-23 13:45:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:00,411 INFO L93 Difference]: Finished difference Result 1373 states and 1487 transitions. [2018-07-23 13:45:00,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 13:45:00,412 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 1347 [2018-07-23 13:45:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:00,413 INFO L225 Difference]: With dead ends: 1373 [2018-07-23 13:45:00,413 INFO L226 Difference]: Without dead ends: 1371 [2018-07-23 13:45:00,414 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 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:45:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2018-07-23 13:45:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1360. [2018-07-23 13:45:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-07-23 13:45:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1473 transitions. [2018-07-23 13:45:02,388 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1473 transitions. Word has length 1347 [2018-07-23 13:45:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:02,389 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1473 transitions. [2018-07-23 13:45:02,389 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 13:45:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1473 transitions. [2018-07-23 13:45:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2018-07-23 13:45:02,399 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:02,399 INFO L357 BasicCegarLoop]: trace histogram [1130, 113, 113, 1, 1, 1] [2018-07-23 13:45:02,399 INFO L414 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -910084947, now seen corresponding path program 122 times [2018-07-23 13:45:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:03,960 INFO L134 CoverageAnalysis]: Checked inductivity of 778344 backedges. 0 proven. 772129 refuted. 0 times theorem prover too weak. 6215 trivial. 0 not checked. [2018-07-23 13:45:03,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:03,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 13:45:03,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:03,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:45:03,962 INFO L185 omatonBuilderFactory]: Interpolants [322324#(<= ULTIMATE.start_main_~x~4 0), 322325#(<= ULTIMATE.start_main_~x~4 1), 322326#(<= ULTIMATE.start_main_~x~4 2), 322327#(<= ULTIMATE.start_main_~x~4 3), 322322#true, 322323#false, 322332#(<= ULTIMATE.start_main_~x~4 8), 322333#(<= ULTIMATE.start_main_~x~4 9), 322334#(<= ULTIMATE.start_main_~x~4 10), 322335#(<= ULTIMATE.start_main_~x~4 11), 322328#(<= ULTIMATE.start_main_~x~4 4), 322329#(<= ULTIMATE.start_main_~x~4 5), 322330#(<= ULTIMATE.start_main_~x~4 6), 322331#(<= ULTIMATE.start_main_~x~4 7), 322340#(<= ULTIMATE.start_main_~x~4 16), 322341#(<= ULTIMATE.start_main_~x~4 17), 322342#(<= ULTIMATE.start_main_~x~4 18), 322343#(<= ULTIMATE.start_main_~x~4 19), 322336#(<= ULTIMATE.start_main_~x~4 12), 322337#(<= ULTIMATE.start_main_~x~4 13), 322338#(<= ULTIMATE.start_main_~x~4 14), 322339#(<= ULTIMATE.start_main_~x~4 15), 322348#(<= ULTIMATE.start_main_~x~4 24), 322349#(<= ULTIMATE.start_main_~x~4 25), 322350#(<= ULTIMATE.start_main_~x~4 26), 322351#(<= ULTIMATE.start_main_~x~4 27), 322344#(<= ULTIMATE.start_main_~x~4 20), 322345#(<= ULTIMATE.start_main_~x~4 21), 322346#(<= ULTIMATE.start_main_~x~4 22), 322347#(<= ULTIMATE.start_main_~x~4 23), 322356#(<= ULTIMATE.start_main_~x~4 32), 322357#(<= ULTIMATE.start_main_~x~4 33), 322358#(<= ULTIMATE.start_main_~x~4 34), 322359#(<= ULTIMATE.start_main_~x~4 35), 322352#(<= ULTIMATE.start_main_~x~4 28), 322353#(<= ULTIMATE.start_main_~x~4 29), 322354#(<= ULTIMATE.start_main_~x~4 30), 322355#(<= ULTIMATE.start_main_~x~4 31), 322364#(<= ULTIMATE.start_main_~x~4 40), 322365#(<= ULTIMATE.start_main_~x~4 41), 322366#(<= ULTIMATE.start_main_~x~4 42), 322367#(<= ULTIMATE.start_main_~x~4 43), 322360#(<= ULTIMATE.start_main_~x~4 36), 322361#(<= ULTIMATE.start_main_~x~4 37), 322362#(<= ULTIMATE.start_main_~x~4 38), 322363#(<= ULTIMATE.start_main_~x~4 39), 322372#(<= ULTIMATE.start_main_~x~4 48), 322373#(<= ULTIMATE.start_main_~x~4 49), 322374#(<= ULTIMATE.start_main_~x~4 50), 322375#(<= ULTIMATE.start_main_~x~4 51), 322368#(<= ULTIMATE.start_main_~x~4 44), 322369#(<= ULTIMATE.start_main_~x~4 45), 322370#(<= ULTIMATE.start_main_~x~4 46), 322371#(<= ULTIMATE.start_main_~x~4 47), 322380#(<= ULTIMATE.start_main_~x~4 56), 322381#(<= ULTIMATE.start_main_~x~4 57), 322382#(<= ULTIMATE.start_main_~x~4 58), 322383#(<= ULTIMATE.start_main_~x~4 59), 322376#(<= ULTIMATE.start_main_~x~4 52), 322377#(<= ULTIMATE.start_main_~x~4 53), 322378#(<= ULTIMATE.start_main_~x~4 54), 322379#(<= ULTIMATE.start_main_~x~4 55), 322388#(<= ULTIMATE.start_main_~x~4 64), 322389#(<= ULTIMATE.start_main_~x~4 65), 322390#(<= ULTIMATE.start_main_~x~4 66), 322391#(<= ULTIMATE.start_main_~x~4 67), 322384#(<= ULTIMATE.start_main_~x~4 60), 322385#(<= ULTIMATE.start_main_~x~4 61), 322386#(<= ULTIMATE.start_main_~x~4 62), 322387#(<= ULTIMATE.start_main_~x~4 63), 322396#(<= ULTIMATE.start_main_~x~4 72), 322397#(<= ULTIMATE.start_main_~x~4 73), 322398#(<= ULTIMATE.start_main_~x~4 74), 322399#(<= ULTIMATE.start_main_~x~4 75), 322392#(<= ULTIMATE.start_main_~x~4 68), 322393#(<= ULTIMATE.start_main_~x~4 69), 322394#(<= ULTIMATE.start_main_~x~4 70), 322395#(<= ULTIMATE.start_main_~x~4 71), 322404#(<= ULTIMATE.start_main_~x~4 80), 322405#(<= ULTIMATE.start_main_~x~4 81), 322406#(<= ULTIMATE.start_main_~x~4 82), 322407#(<= ULTIMATE.start_main_~x~4 83), 322400#(<= ULTIMATE.start_main_~x~4 76), 322401#(<= ULTIMATE.start_main_~x~4 77), 322402#(<= ULTIMATE.start_main_~x~4 78), 322403#(<= ULTIMATE.start_main_~x~4 79), 322412#(<= ULTIMATE.start_main_~x~4 88), 322413#(<= ULTIMATE.start_main_~x~4 89), 322414#(<= ULTIMATE.start_main_~x~4 90), 322415#(<= ULTIMATE.start_main_~x~4 91), 322408#(<= ULTIMATE.start_main_~x~4 84), 322409#(<= ULTIMATE.start_main_~x~4 85), 322410#(<= ULTIMATE.start_main_~x~4 86), 322411#(<= ULTIMATE.start_main_~x~4 87), 322420#(<= ULTIMATE.start_main_~x~4 96), 322421#(<= ULTIMATE.start_main_~x~4 97), 322422#(<= ULTIMATE.start_main_~x~4 98), 322423#(<= ULTIMATE.start_main_~x~4 99), 322416#(<= ULTIMATE.start_main_~x~4 92), 322417#(<= ULTIMATE.start_main_~x~4 93), 322418#(<= ULTIMATE.start_main_~x~4 94), 322419#(<= ULTIMATE.start_main_~x~4 95), 322428#(<= ULTIMATE.start_main_~x~4 104), 322429#(<= ULTIMATE.start_main_~x~4 105), 322430#(<= ULTIMATE.start_main_~x~4 106), 322431#(<= ULTIMATE.start_main_~x~4 107), 322424#(<= ULTIMATE.start_main_~x~4 100), 322425#(<= ULTIMATE.start_main_~x~4 101), 322426#(<= ULTIMATE.start_main_~x~4 102), 322427#(<= ULTIMATE.start_main_~x~4 103), 322436#(<= ULTIMATE.start_main_~x~4 112), 322437#(<= ULTIMATE.start_main_~x~4 113), 322432#(<= ULTIMATE.start_main_~x~4 108), 322433#(<= ULTIMATE.start_main_~x~4 109), 322434#(<= ULTIMATE.start_main_~x~4 110), 322435#(<= ULTIMATE.start_main_~x~4 111)] [2018-07-23 13:45:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 778344 backedges. 0 proven. 772129 refuted. 0 times theorem prover too weak. 6215 trivial. 0 not checked. [2018-07-23 13:45:03,984 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 13:45:03,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 13:45:03,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 13:45:03,986 INFO L87 Difference]: Start difference. First operand 1360 states and 1473 transitions. Second operand 116 states. [2018-07-23 13:45:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:06,382 INFO L93 Difference]: Finished difference Result 1385 states and 1500 transitions. [2018-07-23 13:45:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 13:45:06,382 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 1359 [2018-07-23 13:45:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:06,384 INFO L225 Difference]: With dead ends: 1385 [2018-07-23 13:45:06,384 INFO L226 Difference]: Without dead ends: 1383 [2018-07-23 13:45:06,385 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 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:45:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-07-23 13:45:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1372. [2018-07-23 13:45:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-07-23 13:45:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1486 transitions. [2018-07-23 13:45:08,427 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1486 transitions. Word has length 1359 [2018-07-23 13:45:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:08,428 INFO L471 AbstractCegarLoop]: Abstraction has 1372 states and 1486 transitions. [2018-07-23 13:45:08,428 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 13:45:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1486 transitions. [2018-07-23 13:45:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1372 [2018-07-23 13:45:08,438 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:08,438 INFO L357 BasicCegarLoop]: trace histogram [1140, 114, 114, 1, 1, 1] [2018-07-23 13:45:08,438 INFO L414 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:08,438 INFO L82 PathProgramCache]: Analyzing trace with hash -835855113, now seen corresponding path program 123 times [2018-07-23 13:45:08,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 792186 backedges. 0 proven. 785916 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2018-07-23 13:45:10,072 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:10,072 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 13:45:10,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:45:10,073 INFO L185 omatonBuilderFactory]: Interpolants [327957#(<= ULTIMATE.start_main_~x~4 3), 327956#(<= ULTIMATE.start_main_~x~4 2), 327959#(<= ULTIMATE.start_main_~x~4 5), 327958#(<= ULTIMATE.start_main_~x~4 4), 327953#false, 327952#true, 327955#(<= ULTIMATE.start_main_~x~4 1), 327954#(<= ULTIMATE.start_main_~x~4 0), 327965#(<= ULTIMATE.start_main_~x~4 11), 327964#(<= ULTIMATE.start_main_~x~4 10), 327967#(<= ULTIMATE.start_main_~x~4 13), 327966#(<= ULTIMATE.start_main_~x~4 12), 327961#(<= ULTIMATE.start_main_~x~4 7), 327960#(<= ULTIMATE.start_main_~x~4 6), 327963#(<= ULTIMATE.start_main_~x~4 9), 327962#(<= ULTIMATE.start_main_~x~4 8), 327973#(<= ULTIMATE.start_main_~x~4 19), 327972#(<= ULTIMATE.start_main_~x~4 18), 327975#(<= ULTIMATE.start_main_~x~4 21), 327974#(<= ULTIMATE.start_main_~x~4 20), 327969#(<= ULTIMATE.start_main_~x~4 15), 327968#(<= ULTIMATE.start_main_~x~4 14), 327971#(<= ULTIMATE.start_main_~x~4 17), 327970#(<= ULTIMATE.start_main_~x~4 16), 327981#(<= ULTIMATE.start_main_~x~4 27), 327980#(<= ULTIMATE.start_main_~x~4 26), 327983#(<= ULTIMATE.start_main_~x~4 29), 327982#(<= ULTIMATE.start_main_~x~4 28), 327977#(<= ULTIMATE.start_main_~x~4 23), 327976#(<= ULTIMATE.start_main_~x~4 22), 327979#(<= ULTIMATE.start_main_~x~4 25), 327978#(<= ULTIMATE.start_main_~x~4 24), 327989#(<= ULTIMATE.start_main_~x~4 35), 327988#(<= ULTIMATE.start_main_~x~4 34), 327991#(<= ULTIMATE.start_main_~x~4 37), 327990#(<= ULTIMATE.start_main_~x~4 36), 327985#(<= ULTIMATE.start_main_~x~4 31), 327984#(<= ULTIMATE.start_main_~x~4 30), 327987#(<= ULTIMATE.start_main_~x~4 33), 327986#(<= ULTIMATE.start_main_~x~4 32), 327997#(<= ULTIMATE.start_main_~x~4 43), 327996#(<= ULTIMATE.start_main_~x~4 42), 327999#(<= ULTIMATE.start_main_~x~4 45), 327998#(<= ULTIMATE.start_main_~x~4 44), 327993#(<= ULTIMATE.start_main_~x~4 39), 327992#(<= ULTIMATE.start_main_~x~4 38), 327995#(<= ULTIMATE.start_main_~x~4 41), 327994#(<= ULTIMATE.start_main_~x~4 40), 328005#(<= ULTIMATE.start_main_~x~4 51), 328004#(<= ULTIMATE.start_main_~x~4 50), 328007#(<= ULTIMATE.start_main_~x~4 53), 328006#(<= ULTIMATE.start_main_~x~4 52), 328001#(<= ULTIMATE.start_main_~x~4 47), 328000#(<= ULTIMATE.start_main_~x~4 46), 328003#(<= ULTIMATE.start_main_~x~4 49), 328002#(<= ULTIMATE.start_main_~x~4 48), 328013#(<= ULTIMATE.start_main_~x~4 59), 328012#(<= ULTIMATE.start_main_~x~4 58), 328015#(<= ULTIMATE.start_main_~x~4 61), 328014#(<= ULTIMATE.start_main_~x~4 60), 328009#(<= ULTIMATE.start_main_~x~4 55), 328008#(<= ULTIMATE.start_main_~x~4 54), 328011#(<= ULTIMATE.start_main_~x~4 57), 328010#(<= ULTIMATE.start_main_~x~4 56), 328021#(<= ULTIMATE.start_main_~x~4 67), 328020#(<= ULTIMATE.start_main_~x~4 66), 328023#(<= ULTIMATE.start_main_~x~4 69), 328022#(<= ULTIMATE.start_main_~x~4 68), 328017#(<= ULTIMATE.start_main_~x~4 63), 328016#(<= ULTIMATE.start_main_~x~4 62), 328019#(<= ULTIMATE.start_main_~x~4 65), 328018#(<= ULTIMATE.start_main_~x~4 64), 328029#(<= ULTIMATE.start_main_~x~4 75), 328028#(<= ULTIMATE.start_main_~x~4 74), 328031#(<= ULTIMATE.start_main_~x~4 77), 328030#(<= ULTIMATE.start_main_~x~4 76), 328025#(<= ULTIMATE.start_main_~x~4 71), 328024#(<= ULTIMATE.start_main_~x~4 70), 328027#(<= ULTIMATE.start_main_~x~4 73), 328026#(<= ULTIMATE.start_main_~x~4 72), 328037#(<= ULTIMATE.start_main_~x~4 83), 328036#(<= ULTIMATE.start_main_~x~4 82), 328039#(<= ULTIMATE.start_main_~x~4 85), 328038#(<= ULTIMATE.start_main_~x~4 84), 328033#(<= ULTIMATE.start_main_~x~4 79), 328032#(<= ULTIMATE.start_main_~x~4 78), 328035#(<= ULTIMATE.start_main_~x~4 81), 328034#(<= ULTIMATE.start_main_~x~4 80), 328045#(<= ULTIMATE.start_main_~x~4 91), 328044#(<= ULTIMATE.start_main_~x~4 90), 328047#(<= ULTIMATE.start_main_~x~4 93), 328046#(<= ULTIMATE.start_main_~x~4 92), 328041#(<= ULTIMATE.start_main_~x~4 87), 328040#(<= ULTIMATE.start_main_~x~4 86), 328043#(<= ULTIMATE.start_main_~x~4 89), 328042#(<= ULTIMATE.start_main_~x~4 88), 328053#(<= ULTIMATE.start_main_~x~4 99), 328052#(<= ULTIMATE.start_main_~x~4 98), 328055#(<= ULTIMATE.start_main_~x~4 101), 328054#(<= ULTIMATE.start_main_~x~4 100), 328049#(<= ULTIMATE.start_main_~x~4 95), 328048#(<= ULTIMATE.start_main_~x~4 94), 328051#(<= ULTIMATE.start_main_~x~4 97), 328050#(<= ULTIMATE.start_main_~x~4 96), 328061#(<= ULTIMATE.start_main_~x~4 107), 328060#(<= ULTIMATE.start_main_~x~4 106), 328063#(<= ULTIMATE.start_main_~x~4 109), 328062#(<= ULTIMATE.start_main_~x~4 108), 328057#(<= ULTIMATE.start_main_~x~4 103), 328056#(<= ULTIMATE.start_main_~x~4 102), 328059#(<= ULTIMATE.start_main_~x~4 105), 328058#(<= ULTIMATE.start_main_~x~4 104), 328068#(<= ULTIMATE.start_main_~x~4 114), 328065#(<= ULTIMATE.start_main_~x~4 111), 328064#(<= ULTIMATE.start_main_~x~4 110), 328067#(<= ULTIMATE.start_main_~x~4 113), 328066#(<= ULTIMATE.start_main_~x~4 112)] [2018-07-23 13:45:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 792186 backedges. 0 proven. 785916 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2018-07-23 13:45:10,096 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 13:45:10,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 13:45:10,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 13:45:10,097 INFO L87 Difference]: Start difference. First operand 1372 states and 1486 transitions. Second operand 117 states. [2018-07-23 13:45:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:12,564 INFO L93 Difference]: Finished difference Result 1397 states and 1513 transitions. [2018-07-23 13:45:12,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 13:45:12,564 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 1371 [2018-07-23 13:45:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:12,566 INFO L225 Difference]: With dead ends: 1397 [2018-07-23 13:45:12,566 INFO L226 Difference]: Without dead ends: 1395 [2018-07-23 13:45:12,568 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 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 13:45:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-07-23 13:45:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1384. [2018-07-23 13:45:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2018-07-23 13:45:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1499 transitions. [2018-07-23 13:45:14,681 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1499 transitions. Word has length 1371 [2018-07-23 13:45:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:14,682 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1499 transitions. [2018-07-23 13:45:14,682 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 13:45:14,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1499 transitions. [2018-07-23 13:45:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1384 [2018-07-23 13:45:14,693 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:14,693 INFO L357 BasicCegarLoop]: trace histogram [1150, 115, 115, 1, 1, 1] [2018-07-23 13:45:14,693 INFO L414 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2126407233, now seen corresponding path program 124 times [2018-07-23 13:45:14,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 806150 backedges. 0 proven. 799825 refuted. 0 times theorem prover too weak. 6325 trivial. 0 not checked. [2018-07-23 13:45:16,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:16,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-23 13:45:16,418 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:16,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:45:16,419 INFO L185 omatonBuilderFactory]: Interpolants [333631#true, 333637#(<= ULTIMATE.start_main_~x~4 4), 333636#(<= ULTIMATE.start_main_~x~4 3), 333639#(<= ULTIMATE.start_main_~x~4 6), 333638#(<= ULTIMATE.start_main_~x~4 5), 333633#(<= ULTIMATE.start_main_~x~4 0), 333632#false, 333635#(<= ULTIMATE.start_main_~x~4 2), 333634#(<= ULTIMATE.start_main_~x~4 1), 333645#(<= ULTIMATE.start_main_~x~4 12), 333644#(<= ULTIMATE.start_main_~x~4 11), 333647#(<= ULTIMATE.start_main_~x~4 14), 333646#(<= ULTIMATE.start_main_~x~4 13), 333641#(<= ULTIMATE.start_main_~x~4 8), 333640#(<= ULTIMATE.start_main_~x~4 7), 333643#(<= ULTIMATE.start_main_~x~4 10), 333642#(<= ULTIMATE.start_main_~x~4 9), 333653#(<= ULTIMATE.start_main_~x~4 20), 333652#(<= ULTIMATE.start_main_~x~4 19), 333655#(<= ULTIMATE.start_main_~x~4 22), 333654#(<= ULTIMATE.start_main_~x~4 21), 333649#(<= ULTIMATE.start_main_~x~4 16), 333648#(<= ULTIMATE.start_main_~x~4 15), 333651#(<= ULTIMATE.start_main_~x~4 18), 333650#(<= ULTIMATE.start_main_~x~4 17), 333661#(<= ULTIMATE.start_main_~x~4 28), 333660#(<= ULTIMATE.start_main_~x~4 27), 333663#(<= ULTIMATE.start_main_~x~4 30), 333662#(<= ULTIMATE.start_main_~x~4 29), 333657#(<= ULTIMATE.start_main_~x~4 24), 333656#(<= ULTIMATE.start_main_~x~4 23), 333659#(<= ULTIMATE.start_main_~x~4 26), 333658#(<= ULTIMATE.start_main_~x~4 25), 333669#(<= ULTIMATE.start_main_~x~4 36), 333668#(<= ULTIMATE.start_main_~x~4 35), 333671#(<= ULTIMATE.start_main_~x~4 38), 333670#(<= ULTIMATE.start_main_~x~4 37), 333665#(<= ULTIMATE.start_main_~x~4 32), 333664#(<= ULTIMATE.start_main_~x~4 31), 333667#(<= ULTIMATE.start_main_~x~4 34), 333666#(<= ULTIMATE.start_main_~x~4 33), 333677#(<= ULTIMATE.start_main_~x~4 44), 333676#(<= ULTIMATE.start_main_~x~4 43), 333679#(<= ULTIMATE.start_main_~x~4 46), 333678#(<= ULTIMATE.start_main_~x~4 45), 333673#(<= ULTIMATE.start_main_~x~4 40), 333672#(<= ULTIMATE.start_main_~x~4 39), 333675#(<= ULTIMATE.start_main_~x~4 42), 333674#(<= ULTIMATE.start_main_~x~4 41), 333685#(<= ULTIMATE.start_main_~x~4 52), 333684#(<= ULTIMATE.start_main_~x~4 51), 333687#(<= ULTIMATE.start_main_~x~4 54), 333686#(<= ULTIMATE.start_main_~x~4 53), 333681#(<= ULTIMATE.start_main_~x~4 48), 333680#(<= ULTIMATE.start_main_~x~4 47), 333683#(<= ULTIMATE.start_main_~x~4 50), 333682#(<= ULTIMATE.start_main_~x~4 49), 333693#(<= ULTIMATE.start_main_~x~4 60), 333692#(<= ULTIMATE.start_main_~x~4 59), 333695#(<= ULTIMATE.start_main_~x~4 62), 333694#(<= ULTIMATE.start_main_~x~4 61), 333689#(<= ULTIMATE.start_main_~x~4 56), 333688#(<= ULTIMATE.start_main_~x~4 55), 333691#(<= ULTIMATE.start_main_~x~4 58), 333690#(<= ULTIMATE.start_main_~x~4 57), 333701#(<= ULTIMATE.start_main_~x~4 68), 333700#(<= ULTIMATE.start_main_~x~4 67), 333703#(<= ULTIMATE.start_main_~x~4 70), 333702#(<= ULTIMATE.start_main_~x~4 69), 333697#(<= ULTIMATE.start_main_~x~4 64), 333696#(<= ULTIMATE.start_main_~x~4 63), 333699#(<= ULTIMATE.start_main_~x~4 66), 333698#(<= ULTIMATE.start_main_~x~4 65), 333709#(<= ULTIMATE.start_main_~x~4 76), 333708#(<= ULTIMATE.start_main_~x~4 75), 333711#(<= ULTIMATE.start_main_~x~4 78), 333710#(<= ULTIMATE.start_main_~x~4 77), 333705#(<= ULTIMATE.start_main_~x~4 72), 333704#(<= ULTIMATE.start_main_~x~4 71), 333707#(<= ULTIMATE.start_main_~x~4 74), 333706#(<= ULTIMATE.start_main_~x~4 73), 333717#(<= ULTIMATE.start_main_~x~4 84), 333716#(<= ULTIMATE.start_main_~x~4 83), 333719#(<= ULTIMATE.start_main_~x~4 86), 333718#(<= ULTIMATE.start_main_~x~4 85), 333713#(<= ULTIMATE.start_main_~x~4 80), 333712#(<= ULTIMATE.start_main_~x~4 79), 333715#(<= ULTIMATE.start_main_~x~4 82), 333714#(<= ULTIMATE.start_main_~x~4 81), 333725#(<= ULTIMATE.start_main_~x~4 92), 333724#(<= ULTIMATE.start_main_~x~4 91), 333727#(<= ULTIMATE.start_main_~x~4 94), 333726#(<= ULTIMATE.start_main_~x~4 93), 333721#(<= ULTIMATE.start_main_~x~4 88), 333720#(<= ULTIMATE.start_main_~x~4 87), 333723#(<= ULTIMATE.start_main_~x~4 90), 333722#(<= ULTIMATE.start_main_~x~4 89), 333733#(<= ULTIMATE.start_main_~x~4 100), 333732#(<= ULTIMATE.start_main_~x~4 99), 333735#(<= ULTIMATE.start_main_~x~4 102), 333734#(<= ULTIMATE.start_main_~x~4 101), 333729#(<= ULTIMATE.start_main_~x~4 96), 333728#(<= ULTIMATE.start_main_~x~4 95), 333731#(<= ULTIMATE.start_main_~x~4 98), 333730#(<= ULTIMATE.start_main_~x~4 97), 333741#(<= ULTIMATE.start_main_~x~4 108), 333740#(<= ULTIMATE.start_main_~x~4 107), 333743#(<= ULTIMATE.start_main_~x~4 110), 333742#(<= ULTIMATE.start_main_~x~4 109), 333737#(<= ULTIMATE.start_main_~x~4 104), 333736#(<= ULTIMATE.start_main_~x~4 103), 333739#(<= ULTIMATE.start_main_~x~4 106), 333738#(<= ULTIMATE.start_main_~x~4 105), 333748#(<= ULTIMATE.start_main_~x~4 115), 333745#(<= ULTIMATE.start_main_~x~4 112), 333744#(<= ULTIMATE.start_main_~x~4 111), 333747#(<= ULTIMATE.start_main_~x~4 114), 333746#(<= ULTIMATE.start_main_~x~4 113)] [2018-07-23 13:45:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 806150 backedges. 0 proven. 799825 refuted. 0 times theorem prover too weak. 6325 trivial. 0 not checked. [2018-07-23 13:45:16,444 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 13:45:16,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 13:45:16,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 13:45:16,446 INFO L87 Difference]: Start difference. First operand 1384 states and 1499 transitions. Second operand 118 states. [2018-07-23 13:45:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:18,900 INFO L93 Difference]: Finished difference Result 1409 states and 1526 transitions. [2018-07-23 13:45:18,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 13:45:18,901 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 1383 [2018-07-23 13:45:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:18,902 INFO L225 Difference]: With dead ends: 1409 [2018-07-23 13:45:18,902 INFO L226 Difference]: Without dead ends: 1407 [2018-07-23 13:45:18,903 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 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 13:45:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2018-07-23 13:45:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1396. [2018-07-23 13:45:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2018-07-23 13:45:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1512 transitions. [2018-07-23 13:45:21,059 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1512 transitions. Word has length 1383 [2018-07-23 13:45:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:45:21,060 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1512 transitions. [2018-07-23 13:45:21,060 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 13:45:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1512 transitions. [2018-07-23 13:45:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1396 [2018-07-23 13:45:21,072 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:45:21,072 INFO L357 BasicCegarLoop]: trace histogram [1160, 116, 116, 1, 1, 1] [2018-07-23 13:45:21,073 INFO L414 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:45:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash -408334197, now seen corresponding path program 125 times [2018-07-23 13:45:21,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:45:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:45:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 820236 backedges. 0 proven. 813856 refuted. 0 times theorem prover too weak. 6380 trivial. 0 not checked. [2018-07-23 13:45:22,795 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:45:22,795 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-23 13:45:22,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:45:22,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:45:22,797 INFO L185 omatonBuilderFactory]: Interpolants [339461#(<= ULTIMATE.start_main_~x~4 100), 339460#(<= ULTIMATE.start_main_~x~4 99), 339463#(<= ULTIMATE.start_main_~x~4 102), 339462#(<= ULTIMATE.start_main_~x~4 101), 339457#(<= ULTIMATE.start_main_~x~4 96), 339456#(<= ULTIMATE.start_main_~x~4 95), 339459#(<= ULTIMATE.start_main_~x~4 98), 339458#(<= ULTIMATE.start_main_~x~4 97), 339469#(<= ULTIMATE.start_main_~x~4 108), 339468#(<= ULTIMATE.start_main_~x~4 107), 339471#(<= ULTIMATE.start_main_~x~4 110), 339470#(<= ULTIMATE.start_main_~x~4 109), 339465#(<= ULTIMATE.start_main_~x~4 104), 339464#(<= ULTIMATE.start_main_~x~4 103), 339467#(<= ULTIMATE.start_main_~x~4 106), 339466#(<= ULTIMATE.start_main_~x~4 105), 339477#(<= ULTIMATE.start_main_~x~4 116), 339476#(<= ULTIMATE.start_main_~x~4 115), 339473#(<= ULTIMATE.start_main_~x~4 112), 339472#(<= ULTIMATE.start_main_~x~4 111), 339475#(<= ULTIMATE.start_main_~x~4 114), 339474#(<= ULTIMATE.start_main_~x~4 113), 339359#true, 339365#(<= ULTIMATE.start_main_~x~4 4), 339364#(<= ULTIMATE.start_main_~x~4 3), 339367#(<= ULTIMATE.start_main_~x~4 6), 339366#(<= ULTIMATE.start_main_~x~4 5), 339361#(<= ULTIMATE.start_main_~x~4 0), 339360#false, 339363#(<= ULTIMATE.start_main_~x~4 2), 339362#(<= ULTIMATE.start_main_~x~4 1), 339373#(<= ULTIMATE.start_main_~x~4 12), 339372#(<= ULTIMATE.start_main_~x~4 11), 339375#(<= ULTIMATE.start_main_~x~4 14), 339374#(<= ULTIMATE.start_main_~x~4 13), 339369#(<= ULTIMATE.start_main_~x~4 8), 339368#(<= ULTIMATE.start_main_~x~4 7), 339371#(<= ULTIMATE.start_main_~x~4 10), 339370#(<= ULTIMATE.start_main_~x~4 9), 339381#(<= ULTIMATE.start_main_~x~4 20), 339380#(<= ULTIMATE.start_main_~x~4 19), 339383#(<= ULTIMATE.start_main_~x~4 22), 339382#(<= ULTIMATE.start_main_~x~4 21), 339377#(<= ULTIMATE.start_main_~x~4 16), 339376#(<= ULTIMATE.start_main_~x~4 15), 339379#(<= ULTIMATE.start_main_~x~4 18), 339378#(<= ULTIMATE.start_main_~x~4 17), 339389#(<= ULTIMATE.start_main_~x~4 28), 339388#(<= ULTIMATE.start_main_~x~4 27), 339391#(<= ULTIMATE.start_main_~x~4 30), 339390#(<= ULTIMATE.start_main_~x~4 29), 339385#(<= ULTIMATE.start_main_~x~4 24), 339384#(<= ULTIMATE.start_main_~x~4 23), 339387#(<= ULTIMATE.start_main_~x~4 26), 339386#(<= ULTIMATE.start_main_~x~4 25), 339397#(<= ULTIMATE.start_main_~x~4 36), 339396#(<= ULTIMATE.start_main_~x~4 35), 339399#(<= ULTIMATE.start_main_~x~4 38), 339398#(<= ULTIMATE.start_main_~x~4 37), 339393#(<= ULTIMATE.start_main_~x~4 32), 339392#(<= ULTIMATE.start_main_~x~4 31), 339395#(<= ULTIMATE.start_main_~x~4 34), 339394#(<= ULTIMATE.start_main_~x~4 33), 339405#(<= ULTIMATE.start_main_~x~4 44), 339404#(<= ULTIMATE.start_main_~x~4 43), 339407#(<= ULTIMATE.start_main_~x~4 46), 339406#(<= ULTIMATE.start_main_~x~4 45), 339401#(<= ULTIMATE.start_main_~x~4 40), 339400#(<= ULTIMATE.start_main_~x~4 39), 339403#(<= ULTIMATE.start_main_~x~4 42), 339402#(<= ULTIMATE.start_main_~x~4 41), 339413#(<= ULTIMATE.start_main_~x~4 52), 339412#(<= ULTIMATE.start_main_~x~4 51), 339415#(<= ULTIMATE.start_main_~x~4 54), 339414#(<= ULTIMATE.start_main_~x~4 53), 339409#(<= ULTIMATE.start_main_~x~4 48), 339408#(<= ULTIMATE.start_main_~x~4 47), 339411#(<= ULTIMATE.start_main_~x~4 50), 339410#(<= ULTIMATE.start_main_~x~4 49), 339421#(<= ULTIMATE.start_main_~x~4 60), 339420#(<= ULTIMATE.start_main_~x~4 59), 339423#(<= ULTIMATE.start_main_~x~4 62), 339422#(<= ULTIMATE.start_main_~x~4 61), 339417#(<= ULTIMATE.start_main_~x~4 56), 339416#(<= ULTIMATE.start_main_~x~4 55), 339419#(<= ULTIMATE.start_main_~x~4 58), 339418#(<= ULTIMATE.start_main_~x~4 57), 339429#(<= ULTIMATE.start_main_~x~4 68), 339428#(<= ULTIMATE.start_main_~x~4 67), 339431#(<= ULTIMATE.start_main_~x~4 70), 339430#(<= ULTIMATE.start_main_~x~4 69), 339425#(<= ULTIMATE.start_main_~x~4 64), 339424#(<= ULTIMATE.start_main_~x~4 63), 339427#(<= ULTIMATE.start_main_~x~4 66), 339426#(<= ULTIMATE.start_main_~x~4 65), 339437#(<= ULTIMATE.start_main_~x~4 76), 339436#(<= ULTIMATE.start_main_~x~4 75), 339439#(<= ULTIMATE.start_main_~x~4 78), 339438#(<= ULTIMATE.start_main_~x~4 77), 339433#(<= ULTIMATE.start_main_~x~4 72), 339432#(<= ULTIMATE.start_main_~x~4 71), 339435#(<= ULTIMATE.start_main_~x~4 74), 339434#(<= ULTIMATE.start_main_~x~4 73), 339445#(<= ULTIMATE.start_main_~x~4 84), 339444#(<= ULTIMATE.start_main_~x~4 83), 339447#(<= ULTIMATE.start_main_~x~4 86), 339446#(<= ULTIMATE.start_main_~x~4 85), 339441#(<= ULTIMATE.start_main_~x~4 80), 339440#(<= ULTIMATE.start_main_~x~4 79), 339443#(<= ULTIMATE.start_main_~x~4 82), 339442#(<= ULTIMATE.start_main_~x~4 81), 339453#(<= ULTIMATE.start_main_~x~4 92), 339452#(<= ULTIMATE.start_main_~x~4 91), 339455#(<= ULTIMATE.start_main_~x~4 94), 339454#(<= ULTIMATE.start_main_~x~4 93), 339449#(<= ULTIMATE.start_main_~x~4 88), 339448#(<= ULTIMATE.start_main_~x~4 87), 339451#(<= ULTIMATE.start_main_~x~4 90), 339450#(<= ULTIMATE.start_main_~x~4 89)] [2018-07-23 13:45:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 820236 backedges. 0 proven. 813856 refuted. 0 times theorem prover too weak. 6380 trivial. 0 not checked. [2018-07-23 13:45:22,834 INFO L450 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-23 13:45:22,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-23 13:45:22,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 13:45:22,836 INFO L87 Difference]: Start difference. First operand 1396 states and 1512 transitions. Second operand 119 states. [2018-07-23 13:45:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:45:25,317 INFO L93 Difference]: Finished difference Result 1421 states and 1539 transitions. [2018-07-23 13:45:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-23 13:45:25,318 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 1395 [2018-07-23 13:45:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:45:25,319 INFO L225 Difference]: With dead ends: 1421 [2018-07-23 13:45:25,319 INFO L226 Difference]: Without dead ends: 1419 [2018-07-23 13:45:25,320 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 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 13:45:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. Received shutdown request... [2018-07-23 13:45:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1408. [2018-07-23 13:45:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2018-07-23 13:45:27,514 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 13:45:27,520 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 13:45:27,520 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:45:27 BoogieIcfgContainer [2018-07-23 13:45:27,521 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:45:27,522 INFO L168 Benchmark]: Toolchain (without parser) took 252690.56 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -571.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-23 13:45:27,524 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 13:45:27,524 INFO L168 Benchmark]: Boogie Preprocessor took 50.63 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 13:45:27,524 INFO L168 Benchmark]: RCFGBuilder took 219.67 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 13:45:27,525 INFO L168 Benchmark]: TraceAbstraction took 252415.95 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -581.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-07-23 13:45:27,527 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.63 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 219.67 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 252415.95 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -581.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 35). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 252.3s OverallTime, 127 OverallIterations, 1160 TraceHistogramMax, 90.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 518 SDtfs, 13806 SDslu, 9625 SDs, 0 SdLazy, 16795 SolverSat, 316 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7095 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6958 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s Time, 1.2s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1396occurred in iteration=126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 380532/32120352 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 80.6s AutomataMinimizationTime, 127 MinimizatonAttempts, 1235 StatesRemovedByMinimization, 116 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 82054 NumberOfCodeBlocks, 82054 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 81927 ConstructedInterpolants, 0 QuantifiedInterpolants, 228500203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 127 InterpolantComputations, 2 PerfectInterpolantSequences, 380532/32120352 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-45-27-542.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-45-27-542.csv Completed graceful shutdown