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/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:20:16,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:20:16,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:20:16,874 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:20:16,875 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:20:16,876 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:20:16,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:20:16,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:20:16,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:20:16,881 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:20:16,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:20:16,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:20:16,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:20:16,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:20:16,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:20:16,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:20:16,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:20:16,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:20:16,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:20:16,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:20:16,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:20:16,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:20:16,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:20:16,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:20:16,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:20:16,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:20:16,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:20:16,901 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:20:16,902 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:20:16,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:20:16,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:20:16,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:20:16,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:20:16,905 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:20:16,906 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:20:16,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:20:16,907 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 15:20:16,921 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:20:16,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:20:16,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:20:16,923 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:20:16,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:20:16,923 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:20:16,924 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:20:16,924 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:20:16,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:20:16,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:20:16,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:20:16,985 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:20:16,986 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:20:16,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl [2018-07-23 15:20:16,987 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl' [2018-07-23 15:20:17,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:20:17,034 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:20:17,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:20:17,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:20:17,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:20:17,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,069 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:20:17,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:20:17,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:20:17,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:20:17,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/1) ... [2018-07-23 15:20:17,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:20:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:20:17,313 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:20:17,313 INFO L202 PluginConnector]: Adding new model afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:20:17 BoogieIcfgContainer [2018-07-23 15:20:17,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:20:17,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:20:17,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:20:17,319 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:20:17,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:20:17" (1/2) ... [2018-07-23 15:20:17,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@375dab01 and model type afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:20:17, skipping insertion in model container [2018-07-23 15:20:17,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:20:17" (2/2) ... [2018-07-23 15:20:17,323 INFO L112 eAbstractionObserver]: Analyzing ICFG afnp2014.c.i_3.bpl [2018-07-23 15:20:17,333 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:20:17,342 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:20:17,391 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:20:17,392 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:20:17,392 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:20:17,393 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:20:17,393 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:20:17,393 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:20:17,393 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:20:17,394 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:20:17,394 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:20:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 15:20:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:20:17,419 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:17,420 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:20:17,421 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-07-23 15:20:17,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:17,516 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:20:17,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:20:17,521 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:20:17,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:20:17,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:20:17,540 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 15:20:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:17,578 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 15:20:17,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:20:17,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 15:20:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:17,592 INFO L225 Difference]: With dead ends: 10 [2018-07-23 15:20:17,592 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 15:20:17,595 INFO L573 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 15:20:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 15:20:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 15:20:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 15:20:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 15:20:17,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 15:20:17,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:17,651 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 15:20:17,651 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:20:17,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 15:20:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:20:17,652 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:17,652 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 15:20:17,653 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:17,653 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-07-23 15:20:17,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:17,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:17,720 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:20:17,723 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:20:17,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:20:17,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:20:17,725 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 15:20:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:17,773 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 15:20:17,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:20:17,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 15:20:17,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:17,775 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:20:17,775 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 15:20:17,776 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:20:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 15:20:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 15:20:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:20:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:20:17,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 15:20:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:17,781 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:20:17,781 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:20:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:20:17,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:20:17,782 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:17,782 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 15:20:17,782 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:17,783 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-07-23 15:20:17,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:17,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:17,822 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:20:17,823 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:20:17,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:20:17,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:20:17,824 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 15:20:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:17,872 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 15:20:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:20:17,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 15:20:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:17,874 INFO L225 Difference]: With dead ends: 13 [2018-07-23 15:20:17,874 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 15:20:17,875 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:20:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 15:20:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 15:20:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:20:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:20:17,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 15:20:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:17,880 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:20:17,880 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:20:17,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:20:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:20:17,881 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:17,881 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 15:20:17,881 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:17,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2018-07-23 15:20:17,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:17,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:17,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:20:17,933 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:20:17,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:20:17,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:20:17,934 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 15:20:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,018 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:20:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:20:18,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 15:20:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,020 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:20:18,020 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:20:18,021 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:20:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:20:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:20:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:20:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:20:18,033 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 15:20:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,034 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:20:18,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:20:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:20:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:20:18,035 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,035 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 15:20:18,035 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2018-07-23 15:20:18,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:18,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:18,146 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:20:18,146 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:20:18,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:20:18,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:20:18,147 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 15:20:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,240 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 15:20:18,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:20:18,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 15:20:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,241 INFO L225 Difference]: With dead ends: 17 [2018-07-23 15:20:18,242 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 15:20:18,242 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:20:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 15:20:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 15:20:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 15:20:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 15:20:18,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 15:20:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,251 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 15:20:18,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:20:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 15:20:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 15:20:18,254 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,254 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 15:20:18,254 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2018-07-23 15:20:18,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:18,346 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:18,347 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:20:18,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:20:18,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:20:18,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:20:18,353 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-23 15:20:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,450 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 15:20:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:20:18,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 15:20:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,452 INFO L225 Difference]: With dead ends: 19 [2018-07-23 15:20:18,452 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 15:20:18,453 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:20:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 15:20:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 15:20:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:20:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:20:18,469 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 15:20:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,470 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:20:18,470 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:20:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:20:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:20:18,471 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,471 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 15:20:18,473 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2018-07-23 15:20:18,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:18,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:18,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:20:18,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:20:18,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:20:18,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:20:18,569 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-23 15:20:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,663 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 15:20:18,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:20:18,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 15:20:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,664 INFO L225 Difference]: With dead ends: 21 [2018-07-23 15:20:18,664 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 15:20:18,665 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:20:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 15:20:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 15:20:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 15:20:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 15:20:18,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 15:20:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,677 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 15:20:18,677 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:20:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 15:20:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:20:18,679 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,680 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 15:20:18,680 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2018-07-23 15:20:18,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:18,751 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:18,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:20:18,752 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:20:18,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:20:18,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:20:18,754 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-23 15:20:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,832 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 15:20:18,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:20:18,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:20:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,833 INFO L225 Difference]: With dead ends: 23 [2018-07-23 15:20:18,833 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 15:20:18,836 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:20:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 15:20:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 15:20:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 15:20:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 15:20:18,844 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 15:20:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,844 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 15:20:18,844 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:20:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 15:20:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:20:18,845 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,845 INFO L353 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 15:20:18,846 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2018-07-23 15:20:18,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:18,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:18,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:20:18,904 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:20:18,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:20:18,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:20:18,906 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-23 15:20:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:18,970 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 15:20:18,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:20:18,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 15:20:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:18,971 INFO L225 Difference]: With dead ends: 25 [2018-07-23 15:20:18,971 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 15:20:18,972 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:20:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 15:20:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 15:20:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 15:20:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 15:20:18,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-23 15:20:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 15:20:18,981 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:20:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 15:20:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:20:18,984 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:18,984 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-23 15:20:18,984 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:18,985 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2018-07-23 15:20:18,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:19,048 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:19,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:19,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:20:19,050 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:20:19,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:20:19,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:20:19,051 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-23 15:20:19,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:19,127 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 15:20:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:20:19,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 15:20:19,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:19,129 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:20:19,129 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 15:20:19,129 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:20:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 15:20:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 15:20:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:20:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 15:20:19,137 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-23 15:20:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:19,137 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 15:20:19,137 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:20:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 15:20:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:20:19,138 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:19,138 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-23 15:20:19,139 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2018-07-23 15:20:19,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:19,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:19,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:20:19,223 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:20:19,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:20:19,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:20:19,224 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-23 15:20:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:19,316 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 15:20:19,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:20:19,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 15:20:19,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:19,317 INFO L225 Difference]: With dead ends: 29 [2018-07-23 15:20:19,318 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 15:20:19,318 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:20:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 15:20:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 15:20:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 15:20:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 15:20:19,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-23 15:20:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:19,333 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 15:20:19,333 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:20:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 15:20:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 15:20:19,334 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:19,334 INFO L353 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-23 15:20:19,334 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2018-07-23 15:20:19,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:19,423 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:19,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:20:19,424 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:20:19,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:20:19,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:20:19,425 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-23 15:20:19,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:19,541 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 15:20:19,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:20:19,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 15:20:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:19,545 INFO L225 Difference]: With dead ends: 31 [2018-07-23 15:20:19,545 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 15:20:19,546 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:20:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 15:20:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 15:20:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:20:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:20:19,559 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-23 15:20:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:19,559 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:20:19,559 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:20:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:20:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:20:19,560 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:19,560 INFO L353 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-23 15:20:19,561 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:19,561 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2018-07-23 15:20:19,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:19,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:19,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:20:19,653 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:20:19,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:20:19,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:20:19,655 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-23 15:20:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:19,778 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 15:20:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:20:19,779 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 15:20:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:19,780 INFO L225 Difference]: With dead ends: 33 [2018-07-23 15:20:19,780 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 15:20:19,781 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:20:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 15:20:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 15:20:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 15:20:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 15:20:19,795 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-23 15:20:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 15:20:19,796 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:20:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 15:20:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 15:20:19,799 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:19,799 INFO L353 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-23 15:20:19,800 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2018-07-23 15:20:19,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:19,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:19,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:20:19,925 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:20:19,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:20:19,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:20:19,926 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-23 15:20:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:20,055 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 15:20:20,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:20:20,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 15:20:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:20,056 INFO L225 Difference]: With dead ends: 35 [2018-07-23 15:20:20,056 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 15:20:20,057 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:20:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 15:20:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 15:20:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 15:20:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 15:20:20,067 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-23 15:20:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:20,068 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 15:20:20,068 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:20:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 15:20:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 15:20:20,069 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:20,069 INFO L353 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-23 15:20:20,069 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2018-07-23 15:20:20,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:20,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:20,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:20:20,189 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:20:20,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:20:20,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:20:20,191 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-23 15:20:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:20,343 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 15:20:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:20:20,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 15:20:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:20,345 INFO L225 Difference]: With dead ends: 37 [2018-07-23 15:20:20,345 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 15:20:20,346 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:20:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 15:20:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 15:20:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 15:20:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 15:20:20,359 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-23 15:20:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:20,359 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 15:20:20,359 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:20:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 15:20:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 15:20:20,360 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:20,361 INFO L353 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-23 15:20:20,361 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2018-07-23 15:20:20,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:20,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:20,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:20:20,501 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:20:20,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:20:20,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:20:20,503 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-23 15:20:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:20,668 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 15:20:20,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:20:20,669 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 15:20:20,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:20,671 INFO L225 Difference]: With dead ends: 39 [2018-07-23 15:20:20,671 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 15:20:20,672 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:20:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 15:20:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 15:20:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 15:20:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 15:20:20,689 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-23 15:20:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:20,689 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 15:20:20,689 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:20:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 15:20:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 15:20:20,690 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:20,690 INFO L353 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-23 15:20:20,691 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2018-07-23 15:20:20,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:20,815 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:20,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 15:20:20,816 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 15:20:20,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 15:20:20,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:20:20,817 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-23 15:20:20,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:20,983 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 15:20:20,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:20:20,984 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-23 15:20:20,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:20,985 INFO L225 Difference]: With dead ends: 41 [2018-07-23 15:20:20,985 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 15:20:20,985 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:20:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 15:20:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 15:20:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 15:20:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 15:20:21,004 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-23 15:20:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:21,005 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 15:20:21,005 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 15:20:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 15:20:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 15:20:21,006 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:21,006 INFO L353 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-23 15:20:21,006 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2018-07-23 15:20:21,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:21,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:21,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 15:20:21,167 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 15:20:21,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 15:20:21,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:20:21,168 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-23 15:20:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:21,355 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 15:20:21,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:20:21,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-23 15:20:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:21,360 INFO L225 Difference]: With dead ends: 43 [2018-07-23 15:20:21,360 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 15:20:21,368 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:20:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 15:20:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 15:20:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 15:20:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 15:20:21,385 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-23 15:20:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:21,385 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 15:20:21,385 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 15:20:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 15:20:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 15:20:21,390 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:21,391 INFO L353 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-23 15:20:21,391 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2018-07-23 15:20:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:21,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:21,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 15:20:21,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 15:20:21,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 15:20:21,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:20:21,619 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-23 15:20:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:21,820 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 15:20:21,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:20:21,820 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-23 15:20:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:21,821 INFO L225 Difference]: With dead ends: 45 [2018-07-23 15:20:21,821 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 15:20:21,823 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:20:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 15:20:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 15:20:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 15:20:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 15:20:21,841 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-23 15:20:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:21,842 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 15:20:21,842 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 15:20:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 15:20:21,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 15:20:21,843 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:21,843 INFO L353 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-23 15:20:21,843 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2018-07-23 15:20:21,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:21,989 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:21,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 15:20:21,990 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 15:20:21,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 15:20:21,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:20:21,991 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-23 15:20:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:22,195 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 15:20:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:20:22,195 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-23 15:20:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:22,196 INFO L225 Difference]: With dead ends: 47 [2018-07-23 15:20:22,196 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 15:20:22,197 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:20:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 15:20:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 15:20:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 15:20:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 15:20:22,218 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-23 15:20:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:22,218 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 15:20:22,218 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 15:20:22,219 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 15:20:22,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 15:20:22,219 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:22,219 INFO L353 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-23 15:20:22,220 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:22,220 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2018-07-23 15:20:22,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:22,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:22,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 15:20:22,378 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 15:20:22,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 15:20:22,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:20:22,379 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-23 15:20:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:22,611 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 15:20:22,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:20:22,612 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-23 15:20:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:22,612 INFO L225 Difference]: With dead ends: 49 [2018-07-23 15:20:22,614 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 15:20:22,614 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:20:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 15:20:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 15:20:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 15:20:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 15:20:22,631 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-23 15:20:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:22,632 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 15:20:22,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 15:20:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 15:20:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 15:20:22,632 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:22,633 INFO L353 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-23 15:20:22,633 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2018-07-23 15:20:22,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:22,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:22,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 15:20:22,801 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 15:20:22,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 15:20:22,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:20:22,803 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-23 15:20:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:23,027 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 15:20:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:20:23,028 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-23 15:20:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:23,028 INFO L225 Difference]: With dead ends: 51 [2018-07-23 15:20:23,028 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 15:20:23,029 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:20:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 15:20:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 15:20:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 15:20:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 15:20:23,048 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-23 15:20:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:23,048 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 15:20:23,048 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 15:20:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 15:20:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 15:20:23,049 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:23,052 INFO L353 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-23 15:20:23,052 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2018-07-23 15:20:23,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:23,200 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:23,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 15:20:23,200 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 15:20:23,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 15:20:23,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:20:23,201 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-23 15:20:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:23,431 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 15:20:23,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:20:23,431 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-23 15:20:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:23,432 INFO L225 Difference]: With dead ends: 53 [2018-07-23 15:20:23,432 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 15:20:23,433 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:20:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 15:20:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 15:20:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 15:20:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 15:20:23,448 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-23 15:20:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:23,448 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 15:20:23,448 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 15:20:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 15:20:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 15:20:23,449 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:23,449 INFO L353 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-23 15:20:23,449 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2018-07-23 15:20:23,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:23,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:23,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 15:20:23,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 15:20:23,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 15:20:23,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:20:23,605 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-23 15:20:23,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:23,857 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 15:20:23,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:20:23,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-23 15:20:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:23,858 INFO L225 Difference]: With dead ends: 55 [2018-07-23 15:20:23,858 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 15:20:23,859 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:20:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 15:20:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 15:20:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 15:20:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 15:20:23,873 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-23 15:20:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:23,874 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 15:20:23,874 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 15:20:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 15:20:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 15:20:23,875 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:23,875 INFO L353 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-23 15:20:23,875 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:23,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2018-07-23 15:20:23,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:24,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:24,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 15:20:24,047 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 15:20:24,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 15:20:24,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:20:24,049 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-23 15:20:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:24,344 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 15:20:24,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:20:24,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-23 15:20:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:24,345 INFO L225 Difference]: With dead ends: 57 [2018-07-23 15:20:24,345 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 15:20:24,346 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:20:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 15:20:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 15:20:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 15:20:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 15:20:24,373 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-23 15:20:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:24,373 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 15:20:24,374 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 15:20:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 15:20:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 15:20:24,374 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:24,374 INFO L353 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-23 15:20:24,375 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2018-07-23 15:20:24,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:24,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:24,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 15:20:24,583 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 15:20:24,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 15:20:24,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:20:24,584 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-23 15:20:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:24,858 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 15:20:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:20:24,859 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-23 15:20:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:24,860 INFO L225 Difference]: With dead ends: 59 [2018-07-23 15:20:24,860 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 15:20:24,861 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:20:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 15:20:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 15:20:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 15:20:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 15:20:24,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-23 15:20:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:24,879 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 15:20:24,879 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 15:20:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 15:20:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 15:20:24,880 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:24,880 INFO L353 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-23 15:20:24,880 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2018-07-23 15:20:24,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:25,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:25,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 15:20:25,054 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 15:20:25,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 15:20:25,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:20:25,055 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-23 15:20:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:25,338 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 15:20:25,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:20:25,338 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-23 15:20:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:25,339 INFO L225 Difference]: With dead ends: 61 [2018-07-23 15:20:25,339 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 15:20:25,340 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:20:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 15:20:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 15:20:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 15:20:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 15:20:25,356 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-23 15:20:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:25,357 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 15:20:25,357 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 15:20:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 15:20:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 15:20:25,358 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:25,358 INFO L353 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-23 15:20:25,358 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:25,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2018-07-23 15:20:25,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:25,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:25,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 15:20:25,541 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 15:20:25,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 15:20:25,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:20:25,542 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-23 15:20:25,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:25,846 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 15:20:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:20:25,847 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-23 15:20:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:25,848 INFO L225 Difference]: With dead ends: 63 [2018-07-23 15:20:25,848 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 15:20:25,849 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:20:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 15:20:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 15:20:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 15:20:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 15:20:25,866 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-23 15:20:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:25,866 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 15:20:25,867 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 15:20:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 15:20:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 15:20:25,867 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:25,867 INFO L353 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-23 15:20:25,868 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:25,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2018-07-23 15:20:25,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:26,061 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:26,062 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 15:20:26,062 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 15:20:26,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 15:20:26,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:20:26,063 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-23 15:20:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:26,357 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 15:20:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:20:26,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-23 15:20:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:26,358 INFO L225 Difference]: With dead ends: 65 [2018-07-23 15:20:26,358 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 15:20:26,359 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:20:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 15:20:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 15:20:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 15:20:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 15:20:26,376 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-23 15:20:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:26,376 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 15:20:26,376 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 15:20:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 15:20:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 15:20:26,377 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:26,377 INFO L353 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-23 15:20:26,377 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:26,377 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2018-07-23 15:20:26,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:26,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:26,575 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 15:20:26,576 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 15:20:26,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 15:20:26,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:20:26,577 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-23 15:20:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:26,926 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 15:20:26,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 15:20:26,927 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-23 15:20:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:26,928 INFO L225 Difference]: With dead ends: 67 [2018-07-23 15:20:26,928 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 15:20:26,929 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:20:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 15:20:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 15:20:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:20:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 15:20:26,952 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-23 15:20:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:26,952 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 15:20:26,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 15:20:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 15:20:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:20:26,953 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:26,953 INFO L353 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-23 15:20:26,953 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2018-07-23 15:20:26,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:27,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:27,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 15:20:27,252 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 15:20:27,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 15:20:27,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:20:27,253 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-23 15:20:27,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:27,632 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 15:20:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:20:27,632 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-23 15:20:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:27,633 INFO L225 Difference]: With dead ends: 69 [2018-07-23 15:20:27,633 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 15:20:27,634 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:20:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 15:20:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 15:20:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 15:20:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 15:20:27,653 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-23 15:20:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:27,653 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 15:20:27,654 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 15:20:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 15:20:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 15:20:27,654 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:27,654 INFO L353 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-23 15:20:27,655 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2018-07-23 15:20:27,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:27,872 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:27,872 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 15:20:27,873 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 15:20:27,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 15:20:27,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:20:27,874 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-23 15:20:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:28,214 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 15:20:28,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:20:28,214 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-23 15:20:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:28,215 INFO L225 Difference]: With dead ends: 71 [2018-07-23 15:20:28,215 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 15:20:28,216 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:20:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 15:20:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 15:20:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 15:20:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 15:20:28,237 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-23 15:20:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:28,237 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 15:20:28,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 15:20:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 15:20:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:20:28,238 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:28,238 INFO L353 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-23 15:20:28,239 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2018-07-23 15:20:28,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:28,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:28,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 15:20:28,470 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 15:20:28,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 15:20:28,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:20:28,471 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-23 15:20:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:28,856 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 15:20:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:20:28,856 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-23 15:20:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:28,857 INFO L225 Difference]: With dead ends: 73 [2018-07-23 15:20:28,857 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 15:20:28,858 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:20:28,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 15:20:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 15:20:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 15:20:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 15:20:28,878 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-23 15:20:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:28,878 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 15:20:28,878 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 15:20:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 15:20:28,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 15:20:28,879 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:28,879 INFO L353 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-23 15:20:28,879 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2018-07-23 15:20:28,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:29,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:29,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 15:20:29,109 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 15:20:29,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 15:20:29,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:20:29,111 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-23 15:20:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:29,480 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 15:20:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:20:29,480 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-23 15:20:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:29,481 INFO L225 Difference]: With dead ends: 75 [2018-07-23 15:20:29,481 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 15:20:29,482 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:20:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 15:20:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 15:20:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 15:20:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 15:20:29,503 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-23 15:20:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 15:20:29,503 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 15:20:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 15:20:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 15:20:29,504 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:29,504 INFO L353 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-23 15:20:29,504 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2018-07-23 15:20:29,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:29,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:29,727 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 15:20:29,727 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 15:20:29,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 15:20:29,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:20:29,728 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-23 15:20:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:30,132 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 15:20:30,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:20:30,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-23 15:20:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:30,133 INFO L225 Difference]: With dead ends: 77 [2018-07-23 15:20:30,133 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 15:20:30,134 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:20:30,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 15:20:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 15:20:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 15:20:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 15:20:30,159 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-23 15:20:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:30,159 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 15:20:30,159 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 15:20:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 15:20:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 15:20:30,160 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:30,160 INFO L353 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-23 15:20:30,160 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2018-07-23 15:20:30,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:30,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:30,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 15:20:30,441 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 15:20:30,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 15:20:30,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:20:30,442 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-23 15:20:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:30,874 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 15:20:30,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 15:20:30,875 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-23 15:20:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:30,875 INFO L225 Difference]: With dead ends: 79 [2018-07-23 15:20:30,875 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 15:20:30,878 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:20:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 15:20:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 15:20:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 15:20:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 15:20:30,898 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-23 15:20:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:30,899 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 15:20:30,899 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 15:20:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 15:20:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:20:30,900 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:30,900 INFO L353 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-23 15:20:30,900 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2018-07-23 15:20:30,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:31,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:31,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 15:20:31,124 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 15:20:31,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 15:20:31,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:20:31,125 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-23 15:20:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:31,510 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 15:20:31,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:20:31,510 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-23 15:20:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:31,511 INFO L225 Difference]: With dead ends: 81 [2018-07-23 15:20:31,511 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 15:20:31,512 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:20:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 15:20:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 15:20:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 15:20:31,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 15:20:31,533 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-23 15:20:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:31,533 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 15:20:31,534 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 15:20:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 15:20:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 15:20:31,534 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:31,534 INFO L353 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-23 15:20:31,535 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:31,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2018-07-23 15:20:31,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:31,763 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:31,763 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 15:20:31,763 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 15:20:31,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 15:20:31,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:20:31,765 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-23 15:20:32,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:32,175 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 15:20:32,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:20:32,175 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-23 15:20:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:32,176 INFO L225 Difference]: With dead ends: 83 [2018-07-23 15:20:32,176 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 15:20:32,177 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:20:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 15:20:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 15:20:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 15:20:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 15:20:32,197 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-23 15:20:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:32,198 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 15:20:32,198 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 15:20:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 15:20:32,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 15:20:32,198 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:32,199 INFO L353 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-23 15:20:32,199 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:32,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2018-07-23 15:20:32,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:32,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:32,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 15:20:32,437 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 15:20:32,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 15:20:32,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:20:32,438 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-23 15:20:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:32,875 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 15:20:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 15:20:32,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-23 15:20:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:32,876 INFO L225 Difference]: With dead ends: 85 [2018-07-23 15:20:32,876 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 15:20:32,877 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:20:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 15:20:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 15:20:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 15:20:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 15:20:32,897 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-23 15:20:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:32,898 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 15:20:32,898 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 15:20:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 15:20:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 15:20:32,899 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:32,899 INFO L353 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-23 15:20:32,899 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:32,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2018-07-23 15:20:32,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:33,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:33,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 15:20:33,167 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 15:20:33,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 15:20:33,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:20:33,169 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-23 15:20:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:33,589 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 15:20:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 15:20:33,590 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-23 15:20:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:33,590 INFO L225 Difference]: With dead ends: 87 [2018-07-23 15:20:33,591 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 15:20:33,591 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:20:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 15:20:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 15:20:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 15:20:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 15:20:33,612 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-23 15:20:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:33,612 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 15:20:33,612 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 15:20:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 15:20:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 15:20:33,613 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:33,613 INFO L353 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-23 15:20:33,613 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2018-07-23 15:20:33,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:33,853 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:33,853 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 15:20:33,854 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 15:20:33,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 15:20:33,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:20:33,855 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-23 15:20:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:34,281 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 15:20:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:20:34,282 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-23 15:20:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:34,283 INFO L225 Difference]: With dead ends: 89 [2018-07-23 15:20:34,283 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 15:20:34,284 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:20:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 15:20:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 15:20:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 15:20:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 15:20:34,304 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-23 15:20:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:34,304 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 15:20:34,304 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 15:20:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 15:20:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 15:20:34,305 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:34,305 INFO L353 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-23 15:20:34,305 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2018-07-23 15:20:34,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:34,558 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:34,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 15:20:34,559 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 15:20:34,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 15:20:34,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:20:34,560 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-23 15:20:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:34,999 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 15:20:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 15:20:35,000 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-23 15:20:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:35,001 INFO L225 Difference]: With dead ends: 91 [2018-07-23 15:20:35,001 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 15:20:35,002 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:20:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 15:20:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 15:20:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:20:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 15:20:35,022 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-23 15:20:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:35,022 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 15:20:35,022 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 15:20:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 15:20:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:20:35,023 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:35,023 INFO L353 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-23 15:20:35,023 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2018-07-23 15:20:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:35,275 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:35,275 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 15:20:35,275 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 15:20:35,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 15:20:35,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:20:35,277 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-23 15:20:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:35,755 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 15:20:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:20:35,756 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-23 15:20:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:35,757 INFO L225 Difference]: With dead ends: 93 [2018-07-23 15:20:35,757 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 15:20:35,759 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:20:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 15:20:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 15:20:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 15:20:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 15:20:35,789 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-23 15:20:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 15:20:35,790 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 15:20:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 15:20:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 15:20:35,791 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:35,791 INFO L353 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-23 15:20:35,791 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2018-07-23 15:20:35,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:36,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:36,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 15:20:36,101 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 15:20:36,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 15:20:36,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:20:36,102 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-23 15:20:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:36,568 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 15:20:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:20:36,568 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-23 15:20:36,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:36,569 INFO L225 Difference]: With dead ends: 95 [2018-07-23 15:20:36,569 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 15:20:36,570 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:20:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 15:20:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 15:20:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 15:20:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 15:20:36,592 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-23 15:20:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 15:20:36,592 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 15:20:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 15:20:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 15:20:36,593 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:36,593 INFO L353 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-23 15:20:36,594 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:36,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2018-07-23 15:20:36,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:36,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:36,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 15:20:36,876 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 15:20:36,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 15:20:36,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:20:36,878 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-23 15:20:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:37,376 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 15:20:37,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 15:20:37,376 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-23 15:20:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:37,377 INFO L225 Difference]: With dead ends: 97 [2018-07-23 15:20:37,377 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 15:20:37,377 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:20:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 15:20:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 15:20:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 15:20:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 15:20:37,400 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-23 15:20:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:37,400 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 15:20:37,400 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 15:20:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 15:20:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 15:20:37,401 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:37,401 INFO L353 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-23 15:20:37,401 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2018-07-23 15:20:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:37,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:37,701 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 15:20:37,701 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 15:20:37,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 15:20:37,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:20:37,702 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-23 15:20:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:38,271 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 15:20:38,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 15:20:38,271 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-23 15:20:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:38,272 INFO L225 Difference]: With dead ends: 99 [2018-07-23 15:20:38,272 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 15:20:38,273 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:20:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 15:20:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 15:20:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 15:20:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 15:20:38,299 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-23 15:20:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:38,299 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 15:20:38,299 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 15:20:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 15:20:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 15:20:38,300 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:38,300 INFO L353 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-23 15:20:38,301 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2018-07-23 15:20:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:38,648 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:38,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 15:20:38,648 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 15:20:38,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 15:20:38,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:20:38,649 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-23 15:20:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:39,096 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 15:20:39,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 15:20:39,096 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-23 15:20:39,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:39,097 INFO L225 Difference]: With dead ends: 101 [2018-07-23 15:20:39,097 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 15:20:39,097 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:20:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 15:20:39,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 15:20:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 15:20:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 15:20:39,119 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-23 15:20:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:39,119 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 15:20:39,120 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 15:20:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 15:20:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 15:20:39,120 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:39,121 INFO L353 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-23 15:20:39,121 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2018-07-23 15:20:39,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:39,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:39,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 15:20:39,434 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 15:20:39,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 15:20:39,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:20:39,435 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-23 15:20:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:39,978 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 15:20:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 15:20:39,979 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-23 15:20:39,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:39,979 INFO L225 Difference]: With dead ends: 103 [2018-07-23 15:20:39,979 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 15:20:39,980 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:20:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 15:20:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 15:20:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 15:20:40,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 15:20:40,003 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-23 15:20:40,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:40,003 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 15:20:40,003 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 15:20:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 15:20:40,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 15:20:40,004 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:40,004 INFO L353 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-23 15:20:40,004 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:40,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2018-07-23 15:20:40,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:40,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:40,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 15:20:40,342 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 15:20:40,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 15:20:40,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:20:40,343 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-23 15:20:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:40,960 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 15:20:40,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 15:20:40,960 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-23 15:20:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:40,961 INFO L225 Difference]: With dead ends: 105 [2018-07-23 15:20:40,961 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 15:20:40,961 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:20:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 15:20:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 15:20:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 15:20:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 15:20:40,983 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-23 15:20:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 15:20:40,983 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 15:20:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 15:20:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 15:20:40,984 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:40,984 INFO L353 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-23 15:20:40,984 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:40,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2018-07-23 15:20:40,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:41,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:41,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 15:20:41,334 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 15:20:41,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 15:20:41,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:20:41,334 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-23 15:20:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:41,830 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 15:20:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 15:20:41,830 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-23 15:20:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:41,830 INFO L225 Difference]: With dead ends: 107 [2018-07-23 15:20:41,831 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 15:20:41,831 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:20:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 15:20:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 15:20:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 15:20:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 15:20:41,853 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-23 15:20:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:41,853 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 15:20:41,853 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 15:20:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 15:20:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 15:20:41,854 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:41,854 INFO L353 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-23 15:20:41,854 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2018-07-23 15:20:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:42,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:42,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 15:20:42,159 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 15:20:42,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 15:20:42,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:20:42,160 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-23 15:20:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:42,595 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-23 15:20:42,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 15:20:42,596 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-23 15:20:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:42,598 INFO L225 Difference]: With dead ends: 109 [2018-07-23 15:20:42,598 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 15:20:42,599 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:20:42,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 15:20:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-23 15:20:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-23 15:20:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-23 15:20:42,626 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-23 15:20:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:42,626 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-23 15:20:42,626 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 15:20:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-23 15:20:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 15:20:42,627 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:42,627 INFO L353 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-23 15:20:42,627 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:42,628 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2018-07-23 15:20:42,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:42,868 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:42,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 15:20:42,868 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 15:20:42,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 15:20:42,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:20:42,869 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-23 15:20:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:43,305 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 15:20:43,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:20:43,306 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-23 15:20:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:43,306 INFO L225 Difference]: With dead ends: 111 [2018-07-23 15:20:43,307 INFO L226 Difference]: Without dead ends: 109 [2018-07-23 15:20:43,307 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:20:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-23 15:20:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-23 15:20:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 15:20:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-23 15:20:43,335 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-23 15:20:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:43,336 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-23 15:20:43,336 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 15:20:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-23 15:20:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 15:20:43,336 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:43,337 INFO L353 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-23 15:20:43,337 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2018-07-23 15:20:43,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:43,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:43,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 15:20:43,619 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 15:20:43,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 15:20:43,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:20:43,620 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-23 15:20:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:44,068 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-23 15:20:44,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 15:20:44,068 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-23 15:20:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:44,069 INFO L225 Difference]: With dead ends: 113 [2018-07-23 15:20:44,069 INFO L226 Difference]: Without dead ends: 111 [2018-07-23 15:20:44,070 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:20:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-23 15:20:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-23 15:20:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-23 15:20:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-23 15:20:44,099 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-23 15:20:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:44,100 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-23 15:20:44,100 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 15:20:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-23 15:20:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-23 15:20:44,100 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:44,101 INFO L353 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-23 15:20:44,101 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2018-07-23 15:20:44,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:44,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:44,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 15:20:44,446 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 15:20:44,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 15:20:44,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:20:44,447 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-23 15:20:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:44,922 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-23 15:20:44,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 15:20:44,922 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-23 15:20:44,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:44,923 INFO L225 Difference]: With dead ends: 115 [2018-07-23 15:20:44,923 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 15:20:44,923 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:20:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 15:20:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-23 15:20:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 15:20:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 15:20:44,944 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-23 15:20:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:44,944 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 15:20:44,944 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 15:20:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 15:20:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 15:20:44,944 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:44,945 INFO L353 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-23 15:20:44,945 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:44,945 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2018-07-23 15:20:44,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:45,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:45,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 15:20:45,214 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 15:20:45,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 15:20:45,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:20:45,215 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-23 15:20:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:45,696 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-23 15:20:45,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 15:20:45,697 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-23 15:20:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:45,698 INFO L225 Difference]: With dead ends: 117 [2018-07-23 15:20:45,698 INFO L226 Difference]: Without dead ends: 115 [2018-07-23 15:20:45,698 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:20:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-23 15:20:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-23 15:20:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-23 15:20:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-23 15:20:45,720 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-23 15:20:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:45,720 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-23 15:20:45,720 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 15:20:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-23 15:20:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-23 15:20:45,720 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:45,721 INFO L353 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-23 15:20:45,721 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2018-07-23 15:20:45,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:46,067 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:46,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 15:20:46,067 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 15:20:46,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 15:20:46,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:20:46,068 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-23 15:20:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:46,545 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-23 15:20:46,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 15:20:46,545 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-23 15:20:46,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:46,546 INFO L225 Difference]: With dead ends: 119 [2018-07-23 15:20:46,546 INFO L226 Difference]: Without dead ends: 117 [2018-07-23 15:20:46,546 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:20:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-23 15:20:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-23 15:20:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 15:20:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-23 15:20:46,567 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-23 15:20:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:46,568 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-23 15:20:46,568 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 15:20:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-23 15:20:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 15:20:46,568 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:46,569 INFO L353 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-23 15:20:46,569 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2018-07-23 15:20:46,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:46,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:46,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:46,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 15:20:46,852 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 15:20:46,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 15:20:46,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:20:46,853 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-23 15:20:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:47,327 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-23 15:20:47,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 15:20:47,328 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-23 15:20:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:47,329 INFO L225 Difference]: With dead ends: 121 [2018-07-23 15:20:47,329 INFO L226 Difference]: Without dead ends: 119 [2018-07-23 15:20:47,329 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:20:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-23 15:20:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-23 15:20:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 15:20:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-23 15:20:47,351 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-23 15:20:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:47,352 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-23 15:20:47,352 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 15:20:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-23 15:20:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 15:20:47,352 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:47,352 INFO L353 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-23 15:20:47,353 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2018-07-23 15:20:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:47,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:47,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 15:20:47,628 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 15:20:47,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 15:20:47,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:20:47,629 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-23 15:20:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:48,223 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 15:20:48,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 15:20:48,223 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-23 15:20:48,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:48,224 INFO L225 Difference]: With dead ends: 123 [2018-07-23 15:20:48,224 INFO L226 Difference]: Without dead ends: 121 [2018-07-23 15:20:48,224 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:20:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-23 15:20:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-23 15:20:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 15:20:48,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-23 15:20:48,250 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-23 15:20:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:48,251 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-23 15:20:48,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 15:20:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-23 15:20:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 15:20:48,251 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:48,251 INFO L353 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-23 15:20:48,251 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2018-07-23 15:20:48,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:48,603 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:48,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 15:20:48,603 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 15:20:48,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 15:20:48,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:20:48,604 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-23 15:20:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:49,190 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-23 15:20:49,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 15:20:49,191 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-23 15:20:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:49,192 INFO L225 Difference]: With dead ends: 125 [2018-07-23 15:20:49,192 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 15:20:49,192 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:20:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 15:20:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-23 15:20:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-23 15:20:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-23 15:20:49,216 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-23 15:20:49,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:49,216 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-23 15:20:49,216 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 15:20:49,216 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-23 15:20:49,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-23 15:20:49,217 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:49,217 INFO L353 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-23 15:20:49,217 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:49,217 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2018-07-23 15:20:49,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:49,529 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:49,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 15:20:49,529 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 15:20:49,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 15:20:49,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:20:49,530 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-23 15:20:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:50,068 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-23 15:20:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 15:20:50,068 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-23 15:20:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:50,069 INFO L225 Difference]: With dead ends: 127 [2018-07-23 15:20:50,069 INFO L226 Difference]: Without dead ends: 125 [2018-07-23 15:20:50,069 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:20:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-23 15:20:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-23 15:20:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 15:20:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 15:20:50,094 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-23 15:20:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:50,094 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 15:20:50,094 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 15:20:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 15:20:50,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 15:20:50,095 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:50,095 INFO L353 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-23 15:20:50,095 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:50,095 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2018-07-23 15:20:50,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:50,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:50,412 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:50,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 15:20:50,412 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 15:20:50,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 15:20:50,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:20:50,413 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-23 15:20:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:51,130 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-23 15:20:51,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 15:20:51,130 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-23 15:20:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:51,131 INFO L225 Difference]: With dead ends: 129 [2018-07-23 15:20:51,131 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 15:20:51,131 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:20:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 15:20:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-23 15:20:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 15:20:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-23 15:20:51,170 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-23 15:20:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:51,170 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-23 15:20:51,170 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 15:20:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-23 15:20:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 15:20:51,171 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:51,171 INFO L353 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-23 15:20:51,171 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2018-07-23 15:20:51,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:51,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:51,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 15:20:51,568 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 15:20:51,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 15:20:51,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:20:51,568 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-23 15:20:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:52,201 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-23 15:20:52,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 15:20:52,201 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-23 15:20:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:52,202 INFO L225 Difference]: With dead ends: 131 [2018-07-23 15:20:52,202 INFO L226 Difference]: Without dead ends: 129 [2018-07-23 15:20:52,203 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:20:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-23 15:20:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-23 15:20:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 15:20:52,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-23 15:20:52,243 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-23 15:20:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:52,243 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-23 15:20:52,243 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 15:20:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-23 15:20:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 15:20:52,244 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:52,244 INFO L353 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-23 15:20:52,244 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2018-07-23 15:20:52,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:52,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:52,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 15:20:52,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 15:20:52,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 15:20:52,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:20:52,631 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-23 15:20:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:53,291 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-23 15:20:53,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 15:20:53,291 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-23 15:20:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:53,292 INFO L225 Difference]: With dead ends: 133 [2018-07-23 15:20:53,292 INFO L226 Difference]: Without dead ends: 131 [2018-07-23 15:20:53,292 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:20:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-23 15:20:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-23 15:20:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-23 15:20:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-23 15:20:53,333 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-23 15:20:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:53,333 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-23 15:20:53,333 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 15:20:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-23 15:20:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 15:20:53,334 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:53,334 INFO L353 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-23 15:20:53,334 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:53,335 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2018-07-23 15:20:53,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:53,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:53,772 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 15:20:53,772 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 15:20:53,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 15:20:53,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:20:53,773 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-23 15:20:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:54,382 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 15:20:54,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 15:20:54,382 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-23 15:20:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:54,383 INFO L225 Difference]: With dead ends: 135 [2018-07-23 15:20:54,383 INFO L226 Difference]: Without dead ends: 133 [2018-07-23 15:20:54,384 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:20:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-23 15:20:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-23 15:20:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 15:20:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-23 15:20:54,412 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-23 15:20:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:54,412 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-23 15:20:54,413 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 15:20:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-23 15:20:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 15:20:54,413 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:54,413 INFO L353 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-23 15:20:54,414 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:54,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2018-07-23 15:20:54,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:54,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:54,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 15:20:54,788 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 15:20:54,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 15:20:54,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:20:54,788 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-23 15:20:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:55,450 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-23 15:20:55,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 15:20:55,451 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-23 15:20:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:55,452 INFO L225 Difference]: With dead ends: 137 [2018-07-23 15:20:55,452 INFO L226 Difference]: Without dead ends: 135 [2018-07-23 15:20:55,452 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:20:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-23 15:20:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-23 15:20:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-23 15:20:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-23 15:20:55,484 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-23 15:20:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:55,484 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-23 15:20:55,484 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 15:20:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-23 15:20:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-23 15:20:55,485 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:55,485 INFO L353 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-23 15:20:55,485 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:55,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2018-07-23 15:20:55,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:55,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:55,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 15:20:55,905 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 15:20:55,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 15:20:55,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:20:55,906 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-23 15:20:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:56,720 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-23 15:20:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 15:20:56,720 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-23 15:20:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:56,721 INFO L225 Difference]: With dead ends: 139 [2018-07-23 15:20:56,721 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 15:20:56,722 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:20:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 15:20:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-23 15:20:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:20:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 15:20:56,759 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-23 15:20:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:56,759 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 15:20:56,759 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 15:20:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 15:20:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 15:20:56,760 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:56,760 INFO L353 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-23 15:20:56,760 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2018-07-23 15:20:56,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:57,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:57,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 15:20:57,164 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 15:20:57,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 15:20:57,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:20:57,165 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-23 15:20:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:57,916 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-23 15:20:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 15:20:57,916 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-23 15:20:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:57,917 INFO L225 Difference]: With dead ends: 141 [2018-07-23 15:20:57,917 INFO L226 Difference]: Without dead ends: 139 [2018-07-23 15:20:57,918 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:20:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-23 15:20:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-23 15:20:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-23 15:20:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-23 15:20:57,962 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-23 15:20:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:57,963 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-23 15:20:57,963 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 15:20:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-23 15:20:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-23 15:20:57,963 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:57,964 INFO L353 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-23 15:20:57,964 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2018-07-23 15:20:57,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:58,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:58,374 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 15:20:58,374 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 15:20:58,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 15:20:58,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:20:58,375 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-23 15:20:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:20:59,145 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-23 15:20:59,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 15:20:59,146 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-23 15:20:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:20:59,146 INFO L225 Difference]: With dead ends: 143 [2018-07-23 15:20:59,146 INFO L226 Difference]: Without dead ends: 141 [2018-07-23 15:20:59,147 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:20:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-23 15:20:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-23 15:20:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 15:20:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-23 15:20:59,179 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-23 15:20:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:20:59,179 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-23 15:20:59,179 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 15:20:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-23 15:20:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 15:20:59,180 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:20:59,180 INFO L353 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-23 15:20:59,180 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:20:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2018-07-23 15:20:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:20:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:20:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:20:59,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:20:59,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 15:20:59,604 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 15:20:59,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 15:20:59,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:20:59,605 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-23 15:21:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:00,334 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-23 15:21:00,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 15:21:00,335 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-23 15:21:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:00,335 INFO L225 Difference]: With dead ends: 145 [2018-07-23 15:21:00,335 INFO L226 Difference]: Without dead ends: 143 [2018-07-23 15:21:00,336 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:21:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-23 15:21:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-23 15:21:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-23 15:21:00,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-23 15:21:00,366 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-23 15:21:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:00,366 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-23 15:21:00,366 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 15:21:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-23 15:21:00,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 15:21:00,366 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:00,367 INFO L353 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-23 15:21:00,367 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:00,367 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2018-07-23 15:21:00,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:00,794 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:00,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 15:21:00,795 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 15:21:00,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 15:21:00,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:21:00,795 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-23 15:21:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:01,585 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 15:21:01,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 15:21:01,585 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-23 15:21:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:01,586 INFO L225 Difference]: With dead ends: 147 [2018-07-23 15:21:01,586 INFO L226 Difference]: Without dead ends: 145 [2018-07-23 15:21:01,587 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:21:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-23 15:21:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-23 15:21:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 15:21:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-23 15:21:01,631 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-23 15:21:01,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:01,631 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-23 15:21:01,631 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 15:21:01,631 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-23 15:21:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 15:21:01,632 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:01,632 INFO L353 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-23 15:21:01,633 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:01,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2018-07-23 15:21:01,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:02,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:02,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 15:21:02,150 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 15:21:02,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 15:21:02,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:21:02,151 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-23 15:21:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:02,994 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-23 15:21:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 15:21:02,994 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-23 15:21:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:02,995 INFO L225 Difference]: With dead ends: 149 [2018-07-23 15:21:02,995 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 15:21:02,996 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:21:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 15:21:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-23 15:21:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-23 15:21:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-23 15:21:03,043 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-23 15:21:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:03,043 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-23 15:21:03,043 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 15:21:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-23 15:21:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-23 15:21:03,044 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:03,044 INFO L353 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-23 15:21:03,045 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2018-07-23 15:21:03,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:03,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:03,491 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 15:21:03,491 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 15:21:03,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 15:21:03,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:21:03,492 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-23 15:21:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:04,337 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-23 15:21:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 15:21:04,338 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-23 15:21:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:04,338 INFO L225 Difference]: With dead ends: 151 [2018-07-23 15:21:04,338 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 15:21:04,339 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:21:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 15:21:04,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-23 15:21:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 15:21:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 15:21:04,375 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-23 15:21:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:04,375 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 15:21:04,375 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 15:21:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 15:21:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 15:21:04,376 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:04,376 INFO L353 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-23 15:21:04,376 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2018-07-23 15:21:04,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:04,842 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:04,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 15:21:04,842 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 15:21:04,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 15:21:04,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:21:04,843 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-23 15:21:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:05,684 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-23 15:21:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 15:21:05,684 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-23 15:21:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:05,685 INFO L225 Difference]: With dead ends: 153 [2018-07-23 15:21:05,685 INFO L226 Difference]: Without dead ends: 151 [2018-07-23 15:21:05,686 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:21:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-23 15:21:05,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-23 15:21:05,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 15:21:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-23 15:21:05,738 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-23 15:21:05,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:05,739 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-23 15:21:05,739 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 15:21:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-23 15:21:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-23 15:21:05,739 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:05,740 INFO L353 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-23 15:21:05,740 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:05,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2018-07-23 15:21:05,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:06,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:06,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 15:21:06,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 15:21:06,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 15:21:06,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:21:06,382 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-23 15:21:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:07,228 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-23 15:21:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 15:21:07,228 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-23 15:21:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:07,229 INFO L225 Difference]: With dead ends: 155 [2018-07-23 15:21:07,229 INFO L226 Difference]: Without dead ends: 153 [2018-07-23 15:21:07,229 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:21:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-23 15:21:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-23 15:21:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 15:21:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-23 15:21:07,281 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-23 15:21:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:07,281 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-23 15:21:07,281 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 15:21:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-23 15:21:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 15:21:07,282 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:07,282 INFO L353 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-23 15:21:07,282 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2018-07-23 15:21:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:07,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:07,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 15:21:07,775 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 15:21:07,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 15:21:07,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:21:07,776 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-23 15:21:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:08,690 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-23 15:21:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 15:21:08,690 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-23 15:21:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:08,691 INFO L225 Difference]: With dead ends: 157 [2018-07-23 15:21:08,691 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 15:21:08,692 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:21:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 15:21:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 15:21:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 15:21:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-23 15:21:08,759 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-23 15:21:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:08,759 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-23 15:21:08,760 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 15:21:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-23 15:21:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 15:21:08,761 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:08,761 INFO L353 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-23 15:21:08,761 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:08,761 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2018-07-23 15:21:08,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:09,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:09,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 15:21:09,361 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 15:21:09,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 15:21:09,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:21:09,361 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-23 15:21:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:10,216 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 15:21:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 15:21:10,216 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-23 15:21:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:10,217 INFO L225 Difference]: With dead ends: 159 [2018-07-23 15:21:10,217 INFO L226 Difference]: Without dead ends: 157 [2018-07-23 15:21:10,217 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:21:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-23 15:21:10,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-23 15:21:10,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 15:21:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-23 15:21:10,273 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-23 15:21:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:10,273 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-23 15:21:10,273 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 15:21:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-23 15:21:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 15:21:10,274 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:10,274 INFO L353 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-23 15:21:10,275 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2018-07-23 15:21:10,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:10,828 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:10,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 15:21:10,829 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 15:21:10,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 15:21:10,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:21:10,829 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-23 15:21:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:11,763 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-23 15:21:11,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 15:21:11,763 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-23 15:21:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:11,764 INFO L225 Difference]: With dead ends: 161 [2018-07-23 15:21:11,764 INFO L226 Difference]: Without dead ends: 159 [2018-07-23 15:21:11,764 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:21:11,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-23 15:21:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-23 15:21:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-23 15:21:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-23 15:21:11,814 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-23 15:21:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:11,814 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-23 15:21:11,814 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 15:21:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-23 15:21:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-23 15:21:11,815 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:11,815 INFO L353 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-23 15:21:11,815 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2018-07-23 15:21:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:12,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:12,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 15:21:12,428 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 15:21:12,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 15:21:12,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:21:12,429 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-23 15:21:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:13,347 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-23 15:21:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 15:21:13,347 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-23 15:21:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:13,348 INFO L225 Difference]: With dead ends: 163 [2018-07-23 15:21:13,348 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 15:21:13,348 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:21:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 15:21:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-23 15:21:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 15:21:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 15:21:13,384 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-23 15:21:13,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:13,384 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 15:21:13,384 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 15:21:13,384 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 15:21:13,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 15:21:13,385 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:13,385 INFO L353 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-23 15:21:13,385 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2018-07-23 15:21:13,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:13,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:13,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 15:21:13,926 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 15:21:13,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 15:21:13,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:21:13,926 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-23 15:21:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:15,162 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-23 15:21:15,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 15:21:15,162 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-23 15:21:15,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:15,163 INFO L225 Difference]: With dead ends: 165 [2018-07-23 15:21:15,163 INFO L226 Difference]: Without dead ends: 163 [2018-07-23 15:21:15,164 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:21:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-23 15:21:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-23 15:21:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 15:21:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-23 15:21:15,222 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-23 15:21:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-23 15:21:15,223 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 15:21:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-23 15:21:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-23 15:21:15,224 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:15,224 INFO L353 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-23 15:21:15,224 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2018-07-23 15:21:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:15,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:15,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:15,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 15:21:15,813 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 15:21:15,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 15:21:15,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:21:15,814 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-23 15:21:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:16,819 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-23 15:21:16,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 15:21:16,819 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-23 15:21:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:16,820 INFO L225 Difference]: With dead ends: 167 [2018-07-23 15:21:16,820 INFO L226 Difference]: Without dead ends: 165 [2018-07-23 15:21:16,821 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:21:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-23 15:21:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-23 15:21:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 15:21:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-23 15:21:16,860 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-23 15:21:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:16,860 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-23 15:21:16,860 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 15:21:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-23 15:21:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 15:21:16,861 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:16,861 INFO L353 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-23 15:21:16,861 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2018-07-23 15:21:16,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:17,419 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:17,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 15:21:17,419 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 15:21:17,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 15:21:17,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:21:17,420 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-23 15:21:18,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:18,445 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-23 15:21:18,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 15:21:18,445 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-23 15:21:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:18,446 INFO L225 Difference]: With dead ends: 169 [2018-07-23 15:21:18,446 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 15:21:18,446 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:21:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 15:21:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-23 15:21:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-23 15:21:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-23 15:21:18,498 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-23 15:21:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:18,499 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-23 15:21:18,499 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 15:21:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-23 15:21:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 15:21:18,500 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:18,500 INFO L353 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-23 15:21:18,500 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:18,500 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2018-07-23 15:21:18,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:19,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:19,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:19,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 15:21:19,093 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 15:21:19,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 15:21:19,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:21:19,094 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-23 15:21:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:20,151 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 15:21:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 15:21:20,151 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-23 15:21:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:20,152 INFO L225 Difference]: With dead ends: 171 [2018-07-23 15:21:20,152 INFO L226 Difference]: Without dead ends: 169 [2018-07-23 15:21:20,153 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:21:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-23 15:21:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-23 15:21:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 15:21:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-23 15:21:20,200 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-23 15:21:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:20,201 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-23 15:21:20,201 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 15:21:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-23 15:21:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 15:21:20,201 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:20,202 INFO L353 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-23 15:21:20,202 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:20,202 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2018-07-23 15:21:20,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:20,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:20,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 15:21:20,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 15:21:20,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 15:21:20,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:21:20,806 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-23 15:21:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:21,892 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-23 15:21:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 15:21:21,892 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-23 15:21:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:21,893 INFO L225 Difference]: With dead ends: 173 [2018-07-23 15:21:21,893 INFO L226 Difference]: Without dead ends: 171 [2018-07-23 15:21:21,893 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:21:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-23 15:21:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-23 15:21:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-23 15:21:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-23 15:21:21,938 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-23 15:21:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:21,938 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-23 15:21:21,938 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 15:21:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-23 15:21:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-23 15:21:21,939 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:21,939 INFO L353 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-23 15:21:21,939 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2018-07-23 15:21:21,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:22,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:22,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 15:21:22,555 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 15:21:22,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 15:21:22,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:21:22,556 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-23 15:21:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:23,749 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-23 15:21:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 15:21:23,749 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-23 15:21:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:23,750 INFO L225 Difference]: With dead ends: 175 [2018-07-23 15:21:23,750 INFO L226 Difference]: Without dead ends: 173 [2018-07-23 15:21:23,751 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:21:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-23 15:21:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-23 15:21:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 15:21:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 15:21:23,805 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-23 15:21:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:23,806 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 15:21:23,806 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 15:21:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 15:21:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 15:21:23,806 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:23,807 INFO L353 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-23 15:21:23,807 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:23,807 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2018-07-23 15:21:23,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:24,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:24,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 15:21:24,435 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 15:21:24,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 15:21:24,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:21:24,435 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-23 15:21:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:25,557 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-23 15:21:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 15:21:25,557 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-23 15:21:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:25,558 INFO L225 Difference]: With dead ends: 177 [2018-07-23 15:21:25,558 INFO L226 Difference]: Without dead ends: 175 [2018-07-23 15:21:25,558 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:21:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-23 15:21:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-23 15:21:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-23 15:21:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-23 15:21:25,610 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-23 15:21:25,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:25,610 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-23 15:21:25,610 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 15:21:25,610 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-23 15:21:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-23 15:21:25,611 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:25,611 INFO L353 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-23 15:21:25,612 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2018-07-23 15:21:25,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:26,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:26,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 15:21:26,265 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 15:21:26,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 15:21:26,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:21:26,266 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-23 15:21:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:27,402 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-23 15:21:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 15:21:27,402 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-23 15:21:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:27,403 INFO L225 Difference]: With dead ends: 179 [2018-07-23 15:21:27,403 INFO L226 Difference]: Without dead ends: 177 [2018-07-23 15:21:27,404 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:21:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-23 15:21:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-23 15:21:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 15:21:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-23 15:21:27,448 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-23 15:21:27,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:27,448 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-23 15:21:27,448 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 15:21:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-23 15:21:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 15:21:27,449 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:27,449 INFO L353 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-23 15:21:27,449 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2018-07-23 15:21:27,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:28,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:28,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 15:21:28,149 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 15:21:28,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 15:21:28,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:21:28,150 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-23 15:21:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:29,239 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-23 15:21:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 15:21:29,239 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-23 15:21:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:29,240 INFO L225 Difference]: With dead ends: 181 [2018-07-23 15:21:29,240 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 15:21:29,240 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:21:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 15:21:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-23 15:21:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 15:21:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-23 15:21:29,286 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-23 15:21:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:29,286 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-23 15:21:29,286 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 15:21:29,286 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-23 15:21:29,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 15:21:29,287 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:29,287 INFO L353 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-23 15:21:29,287 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:29,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2018-07-23 15:21:29,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:29,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:29,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 15:21:29,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 15:21:29,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 15:21:29,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:21:29,976 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-23 15:21:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:31,240 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 15:21:31,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 15:21:31,241 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-23 15:21:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:31,241 INFO L225 Difference]: With dead ends: 183 [2018-07-23 15:21:31,242 INFO L226 Difference]: Without dead ends: 181 [2018-07-23 15:21:31,242 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:21:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-23 15:21:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-23 15:21:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 15:21:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-23 15:21:31,302 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-23 15:21:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:31,303 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-23 15:21:31,303 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 15:21:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-23 15:21:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 15:21:31,304 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:31,304 INFO L353 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-23 15:21:31,304 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2018-07-23 15:21:31,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:31,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:31,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 15:21:31,996 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 15:21:31,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 15:21:31,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:21:31,997 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-23 15:21:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:33,202 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-23 15:21:33,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 15:21:33,202 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-23 15:21:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:33,203 INFO L225 Difference]: With dead ends: 185 [2018-07-23 15:21:33,203 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 15:21:33,203 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:21:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 15:21:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-23 15:21:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 15:21:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-23 15:21:33,251 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-23 15:21:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:33,251 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-23 15:21:33,251 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 15:21:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-23 15:21:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-23 15:21:33,252 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:33,252 INFO L353 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-23 15:21:33,252 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:33,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2018-07-23 15:21:33,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:33,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:33,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 15:21:33,979 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 15:21:33,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 15:21:33,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:21:33,980 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-23 15:21:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:35,205 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-23 15:21:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 15:21:35,205 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-23 15:21:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:35,206 INFO L225 Difference]: With dead ends: 187 [2018-07-23 15:21:35,206 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 15:21:35,206 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:21:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 15:21:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 15:21:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:21:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 15:21:35,255 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-23 15:21:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:35,255 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 15:21:35,255 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 15:21:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 15:21:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 15:21:35,256 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:35,256 INFO L353 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-23 15:21:35,256 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:35,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2018-07-23 15:21:35,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:35,980 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:35,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 15:21:35,981 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 15:21:35,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 15:21:35,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:21:35,981 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-23 15:21:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:37,244 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-23 15:21:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 15:21:37,244 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-23 15:21:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:37,245 INFO L225 Difference]: With dead ends: 189 [2018-07-23 15:21:37,245 INFO L226 Difference]: Without dead ends: 187 [2018-07-23 15:21:37,246 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:21:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-23 15:21:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-23 15:21:37,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-23 15:21:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-23 15:21:37,301 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-23 15:21:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:37,302 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-23 15:21:37,302 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 15:21:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-23 15:21:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-23 15:21:37,302 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:37,303 INFO L353 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-23 15:21:37,303 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2018-07-23 15:21:37,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:38,089 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:38,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 15:21:38,089 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 15:21:38,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 15:21:38,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:21:38,089 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-23 15:21:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:39,387 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-23 15:21:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 15:21:39,388 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-23 15:21:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:39,388 INFO L225 Difference]: With dead ends: 191 [2018-07-23 15:21:39,388 INFO L226 Difference]: Without dead ends: 189 [2018-07-23 15:21:39,389 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:21:39,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-23 15:21:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-23 15:21:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 15:21:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-23 15:21:39,440 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-23 15:21:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:39,440 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-23 15:21:39,440 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 15:21:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-23 15:21:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 15:21:39,440 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:39,441 INFO L353 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-23 15:21:39,441 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2018-07-23 15:21:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:40,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:40,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 15:21:40,227 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 15:21:40,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 15:21:40,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:21:40,228 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-23 15:21:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:41,465 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-23 15:21:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 15:21:41,466 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-23 15:21:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:41,467 INFO L225 Difference]: With dead ends: 193 [2018-07-23 15:21:41,467 INFO L226 Difference]: Without dead ends: 191 [2018-07-23 15:21:41,467 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:21:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-23 15:21:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-23 15:21:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-23 15:21:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-23 15:21:41,519 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-23 15:21:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:41,519 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-23 15:21:41,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 15:21:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-23 15:21:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 15:21:41,520 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:41,521 INFO L353 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-23 15:21:41,521 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:41,521 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2018-07-23 15:21:41,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:42,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:42,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 15:21:42,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 15:21:42,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 15:21:42,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:21:42,352 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-23 15:21:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:43,649 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-23 15:21:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 15:21:43,649 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-23 15:21:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:43,650 INFO L225 Difference]: With dead ends: 195 [2018-07-23 15:21:43,650 INFO L226 Difference]: Without dead ends: 193 [2018-07-23 15:21:43,650 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:21:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-23 15:21:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-23 15:21:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 15:21:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-23 15:21:43,732 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-23 15:21:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:43,733 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-23 15:21:43,733 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 15:21:43,733 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-23 15:21:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 15:21:43,734 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:43,734 INFO L353 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-23 15:21:43,734 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:43,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2018-07-23 15:21:43,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:44,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:44,579 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:44,579 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 15:21:44,579 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 15:21:44,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 15:21:44,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:21:44,580 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-23 15:21:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:46,008 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-23 15:21:46,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 15:21:46,009 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-23 15:21:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:46,010 INFO L225 Difference]: With dead ends: 197 [2018-07-23 15:21:46,010 INFO L226 Difference]: Without dead ends: 195 [2018-07-23 15:21:46,011 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:21:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-23 15:21:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-23 15:21:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-23 15:21:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-23 15:21:46,084 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-23 15:21:46,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:46,084 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-23 15:21:46,084 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 15:21:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-23 15:21:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-23 15:21:46,085 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:46,085 INFO L353 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-23 15:21:46,085 INFO L414 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2018-07-23 15:21:46,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:46,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:46,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 15:21:46,942 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 15:21:46,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 15:21:46,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:21:46,943 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-23 15:21:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:48,364 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-23 15:21:48,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 15:21:48,364 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-23 15:21:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:48,365 INFO L225 Difference]: With dead ends: 199 [2018-07-23 15:21:48,365 INFO L226 Difference]: Without dead ends: 197 [2018-07-23 15:21:48,366 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:21:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-23 15:21:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-23 15:21:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 15:21:48,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-23 15:21:48,425 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-23 15:21:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:48,425 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-23 15:21:48,425 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 15:21:48,425 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-23 15:21:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 15:21:48,425 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:48,426 INFO L353 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-23 15:21:48,426 INFO L414 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2018-07-23 15:21:48,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:49,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:49,372 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 15:21:49,372 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 15:21:49,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 15:21:49,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:21:49,373 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-23 15:21:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:50,827 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-23 15:21:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 15:21:50,827 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-23 15:21:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:50,828 INFO L225 Difference]: With dead ends: 201 [2018-07-23 15:21:50,828 INFO L226 Difference]: Without dead ends: 199 [2018-07-23 15:21:50,828 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:21:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-23 15:21:50,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-23 15:21:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-23 15:21:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-23 15:21:50,898 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-23 15:21:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-23 15:21:50,898 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 15:21:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-23 15:21:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-23 15:21:50,899 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:50,899 INFO L353 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-23 15:21:50,900 INFO L414 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2018-07-23 15:21:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:51,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:51,772 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 15:21:51,772 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 15:21:51,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 15:21:51,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:21:51,773 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-23 15:21:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:53,278 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-23 15:21:53,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 15:21:53,278 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-23 15:21:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:53,279 INFO L225 Difference]: With dead ends: 203 [2018-07-23 15:21:53,279 INFO L226 Difference]: Without dead ends: 201 [2018-07-23 15:21:53,280 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:21:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-23 15:21:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-23 15:21:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 15:21:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-23 15:21:53,337 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-23 15:21:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-23 15:21:53,337 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 15:21:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-23 15:21:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 15:21:53,337 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:53,338 INFO L353 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-23 15:21:53,338 INFO L414 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2018-07-23 15:21:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:54,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:54,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 15:21:54,224 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 15:21:54,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 15:21:54,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:21:54,224 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-23 15:21:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:55,764 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-23 15:21:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 15:21:55,765 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-23 15:21:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:55,766 INFO L225 Difference]: With dead ends: 205 [2018-07-23 15:21:55,766 INFO L226 Difference]: Without dead ends: 203 [2018-07-23 15:21:55,767 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:21:55,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-23 15:21:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-23 15:21:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 15:21:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-23 15:21:55,848 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-23 15:21:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-23 15:21:55,849 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 15:21:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-23 15:21:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-23 15:21:55,850 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:55,850 INFO L353 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-23 15:21:55,850 INFO L414 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2018-07-23 15:21:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:56,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:56,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 15:21:56,755 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 15:21:56,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 15:21:56,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:21:56,755 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-23 15:21:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:21:58,302 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-23 15:21:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 15:21:58,302 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-23 15:21:58,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:21:58,303 INFO L225 Difference]: With dead ends: 207 [2018-07-23 15:21:58,303 INFO L226 Difference]: Without dead ends: 205 [2018-07-23 15:21:58,303 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:21:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-23 15:21:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-23 15:21:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-23 15:21:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-23 15:21:58,368 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-23 15:21:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:21:58,368 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-23 15:21:58,368 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 15:21:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-23 15:21:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 15:21:58,369 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:21:58,369 INFO L353 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-23 15:21:58,369 INFO L414 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:21:58,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2018-07-23 15:21:58,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:21:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:21:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:21:59,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:21:59,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 15:21:59,515 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 15:21:59,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 15:21:59,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:21:59,516 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-23 15:22:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:01,007 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-23 15:22:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 15:22:01,007 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-23 15:22:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:01,008 INFO L225 Difference]: With dead ends: 209 [2018-07-23 15:22:01,008 INFO L226 Difference]: Without dead ends: 207 [2018-07-23 15:22:01,009 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:22:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-23 15:22:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-23 15:22:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-23 15:22:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-23 15:22:01,094 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-23 15:22:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:01,095 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-23 15:22:01,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 15:22:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-23 15:22:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-23 15:22:01,095 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:01,095 INFO L353 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-23 15:22:01,096 INFO L414 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash -838117007, now seen corresponding path program 101 times [2018-07-23 15:22:01,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:02,134 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:02,134 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 15:22:02,135 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 15:22:02,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 15:22:02,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:22:02,136 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-23 15:22:03,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:03,763 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-23 15:22:03,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 15:22:03,763 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-23 15:22:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:03,764 INFO L225 Difference]: With dead ends: 211 [2018-07-23 15:22:03,764 INFO L226 Difference]: Without dead ends: 209 [2018-07-23 15:22:03,765 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:22:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-23 15:22:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-23 15:22:03,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-23 15:22:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-23 15:22:03,828 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-23 15:22:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:03,828 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-23 15:22:03,828 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 15:22:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-23 15:22:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 15:22:03,829 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:03,829 INFO L353 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-23 15:22:03,829 INFO L414 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:03,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2023340909, now seen corresponding path program 102 times [2018-07-23 15:22:03,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:04,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:04,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 15:22:04,851 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 15:22:04,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 15:22:04,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:22:04,852 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-23 15:22:06,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:06,453 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-23 15:22:06,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 15:22:06,453 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-23 15:22:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:06,453 INFO L225 Difference]: With dead ends: 213 [2018-07-23 15:22:06,453 INFO L226 Difference]: Without dead ends: 211 [2018-07-23 15:22:06,454 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:22:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-23 15:22:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-23 15:22:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-23 15:22:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-23 15:22:06,516 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-23 15:22:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:06,517 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-23 15:22:06,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 15:22:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-23 15:22:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-23 15:22:06,518 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:06,518 INFO L353 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-23 15:22:06,518 INFO L414 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1189638551, now seen corresponding path program 103 times [2018-07-23 15:22:06,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:07,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:07,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 15:22:07,504 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 15:22:07,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 15:22:07,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 15:22:07,505 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-23 15:22:09,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:09,087 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-23 15:22:09,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 15:22:09,087 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-23 15:22:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:09,087 INFO L225 Difference]: With dead ends: 215 [2018-07-23 15:22:09,087 INFO L226 Difference]: Without dead ends: 213 [2018-07-23 15:22:09,088 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 15:22:09,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-23 15:22:09,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-23 15:22:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-23 15:22:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-23 15:22:09,168 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-23 15:22:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:09,169 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-23 15:22:09,169 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 15:22:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-23 15:22:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-23 15:22:09,170 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:09,170 INFO L353 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-23 15:22:09,170 INFO L414 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash -781413787, now seen corresponding path program 104 times [2018-07-23 15:22:09,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:10,241 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:10,241 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 15:22:10,241 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 15:22:10,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 15:22:10,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 15:22:10,242 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-23 15:22:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:11,978 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-23 15:22:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 15:22:11,978 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-23 15:22:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:11,978 INFO L225 Difference]: With dead ends: 217 [2018-07-23 15:22:11,978 INFO L226 Difference]: Without dead ends: 215 [2018-07-23 15:22:11,979 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 15:22:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-23 15:22:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-23 15:22:12,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-23 15:22:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-23 15:22:12,043 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-23 15:22:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:12,044 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-23 15:22:12,044 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 15:22:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-23 15:22:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-23 15:22:12,044 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:12,044 INFO L353 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-23 15:22:12,045 INFO L414 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash 680560481, now seen corresponding path program 105 times [2018-07-23 15:22:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:13,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:13,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 15:22:13,075 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 15:22:13,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 15:22:13,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 15:22:13,076 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-23 15:22:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:14,825 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-23 15:22:14,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 15:22:14,825 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-23 15:22:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:14,826 INFO L225 Difference]: With dead ends: 219 [2018-07-23 15:22:14,826 INFO L226 Difference]: Without dead ends: 217 [2018-07-23 15:22:14,826 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 15:22:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-23 15:22:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-23 15:22:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-23 15:22:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-23 15:22:14,894 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-23 15:22:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:14,894 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-23 15:22:14,895 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 15:22:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-23 15:22:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-23 15:22:14,895 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:14,895 INFO L353 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-23 15:22:14,895 INFO L414 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1183526237, now seen corresponding path program 106 times [2018-07-23 15:22:14,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:16,022 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:16,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 15:22:16,023 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 15:22:16,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 15:22:16,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 15:22:16,024 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-23 15:22:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:17,775 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-23 15:22:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 15:22:17,775 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-23 15:22:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:17,776 INFO L225 Difference]: With dead ends: 221 [2018-07-23 15:22:17,776 INFO L226 Difference]: Without dead ends: 219 [2018-07-23 15:22:17,777 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 15:22:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-23 15:22:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-23 15:22:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-23 15:22:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-23 15:22:17,846 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-23 15:22:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-23 15:22:17,846 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 15:22:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-23 15:22:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-23 15:22:17,846 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:17,847 INFO L353 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-23 15:22:17,847 INFO L414 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash -797686695, now seen corresponding path program 107 times [2018-07-23 15:22:17,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:18,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:18,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 15:22:18,923 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 15:22:18,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 15:22:18,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 15:22:18,924 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-23 15:22:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:20,787 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-23 15:22:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 15:22:20,787 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-23 15:22:20,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:20,788 INFO L225 Difference]: With dead ends: 223 [2018-07-23 15:22:20,788 INFO L226 Difference]: Without dead ends: 221 [2018-07-23 15:22:20,788 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 15:22:20,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-23 15:22:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-23 15:22:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 15:22:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-23 15:22:20,897 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-23 15:22:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:20,897 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-23 15:22:20,897 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 15:22:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-23 15:22:20,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 15:22:20,898 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:20,898 INFO L353 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-23 15:22:20,899 INFO L414 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2072802219, now seen corresponding path program 108 times [2018-07-23 15:22:20,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:22,190 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:22,190 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 15:22:22,190 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 15:22:22,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 15:22:22,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 15:22:22,191 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-23 15:22:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:24,217 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-23 15:22:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 15:22:24,217 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-23 15:22:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:24,218 INFO L225 Difference]: With dead ends: 225 [2018-07-23 15:22:24,218 INFO L226 Difference]: Without dead ends: 223 [2018-07-23 15:22:24,219 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 15:22:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-23 15:22:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-23 15:22:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-23 15:22:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-23 15:22:24,310 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-23 15:22:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:24,310 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-23 15:22:24,310 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 15:22:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-23 15:22:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-23 15:22:24,311 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:24,311 INFO L353 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-23 15:22:24,311 INFO L414 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:24,312 INFO L82 PathProgramCache]: Analyzing trace with hash 901825873, now seen corresponding path program 109 times [2018-07-23 15:22:24,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:25,549 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:25,549 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 15:22:25,550 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 15:22:25,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 15:22:25,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 15:22:25,551 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-23 15:22:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:27,537 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-23 15:22:27,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 15:22:27,538 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-23 15:22:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:27,538 INFO L225 Difference]: With dead ends: 227 [2018-07-23 15:22:27,538 INFO L226 Difference]: Without dead ends: 225 [2018-07-23 15:22:27,539 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 15:22:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-23 15:22:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-23 15:22:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 15:22:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-23 15:22:27,620 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-23 15:22:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:27,620 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-23 15:22:27,620 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 15:22:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-23 15:22:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-23 15:22:27,621 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:27,621 INFO L353 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-23 15:22:27,621 INFO L414 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:27,622 INFO L82 PathProgramCache]: Analyzing trace with hash -928796851, now seen corresponding path program 110 times [2018-07-23 15:22:27,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:28,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:28,867 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 15:22:28,867 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 15:22:28,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 15:22:28,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 15:22:28,868 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-23 15:22:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:30,849 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-23 15:22:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 15:22:30,849 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-23 15:22:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:30,850 INFO L225 Difference]: With dead ends: 229 [2018-07-23 15:22:30,850 INFO L226 Difference]: Without dead ends: 227 [2018-07-23 15:22:30,851 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 15:22:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-23 15:22:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-23 15:22:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-23 15:22:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-23 15:22:30,932 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-23 15:22:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:30,933 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-23 15:22:30,933 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 15:22:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-23 15:22:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-23 15:22:30,933 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:30,933 INFO L353 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-23 15:22:30,934 INFO L414 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash 779356745, now seen corresponding path program 111 times [2018-07-23 15:22:30,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:32,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:32,222 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 15:22:32,222 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 15:22:32,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 15:22:32,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 15:22:32,223 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-23 15:22:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:34,067 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-23 15:22:34,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 15:22:34,067 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-23 15:22:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:34,068 INFO L225 Difference]: With dead ends: 231 [2018-07-23 15:22:34,068 INFO L226 Difference]: Without dead ends: 229 [2018-07-23 15:22:34,069 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 15:22:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-23 15:22:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-23 15:22:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-23 15:22:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-23 15:22:34,140 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-23 15:22:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:34,140 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-23 15:22:34,141 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 15:22:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-23 15:22:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-23 15:22:34,141 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:34,141 INFO L353 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-23 15:22:34,141 INFO L414 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1637455429, now seen corresponding path program 112 times [2018-07-23 15:22:34,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:35,377 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:35,377 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 15:22:35,377 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 15:22:35,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 15:22:35,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 15:22:35,378 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-23 15:22:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:37,279 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-23 15:22:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 15:22:37,280 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-23 15:22:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:37,280 INFO L225 Difference]: With dead ends: 233 [2018-07-23 15:22:37,280 INFO L226 Difference]: Without dead ends: 231 [2018-07-23 15:22:37,281 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 15:22:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-23 15:22:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-23 15:22:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-23 15:22:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-23 15:22:37,370 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-23 15:22:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:37,370 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-23 15:22:37,370 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 15:22:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-23 15:22:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-23 15:22:37,371 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:37,371 INFO L353 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-23 15:22:37,371 INFO L414 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1636569921, now seen corresponding path program 113 times [2018-07-23 15:22:37,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:38,603 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:38,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 15:22:38,603 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 15:22:38,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 15:22:38,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 15:22:38,604 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-23 15:22:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:40,619 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-23 15:22:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 15:22:40,619 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-23 15:22:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:40,620 INFO L225 Difference]: With dead ends: 235 [2018-07-23 15:22:40,620 INFO L226 Difference]: Without dead ends: 233 [2018-07-23 15:22:40,621 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 15:22:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-23 15:22:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-23 15:22:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 15:22:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-23 15:22:40,702 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-23 15:22:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:40,702 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-23 15:22:40,702 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 15:22:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-23 15:22:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 15:22:40,703 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:40,703 INFO L353 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-23 15:22:40,703 INFO L414 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:40,703 INFO L82 PathProgramCache]: Analyzing trace with hash 785596733, now seen corresponding path program 114 times [2018-07-23 15:22:40,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:41,964 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:41,965 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 15:22:41,965 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 15:22:41,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 15:22:41,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 15:22:41,966 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-23 15:22:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:44,055 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-23 15:22:44,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 15:22:44,055 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-23 15:22:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:44,056 INFO L225 Difference]: With dead ends: 237 [2018-07-23 15:22:44,056 INFO L226 Difference]: Without dead ends: 235 [2018-07-23 15:22:44,056 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 15:22:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-23 15:22:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-23 15:22:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-23 15:22:44,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-23 15:22:44,131 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-23 15:22:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:44,131 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-23 15:22:44,131 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 15:22:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-23 15:22:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-23 15:22:44,132 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:44,132 INFO L353 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-23 15:22:44,132 INFO L414 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:44,132 INFO L82 PathProgramCache]: Analyzing trace with hash -955850695, now seen corresponding path program 115 times [2018-07-23 15:22:44,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:45,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:45,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:45,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-23 15:22:45,399 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 15:22:45,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 15:22:45,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 15:22:45,400 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-23 15:22:47,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:47,498 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-23 15:22:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 15:22:47,498 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-23 15:22:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:47,499 INFO L225 Difference]: With dead ends: 239 [2018-07-23 15:22:47,499 INFO L226 Difference]: Without dead ends: 237 [2018-07-23 15:22:47,499 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 15:22:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-23 15:22:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-23 15:22:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-23 15:22:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-23 15:22:47,577 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-23 15:22:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:47,577 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-23 15:22:47,577 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 15:22:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-23 15:22:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-23 15:22:47,577 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:47,578 INFO L353 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-23 15:22:47,578 INFO L414 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash 550416437, now seen corresponding path program 116 times [2018-07-23 15:22:47,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:48,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:48,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-23 15:22:48,912 INFO L450 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-23 15:22:48,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-23 15:22:48,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 15:22:48,913 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-23 15:22:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:51,065 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-23 15:22:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-23 15:22:51,065 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-23 15:22:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:51,066 INFO L225 Difference]: With dead ends: 241 [2018-07-23 15:22:51,066 INFO L226 Difference]: Without dead ends: 239 [2018-07-23 15:22:51,066 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 15:22:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-23 15:22:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-23 15:22:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-23 15:22:51,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-23 15:22:51,143 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-23 15:22:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:51,143 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-23 15:22:51,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-23 15:22:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-23 15:22:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-23 15:22:51,144 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:51,144 INFO L353 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-23 15:22:51,144 INFO L414 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash 669151537, now seen corresponding path program 117 times [2018-07-23 15:22:51,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:52,477 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:52,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-23 15:22:52,478 INFO L450 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-23 15:22:52,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-23 15:22:52,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 15:22:52,479 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-23 15:22:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:54,541 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-23 15:22:54,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-23 15:22:54,541 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-23 15:22:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:54,542 INFO L225 Difference]: With dead ends: 243 [2018-07-23 15:22:54,542 INFO L226 Difference]: Without dead ends: 241 [2018-07-23 15:22:54,542 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 15:22:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-23 15:22:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-23 15:22:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-23 15:22:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-23 15:22:54,623 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-23 15:22:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-23 15:22:54,624 INFO L472 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-23 15:22:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-23 15:22:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-23 15:22:54,624 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:54,624 INFO L353 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-23 15:22:54,624 INFO L414 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1190534355, now seen corresponding path program 118 times [2018-07-23 15:22:54,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:56,057 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:56,057 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-23 15:22:56,058 INFO L450 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-23 15:22:56,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-23 15:22:56,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 15:22:56,058 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-23 15:22:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:22:58,179 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-23 15:22:58,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-23 15:22:58,179 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-23 15:22:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:22:58,179 INFO L225 Difference]: With dead ends: 245 [2018-07-23 15:22:58,179 INFO L226 Difference]: Without dead ends: 243 [2018-07-23 15:22:58,180 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 15:22:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-23 15:22:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-23 15:22:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-23 15:22:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-23 15:22:58,259 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-23 15:22:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:22:58,260 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-23 15:22:58,260 INFO L472 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-23 15:22:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-23 15:22:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-23 15:22:58,260 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:22:58,260 INFO L353 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-23 15:22:58,260 INFO L414 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:22:58,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1642281431, now seen corresponding path program 119 times [2018-07-23 15:22:58,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:22:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:22:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:22:59,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:22:59,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-23 15:22:59,689 INFO L450 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-23 15:22:59,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-23 15:22:59,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 15:22:59,690 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-23 15:23:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:01,936 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-23 15:23:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-23 15:23:01,937 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-23 15:23:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:01,937 INFO L225 Difference]: With dead ends: 247 [2018-07-23 15:23:01,937 INFO L226 Difference]: Without dead ends: 245 [2018-07-23 15:23:01,938 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 15:23:01,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-23 15:23:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-23 15:23:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 15:23:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-23 15:23:02,023 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-23 15:23:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:02,023 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-23 15:23:02,023 INFO L472 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-23 15:23:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-23 15:23:02,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-23 15:23:02,024 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:02,024 INFO L353 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-23 15:23:02,024 INFO L414 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1979524571, now seen corresponding path program 120 times [2018-07-23 15:23:02,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:03,499 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:03,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-23 15:23:03,500 INFO L450 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-23 15:23:03,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-23 15:23:03,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 15:23:03,500 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-23 15:23:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:05,790 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-23 15:23:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-23 15:23:05,790 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-23 15:23:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:05,791 INFO L225 Difference]: With dead ends: 249 [2018-07-23 15:23:05,791 INFO L226 Difference]: Without dead ends: 247 [2018-07-23 15:23:05,791 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 15:23:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-23 15:23:05,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-23 15:23:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-23 15:23:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-23 15:23:05,874 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-23 15:23:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:05,874 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-23 15:23:05,875 INFO L472 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-23 15:23:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-23 15:23:05,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-23 15:23:05,875 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:05,875 INFO L353 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-23 15:23:05,875 INFO L414 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:05,876 INFO L82 PathProgramCache]: Analyzing trace with hash 347332385, now seen corresponding path program 121 times [2018-07-23 15:23:05,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:07,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:07,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-23 15:23:07,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-23 15:23:07,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-23 15:23:07,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 15:23:07,383 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-23 15:23:09,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:09,557 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-23 15:23:09,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-23 15:23:09,557 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-23 15:23:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:09,558 INFO L225 Difference]: With dead ends: 251 [2018-07-23 15:23:09,558 INFO L226 Difference]: Without dead ends: 249 [2018-07-23 15:23:09,559 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 15:23:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-23 15:23:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-23 15:23:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-23 15:23:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-23 15:23:09,643 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-23 15:23:09,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:09,643 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-23 15:23:09,643 INFO L472 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-23 15:23:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-23 15:23:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-23 15:23:09,644 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:09,644 INFO L353 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-23 15:23:09,644 INFO L414 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1221094115, now seen corresponding path program 122 times [2018-07-23 15:23:09,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:11,119 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:11,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-23 15:23:11,120 INFO L450 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-23 15:23:11,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-23 15:23:11,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 15:23:11,121 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-23 15:23:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:13,477 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-23 15:23:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-23 15:23:13,477 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-23 15:23:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:13,478 INFO L225 Difference]: With dead ends: 253 [2018-07-23 15:23:13,478 INFO L226 Difference]: Without dead ends: 251 [2018-07-23 15:23:13,478 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 15:23:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-23 15:23:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-23 15:23:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-23 15:23:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-23 15:23:13,565 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-23 15:23:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:13,566 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-23 15:23:13,566 INFO L472 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-23 15:23:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-23 15:23:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-23 15:23:13,567 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:13,567 INFO L353 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-23 15:23:13,567 INFO L414 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:13,567 INFO L82 PathProgramCache]: Analyzing trace with hash -945439719, now seen corresponding path program 123 times [2018-07-23 15:23:13,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:15,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:15,052 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:15,052 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-23 15:23:15,052 INFO L450 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-23 15:23:15,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-23 15:23:15,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 15:23:15,053 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-23 15:23:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:17,284 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-23 15:23:17,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-23 15:23:17,284 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-23 15:23:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:17,285 INFO L225 Difference]: With dead ends: 255 [2018-07-23 15:23:17,285 INFO L226 Difference]: Without dead ends: 253 [2018-07-23 15:23:17,285 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 15:23:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-23 15:23:17,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-23 15:23:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-23 15:23:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-23 15:23:17,372 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-23 15:23:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:17,372 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-23 15:23:17,372 INFO L472 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-23 15:23:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-23 15:23:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-23 15:23:17,373 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:17,373 INFO L353 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-23 15:23:17,373 INFO L414 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:17,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1965429781, now seen corresponding path program 124 times [2018-07-23 15:23:17,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:18,963 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:18,963 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-23 15:23:18,964 INFO L450 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-23 15:23:18,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-23 15:23:18,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 15:23:18,964 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-23 15:23:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:21,382 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-23 15:23:21,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-23 15:23:21,382 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-23 15:23:21,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:21,383 INFO L225 Difference]: With dead ends: 257 [2018-07-23 15:23:21,383 INFO L226 Difference]: Without dead ends: 255 [2018-07-23 15:23:21,383 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 15:23:21,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-23 15:23:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-23 15:23:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-23 15:23:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-23 15:23:21,472 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-23 15:23:21,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:21,473 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-23 15:23:21,473 INFO L472 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-23 15:23:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-23 15:23:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-23 15:23:21,473 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:21,474 INFO L353 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-23 15:23:21,474 INFO L414 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1007657711, now seen corresponding path program 125 times [2018-07-23 15:23:21,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:23,194 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:23,194 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-23 15:23:23,195 INFO L450 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-23 15:23:23,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-23 15:23:23,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 15:23:23,196 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-23 15:23:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:25,500 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-23 15:23:25,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-23 15:23:25,500 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-23 15:23:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:25,501 INFO L225 Difference]: With dead ends: 259 [2018-07-23 15:23:25,501 INFO L226 Difference]: Without dead ends: 257 [2018-07-23 15:23:25,501 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 15:23:25,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-23 15:23:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-23 15:23:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-23 15:23:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-23 15:23:25,593 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-23 15:23:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:25,594 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-23 15:23:25,594 INFO L472 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-23 15:23:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-23 15:23:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-23 15:23:25,594 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:25,594 INFO L353 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-23 15:23:25,595 INFO L414 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1991485683, now seen corresponding path program 126 times [2018-07-23 15:23:25,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:27,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:27,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-23 15:23:27,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-23 15:23:27,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-23 15:23:27,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 15:23:27,300 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-23 15:23:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:29,798 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-23 15:23:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-23 15:23:29,798 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-23 15:23:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:29,798 INFO L225 Difference]: With dead ends: 261 [2018-07-23 15:23:29,798 INFO L226 Difference]: Without dead ends: 259 [2018-07-23 15:23:29,799 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 15:23:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-23 15:23:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-23 15:23:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-23 15:23:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-23 15:23:29,892 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-23 15:23:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-23 15:23:29,892 INFO L472 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-23 15:23:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-23 15:23:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-23 15:23:29,893 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:29,893 INFO L353 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-23 15:23:29,893 INFO L414 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1737605641, now seen corresponding path program 127 times [2018-07-23 15:23:29,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:31,525 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:31,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-23 15:23:31,526 INFO L450 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-23 15:23:31,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-23 15:23:31,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-23 15:23:31,527 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-23 15:23:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:33,940 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-23 15:23:33,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-23 15:23:33,940 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-23 15:23:33,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:33,941 INFO L225 Difference]: With dead ends: 263 [2018-07-23 15:23:33,941 INFO L226 Difference]: Without dead ends: 261 [2018-07-23 15:23:33,942 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-23 15:23:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-23 15:23:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-23 15:23:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-23 15:23:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-23 15:23:34,037 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-23 15:23:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:34,038 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-23 15:23:34,038 INFO L472 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-23 15:23:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-23 15:23:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-23 15:23:34,039 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:34,039 INFO L353 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-23 15:23:34,039 INFO L414 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:34,039 INFO L82 PathProgramCache]: Analyzing trace with hash -903324155, now seen corresponding path program 128 times [2018-07-23 15:23:34,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:35,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:35,807 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-23 15:23:35,808 INFO L450 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-23 15:23:35,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-23 15:23:35,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 15:23:35,809 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-23 15:23:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:38,450 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-23 15:23:38,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-23 15:23:38,451 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-23 15:23:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:38,451 INFO L225 Difference]: With dead ends: 265 [2018-07-23 15:23:38,451 INFO L226 Difference]: Without dead ends: 263 [2018-07-23 15:23:38,452 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 15:23:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-23 15:23:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-23 15:23:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-23 15:23:38,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-23 15:23:38,549 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-23 15:23:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:38,549 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-23 15:23:38,549 INFO L472 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-23 15:23:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-23 15:23:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-23 15:23:38,550 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:38,550 INFO L353 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-23 15:23:38,550 INFO L414 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:38,550 INFO L82 PathProgramCache]: Analyzing trace with hash -511186175, now seen corresponding path program 129 times [2018-07-23 15:23:38,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:40,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:40,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-23 15:23:40,334 INFO L450 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-23 15:23:40,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-23 15:23:40,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 15:23:40,335 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-23 15:23:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:42,958 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-23 15:23:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-23 15:23:42,958 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-23 15:23:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:42,959 INFO L225 Difference]: With dead ends: 267 [2018-07-23 15:23:42,959 INFO L226 Difference]: Without dead ends: 265 [2018-07-23 15:23:42,960 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 15:23:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-23 15:23:43,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-23 15:23:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-23 15:23:43,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-23 15:23:43,057 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-23 15:23:43,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:43,057 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-23 15:23:43,057 INFO L472 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-23 15:23:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-23 15:23:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-23 15:23:43,058 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:43,058 INFO L353 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-23 15:23:43,058 INFO L414 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1623709443, now seen corresponding path program 130 times [2018-07-23 15:23:43,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:44,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:44,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-23 15:23:44,867 INFO L450 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-23 15:23:44,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-23 15:23:44,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 15:23:44,868 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-23 15:23:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:47,415 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-23 15:23:47,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-23 15:23:47,415 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-23 15:23:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:47,416 INFO L225 Difference]: With dead ends: 269 [2018-07-23 15:23:47,416 INFO L226 Difference]: Without dead ends: 267 [2018-07-23 15:23:47,417 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 15:23:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-23 15:23:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-23 15:23:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 15:23:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-23 15:23:47,517 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-23 15:23:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:47,517 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-23 15:23:47,517 INFO L472 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-23 15:23:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-23 15:23:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-23 15:23:47,518 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:47,518 INFO L353 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-23 15:23:47,518 INFO L414 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1311713287, now seen corresponding path program 131 times [2018-07-23 15:23:47,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:49,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:49,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-23 15:23:49,336 INFO L450 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-23 15:23:49,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-23 15:23:49,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 15:23:49,337 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-23 15:23:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:52,052 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-23 15:23:52,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-23 15:23:52,052 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-23 15:23:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:52,053 INFO L225 Difference]: With dead ends: 271 [2018-07-23 15:23:52,053 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 15:23:52,054 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 15:23:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 15:23:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-23 15:23:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-23 15:23:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-23 15:23:52,158 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-23 15:23:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:52,158 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-23 15:23:52,158 INFO L472 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-23 15:23:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-23 15:23:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-23 15:23:52,159 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:52,159 INFO L353 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-23 15:23:52,159 INFO L414 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2131118091, now seen corresponding path program 132 times [2018-07-23 15:23:52,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:53,983 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:53,983 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-23 15:23:53,983 INFO L450 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-23 15:23:53,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-23 15:23:53,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 15:23:53,984 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-23 15:23:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:23:56,772 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-23 15:23:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-23 15:23:56,773 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-23 15:23:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:23:56,773 INFO L225 Difference]: With dead ends: 273 [2018-07-23 15:23:56,773 INFO L226 Difference]: Without dead ends: 271 [2018-07-23 15:23:56,774 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 15:23:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-23 15:23:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-23 15:23:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-23 15:23:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-23 15:23:56,876 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-23 15:23:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:23:56,876 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-23 15:23:56,876 INFO L472 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-23 15:23:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-23 15:23:56,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-23 15:23:56,877 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:23:56,877 INFO L353 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-23 15:23:56,877 INFO L414 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:23:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 694847729, now seen corresponding path program 133 times [2018-07-23 15:23:56,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:23:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:23:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:23:58,815 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:23:58,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-23 15:23:58,815 INFO L450 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-23 15:23:58,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-23 15:23:58,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-23 15:23:58,816 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-23 15:24:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:01,475 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-23 15:24:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-23 15:24:01,475 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-23 15:24:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:01,476 INFO L225 Difference]: With dead ends: 275 [2018-07-23 15:24:01,476 INFO L226 Difference]: Without dead ends: 273 [2018-07-23 15:24:01,476 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-23 15:24:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-23 15:24:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-23 15:24:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-23 15:24:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-23 15:24:01,580 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-23 15:24:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:01,580 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-23 15:24:01,580 INFO L472 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-23 15:24:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-23 15:24:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-23 15:24:01,581 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:01,581 INFO L353 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-23 15:24:01,581 INFO L414 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2028669677, now seen corresponding path program 134 times [2018-07-23 15:24:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:03,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:03,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-23 15:24:03,480 INFO L450 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-23 15:24:03,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-23 15:24:03,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 15:24:03,481 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-23 15:24:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:06,195 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-23 15:24:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-23 15:24:06,195 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-23 15:24:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:06,196 INFO L225 Difference]: With dead ends: 277 [2018-07-23 15:24:06,196 INFO L226 Difference]: Without dead ends: 275 [2018-07-23 15:24:06,196 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 15:24:06,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-23 15:24:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-23 15:24:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-23 15:24:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-23 15:24:06,374 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-23 15:24:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:06,374 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-23 15:24:06,374 INFO L472 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-23 15:24:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-23 15:24:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-23 15:24:06,375 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:06,375 INFO L353 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-23 15:24:06,375 INFO L414 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:06,375 INFO L82 PathProgramCache]: Analyzing trace with hash -363659799, now seen corresponding path program 135 times [2018-07-23 15:24:06,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:08,354 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:08,355 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-23 15:24:08,355 INFO L450 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-23 15:24:08,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-23 15:24:08,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-23 15:24:08,356 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-23 15:24:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:11,165 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-23 15:24:11,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-23 15:24:11,166 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-23 15:24:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:11,166 INFO L225 Difference]: With dead ends: 279 [2018-07-23 15:24:11,166 INFO L226 Difference]: Without dead ends: 277 [2018-07-23 15:24:11,167 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-23 15:24:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-23 15:24:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-23 15:24:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-23 15:24:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-23 15:24:11,274 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-23 15:24:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:11,274 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-23 15:24:11,274 INFO L472 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-23 15:24:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-23 15:24:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-23 15:24:11,275 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:11,276 INFO L353 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-23 15:24:11,276 INFO L414 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1584782875, now seen corresponding path program 136 times [2018-07-23 15:24:11,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:13,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:13,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-23 15:24:13,294 INFO L450 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-23 15:24:13,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-23 15:24:13,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 15:24:13,296 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-07-23 15:24:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:16,226 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-07-23 15:24:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-23 15:24:16,227 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-07-23 15:24:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:16,227 INFO L225 Difference]: With dead ends: 281 [2018-07-23 15:24:16,227 INFO L226 Difference]: Without dead ends: 279 [2018-07-23 15:24:16,228 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 15:24:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-23 15:24:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-23 15:24:16,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-23 15:24:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-07-23 15:24:16,337 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-07-23 15:24:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:16,338 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-07-23 15:24:16,338 INFO L472 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-23 15:24:16,338 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-07-23 15:24:16,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-23 15:24:16,338 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:16,339 INFO L353 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-07-23 15:24:16,339 INFO L414 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1736980193, now seen corresponding path program 137 times [2018-07-23 15:24:16,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:18,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:18,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-23 15:24:18,393 INFO L450 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-23 15:24:18,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-23 15:24:18,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-23 15:24:18,395 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-07-23 15:24:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,405 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-23 15:24:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-23 15:24:21,406 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-07-23 15:24:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,406 INFO L225 Difference]: With dead ends: 283 [2018-07-23 15:24:21,406 INFO L226 Difference]: Without dead ends: 281 [2018-07-23 15:24:21,407 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-23 15:24:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-23 15:24:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-23 15:24:21,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-23 15:24:21,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-23 15:24:21,519 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-07-23 15:24:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,519 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-23 15:24:21,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-23 15:24:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-23 15:24:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-23 15:24:21,520 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,520 INFO L353 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-07-23 15:24:21,520 INFO L414 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1504379683, now seen corresponding path program 138 times [2018-07-23 15:24:21,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:23,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:23,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-23 15:24:23,650 INFO L450 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-23 15:24:23,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-23 15:24:23,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 15:24:23,651 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-07-23 15:24:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:26,634 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-23 15:24:26,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-23 15:24:26,634 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-07-23 15:24:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:26,634 INFO L225 Difference]: With dead ends: 285 [2018-07-23 15:24:26,634 INFO L226 Difference]: Without dead ends: 283 [2018-07-23 15:24:26,635 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 15:24:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-23 15:24:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-23 15:24:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-23 15:24:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-07-23 15:24:26,746 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-07-23 15:24:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:26,746 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-07-23 15:24:26,746 INFO L472 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-23 15:24:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-07-23 15:24:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-23 15:24:26,747 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:26,747 INFO L353 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-07-23 15:24:26,747 INFO L414 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:26,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1695036377, now seen corresponding path program 139 times [2018-07-23 15:24:26,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:28,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:28,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-23 15:24:28,789 INFO L450 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-23 15:24:28,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-23 15:24:28,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-23 15:24:28,790 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-07-23 15:24:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:31,874 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-23 15:24:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-23 15:24:31,874 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-07-23 15:24:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:31,875 INFO L225 Difference]: With dead ends: 287 [2018-07-23 15:24:31,875 INFO L226 Difference]: Without dead ends: 285 [2018-07-23 15:24:31,876 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-23 15:24:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-23 15:24:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-23 15:24:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-23 15:24:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-23 15:24:31,990 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-07-23 15:24:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:31,991 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-23 15:24:31,991 INFO L472 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-23 15:24:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-23 15:24:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-23 15:24:31,991 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:31,992 INFO L353 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-07-23 15:24:31,992 INFO L414 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1137286101, now seen corresponding path program 140 times [2018-07-23 15:24:31,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:24:34,132 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:34,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-23 15:24:34,133 INFO L450 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-23 15:24:34,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-23 15:24:34,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-23 15:24:34,134 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-07-23 15:24:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:37,216 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-07-23 15:24:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-23 15:24:37,216 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-07-23 15:24:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:37,217 INFO L225 Difference]: With dead ends: 289 [2018-07-23 15:24:37,217 INFO L226 Difference]: Without dead ends: 287 [2018-07-23 15:24:37,218 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-23 15:24:37,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-23 15:24:37,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-23 15:24:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-23 15:24:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-07-23 15:24:37,386 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-07-23 15:24:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:37,386 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-07-23 15:24:37,386 INFO L472 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-23 15:24:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-07-23 15:24:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-23 15:24:37,387 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:37,387 INFO L353 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-07-23 15:24:37,387 INFO L414 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:37,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2010182865, now seen corresponding path program 141 times [2018-07-23 15:24:37,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-23 15:24:38,314 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 15:24:38,318 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 15:24:38,319 INFO L202 PluginConnector]: Adding new model afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:24:38 BoogieIcfgContainer [2018-07-23 15:24:38,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:24:38,321 INFO L168 Benchmark]: Toolchain (without parser) took 261287.72 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:24:38,323 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:24:38,323 INFO L168 Benchmark]: Boogie Preprocessor took 42.41 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 15:24:38,324 INFO L168 Benchmark]: RCFGBuilder took 235.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:24:38,324 INFO L168 Benchmark]: TraceAbstraction took 261003.84 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:24:38,326 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.41 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 235.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 261003.84 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 287 with TraceHistMax 142, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 285 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 260.9s OverallTime, 142 OverallIterations, 142 TraceHistogramMax, 154.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 561 SDtfs, 0 SDslu, 10011 SDs, 0 SdLazy, 1908601 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 104.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 10015 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 141 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 17.8s SatisfiabilityAnalysisTime, 74.9s InterpolantComputationTime, 20304 NumberOfCodeBlocks, 20304 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 20163 ConstructedInterpolants, 0 QuantifiedInterpolants, 26280105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 141 InterpolantComputations, 1 PerfectInterpolantSequences, 0/934360 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/afnp2014.c.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-24-38-337.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/afnp2014.c.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-24-38-337.csv Completed graceful shutdown