java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:46:56,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:46:56,729 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:46:56,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:46:56,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:46:56,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:46:56,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:46:56,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:46:56,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:46:56,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:46:56,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:46:56,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:46:56,762 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:46:56,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:46:56,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:46:56,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:46:56,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:46:56,773 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:46:56,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:46:56,776 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:46:56,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:46:56,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:46:56,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:46:56,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:46:56,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:46:56,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:46:56,784 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:46:56,785 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:46:56,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:46:56,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:46:56,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:46:56,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:46:56,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:46:56,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:46:56,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:46:56,792 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:46:56,793 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:46:56,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:46:56,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:46:56,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:46:56,823 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:46:56,825 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:46:56,825 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:46:56,825 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:46:56,826 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:46:56,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:46:56,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:46:56,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:46:56,918 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:46:56,918 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:46:56,919 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl [2018-07-25 08:46:56,920 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl' [2018-07-25 08:46:57,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:46:57,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:46:57,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:46:57,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:46:57,014 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:46:57,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,053 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:46:57,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:46:57,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:46:57,063 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:46:57,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:46:57,111 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:46:57,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:46:57,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:46:57,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/1) ... [2018-07-25 08:46:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:46:57,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:46:57,437 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:46:57,437 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:46:57 BoogieIcfgContainer [2018-07-25 08:46:57,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:46:57,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:46:57,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:46:57,445 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:46:57,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:46:56" (1/2) ... [2018-07-25 08:46:57,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2a1575 and model type linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:46:57, skipping insertion in model container [2018-07-25 08:46:57,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:46:57" (2/2) ... [2018-07-25 08:46:57,449 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.i_4.bpl [2018-07-25 08:46:57,460 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:46:57,473 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:46:57,529 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:46:57,530 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:46:57,531 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:46:57,531 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:46:57,531 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:46:57,531 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:46:57,531 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:46:57,532 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:46:57,532 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:46:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:46:57,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:46:57,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:57,561 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:46:57,563 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 08:46:57,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:57,945 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-07-25 08:46:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:46:58,028 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:46:58,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 08:46:58,034 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:46:58,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:46:58,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:46:58,052 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-07-25 08:46:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:58,193 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 08:46:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:46:58,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 08:46:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:58,206 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:46:58,207 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:46:58,210 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:46:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:46:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:46:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:46:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:46:58,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 08:46:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:58,250 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:46:58,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:46:58,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:46:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:46:58,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:58,251 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 08:46:58,252 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:58,252 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 08:46:58,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:58,474 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-25 08:46:58,475 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:58,475 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:46:58,479 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:46:58,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:46:58,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:46:58,482 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 08:46:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:58,628 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:46:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:46:58,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 08:46:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:58,629 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:46:58,629 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:46:58,630 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:46:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:46:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:46:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:46:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:46:58,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 08:46:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:58,636 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:46:58,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:46:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:46:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:46:58,637 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:58,637 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 08:46:58,637 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:58,638 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 08:46:58,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:58,846 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-25 08:46:58,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:58,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:46:58,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:46:58,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:46:58,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:46:58,852 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-07-25 08:46:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:59,021 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:46:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:46:59,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-07-25 08:46:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:59,023 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:46:59,023 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:46:59,024 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:46:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:46:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:46:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:46:59,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:46:59,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 08:46:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:59,038 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:46:59,038 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:46:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:46:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:46:59,040 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:59,041 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 08:46:59,041 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:59,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 08:46:59,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:59,273 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-25 08:46:59,274 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:59,275 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:46:59,275 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:46:59,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:46:59,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:46:59,277 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-07-25 08:46:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:59,475 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:46:59,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:46:59,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-07-25 08:46:59,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:59,477 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:46:59,478 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:46:59,479 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:46:59,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:46:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:46:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:46:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:46:59,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 08:46:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:59,488 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:46:59,488 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:46:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:46:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:46:59,489 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:59,490 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 08:46:59,490 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 08:46:59,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:46:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:46:59,704 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-25 08:46:59,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:46:59,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:46:59,708 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:46:59,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:46:59,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:46:59,709 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-07-25 08:46:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:46:59,972 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:46:59,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:46:59,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-07-25 08:46:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:46:59,974 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:46:59,974 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:46:59,975 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:46:59,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:46:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:46:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:46:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:46:59,982 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 08:46:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:46:59,983 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:46:59,983 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:46:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:46:59,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:46:59,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:46:59,984 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 08:46:59,985 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:46:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 08:46:59,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:00,200 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-25 08:47:00,200 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:00,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:47:00,201 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:47:00,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:47:00,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:47:00,202 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-07-25 08:47:00,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:00,485 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:47:00,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:47:00,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-07-25 08:47:00,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:00,491 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:47:00,492 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:47:00,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:47:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:47:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:47:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:47:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:47:00,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 08:47:00,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:00,505 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:47:00,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:47:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:47:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:47:00,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:00,506 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 08:47:00,506 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:00,507 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 08:47:00,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:00,807 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-25 08:47:00,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:00,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:47:00,809 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:47:00,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:47:00,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:47:00,811 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-07-25 08:47:01,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:01,108 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:47:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:47:01,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-07-25 08:47:01,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:01,109 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:47:01,109 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:47:01,111 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:47:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:47:01,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:47:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:47:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:47:01,120 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 08:47:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:01,121 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:47:01,122 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:47:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:47:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:47:01,123 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:01,123 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 08:47:01,123 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 08:47:01,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:01,500 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-25 08:47:01,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:01,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:47:01,501 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:47:01,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:47:01,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:47:01,503 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-07-25 08:47:01,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:01,847 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:47:01,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:47:01,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-07-25 08:47:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:01,848 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:47:01,849 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:47:01,849 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:47:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:47:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:47:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:47:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:47:01,856 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 08:47:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:01,857 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:47:01,857 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:47:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:47:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:47:01,858 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:01,858 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 08:47:01,858 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 08:47:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:02,205 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-25 08:47:02,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:02,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:47:02,206 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:47:02,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:47:02,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:47:02,207 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-07-25 08:47:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:02,642 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:47:02,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:47:02,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-07-25 08:47:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:02,643 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:47:02,643 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:47:02,644 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:47:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:47:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:47:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:47:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:47:02,661 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 08:47:02,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:02,661 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:47:02,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:47:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:47:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:47:02,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:02,664 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 08:47:02,664 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 08:47:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:03,008 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-25 08:47:03,008 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:03,009 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:47:03,009 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:47:03,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:47:03,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:47:03,011 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2018-07-25 08:47:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:03,468 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:47:03,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:47:03,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-07-25 08:47:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:03,469 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:47:03,469 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:47:03,470 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:47:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:47:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:47:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:47:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:47:03,479 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 08:47:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:03,479 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:47:03,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:47:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:47:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:47:03,480 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:03,481 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 08:47:03,481 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-25 08:47:03,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:03,956 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-25 08:47:03,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:03,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:47:03,957 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:47:03,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:47:03,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:47:03,958 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-07-25 08:47:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:04,476 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:47:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:47:04,477 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-07-25 08:47:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:04,477 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:47:04,477 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:47:04,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:47:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:47:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:47:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:47:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:47:04,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 08:47:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:04,489 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:47:04,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:47:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:47:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:47:04,490 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:04,490 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 08:47:04,490 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:04,490 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-25 08:47:04,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:04,820 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-25 08:47:04,821 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:04,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:47:04,821 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:47:04,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:47:04,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:47:04,822 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-07-25 08:47:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:05,306 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:47:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:47:05,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-07-25 08:47:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:05,307 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:47:05,308 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:47:05,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:47:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:47:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:47:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:47:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:47:05,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 08:47:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:05,320 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:47:05,320 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:47:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:47:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:47:05,321 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:05,321 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 08:47:05,321 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-25 08:47:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:05,810 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-25 08:47:05,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:05,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:47:05,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:47:05,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:47:05,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:47:05,812 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-07-25 08:47:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:06,412 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:47:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:47:06,412 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-07-25 08:47:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:06,413 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:47:06,413 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:47:06,414 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:47:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:47:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:47:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:47:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:47:06,425 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 08:47:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:06,425 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:47:06,425 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:47:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:47:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:47:06,426 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:06,426 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 08:47:06,426 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-25 08:47:06,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:06,856 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-25 08:47:06,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:06,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:47:06,857 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:47:06,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:47:06,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:47:06,858 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2018-07-25 08:47:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:07,541 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:47:07,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:47:07,542 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-07-25 08:47:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:07,543 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:47:07,543 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:47:07,544 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:47:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:47:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:47:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:47:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:47:07,555 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 08:47:07,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:07,556 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:47:07,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:47:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:47:07,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:47:07,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:07,557 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 08:47:07,558 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:07,558 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-25 08:47:07,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:08,181 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-25 08:47:08,181 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:08,181 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:47:08,182 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:47:08,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:47:08,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:47:08,183 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-07-25 08:47:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:08,801 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:47:08,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:47:08,802 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-07-25 08:47:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:08,802 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:47:08,803 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:47:08,804 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:47:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:47:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:47:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:47:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:47:08,816 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 08:47:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:08,817 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:47:08,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:47:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:47:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:47:08,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:08,818 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 08:47:08,818 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:08,819 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-25 08:47:08,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:09,212 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-25 08:47:09,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:09,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:47:09,214 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:47:09,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:47:09,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:47:09,215 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2018-07-25 08:47:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:09,843 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:47:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:47:09,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-07-25 08:47:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:09,848 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:47:09,848 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:47:09,849 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:47:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:47:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:47:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:47:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:47:09,866 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 08:47:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:09,867 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:47:09,867 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:47:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:47:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:47:09,868 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:09,868 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 08:47:09,869 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:09,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-25 08:47:09,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:10,703 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-25 08:47:10,704 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:10,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:47:10,704 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:47:10,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:47:10,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:47:10,705 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-07-25 08:47:11,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:11,390 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:47:11,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:47:11,390 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-07-25 08:47:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:11,391 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:47:11,391 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:47:11,392 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:47:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:47:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:47:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:47:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:47:11,409 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 08:47:11,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:11,410 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:47:11,410 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:47:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:47:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:47:11,411 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:11,411 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 08:47:11,411 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-25 08:47:11,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:11,831 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-25 08:47:11,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:11,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:47:11,832 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:47:11,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:47:11,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:47:11,833 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2018-07-25 08:47:12,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:12,478 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:47:12,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:47:12,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-07-25 08:47:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:12,479 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:47:12,479 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:47:12,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:47:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:47:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:47:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:47:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:47:12,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 08:47:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:12,496 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:47:12,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:47:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:47:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:47:12,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:12,497 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 08:47:12,497 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-25 08:47:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:13,237 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-25 08:47:13,237 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:13,237 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:47:13,238 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:47:13,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:47:13,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:47:13,240 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-07-25 08:47:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:13,982 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:47:13,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:47:13,982 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-07-25 08:47:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:13,983 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:47:13,983 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:47:13,984 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:47:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:47:13,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:47:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:47:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:47:13,995 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 08:47:13,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:13,995 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:47:13,995 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:47:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:47:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:47:13,996 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:13,997 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 08:47:13,997 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:13,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-25 08:47:13,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:14,446 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-25 08:47:14,446 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:14,447 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:47:14,447 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:47:14,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:47:14,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:47:14,448 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2018-07-25 08:47:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:15,118 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:47:15,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:47:15,119 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-07-25 08:47:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:15,122 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:47:15,122 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:47:15,123 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:47:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:47:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:47:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:47:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:47:15,144 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 08:47:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:15,146 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:47:15,146 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:47:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:47:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:47:15,147 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:15,147 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 08:47:15,147 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-25 08:47:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:15,965 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-25 08:47:15,966 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:15,966 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:47:15,966 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:47:15,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:47:15,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:47:15,968 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-07-25 08:47:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:16,921 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:47:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:47:16,921 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-07-25 08:47:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:16,922 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:47:16,922 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:47:16,923 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:47:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:47:16,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:47:16,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:47:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:47:16,937 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 08:47:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:16,937 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:47:16,937 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:47:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:47:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:47:16,938 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:16,938 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 08:47:16,938 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-25 08:47:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:17,436 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-25 08:47:17,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:17,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:47:17,437 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:47:17,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:47:17,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:47:17,438 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2018-07-25 08:47:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:18,213 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:47:18,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:47:18,215 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-07-25 08:47:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:18,216 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:47:18,216 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:47:18,221 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:47:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:47:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:47:18,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:47:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:47:18,232 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 08:47:18,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:18,232 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:47:18,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:47:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:47:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:47:18,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:18,233 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 08:47:18,234 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:18,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-25 08:47:18,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:18,859 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-25 08:47:18,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:18,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:47:18,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:47:18,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:47:18,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:47:18,861 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-07-25 08:47:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:19,701 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:47:19,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:47:19,701 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-07-25 08:47:19,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:19,702 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:47:19,702 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:47:19,703 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:47:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:47:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:47:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:47:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:47:19,713 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 08:47:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:19,714 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:47:19,714 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:47:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:47:19,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:47:19,714 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:19,716 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 08:47:19,716 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-25 08:47:19,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:20,226 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-25 08:47:20,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:20,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:47:20,228 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:47:20,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:47:20,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:47:20,229 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2018-07-25 08:47:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:21,080 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:47:21,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:47:21,080 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-07-25 08:47:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:21,081 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:47:21,081 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:47:21,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:47:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:47:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:47:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:47:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:47:21,098 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 08:47:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:21,099 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:47:21,099 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:47:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:47:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:47:21,099 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:21,100 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 08:47:21,100 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-25 08:47:21,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:21,758 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-25 08:47:21,758 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:21,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:47:21,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:47:21,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:47:21,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:47:21,760 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-07-25 08:47:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:22,660 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:47:22,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:47:22,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-07-25 08:47:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:22,661 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:47:22,661 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:47:22,663 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:47:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:47:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:47:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:47:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:47:22,675 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 08:47:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:22,676 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:47:22,676 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:47:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:47:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:47:22,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:22,677 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 08:47:22,677 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-25 08:47:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:23,280 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-25 08:47:23,281 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:23,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:47:23,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:47:23,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:47:23,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:47:23,283 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2018-07-25 08:47:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:24,158 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:47:24,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:47:24,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-07-25 08:47:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:24,159 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:47:24,159 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:47:24,161 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:47:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:47:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:47:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:47:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:47:24,170 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 08:47:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:24,171 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:47:24,171 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:47:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:47:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:47:24,171 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:24,171 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 08:47:24,172 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-25 08:47:24,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:24,732 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-25 08:47:24,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:24,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:47:24,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:47:24,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:47:24,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:47:24,734 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-07-25 08:47:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:25,552 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:47:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:47:25,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-07-25 08:47:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:25,553 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:47:25,554 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:47:25,556 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:47:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:47:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:47:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:47:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:47:25,566 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 08:47:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:25,566 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:47:25,566 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:47:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:47:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:47:25,567 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:25,567 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 08:47:25,567 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-25 08:47:25,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:26,322 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-25 08:47:26,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:26,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:47:26,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:47:26,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:47:26,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:47:26,324 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2018-07-25 08:47:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:27,145 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:47:27,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:47:27,146 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-07-25 08:47:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:27,146 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:47:27,146 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:47:27,148 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:47:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:47:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:47:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:47:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:47:27,158 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 08:47:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:27,159 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:47:27,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:47:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:47:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:47:27,159 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:27,160 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 08:47:27,160 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-25 08:47:27,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:27,955 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-25 08:47:27,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:27,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:47:27,956 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:47:27,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:47:27,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:47:27,958 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-07-25 08:47:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:29,043 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:47:29,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:47:29,044 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-07-25 08:47:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:29,045 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:47:29,045 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:47:29,046 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:47:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:47:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:47:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:47:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:47:29,057 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 08:47:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:29,058 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:47:29,058 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:47:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:47:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:47:29,059 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:29,059 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 08:47:29,059 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:29,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-25 08:47:29,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:29,665 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-25 08:47:29,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:29,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:47:29,666 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:47:29,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:47:29,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:47:29,667 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2018-07-25 08:47:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:30,560 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:47:30,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:47:30,560 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-07-25 08:47:30,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:30,561 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:47:30,561 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:47:30,563 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:47:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:47:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:47:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:47:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:47:30,574 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 08:47:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:30,575 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:47:30,575 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:47:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:47:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:47:30,575 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:30,576 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 08:47:30,576 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-25 08:47:30,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:31,282 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-25 08:47:31,282 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:31,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:47:31,283 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:47:31,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:47:31,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:47:31,283 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-07-25 08:47:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:32,317 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:47:32,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:47:32,318 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-07-25 08:47:32,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:32,318 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:47:32,319 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:47:32,320 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=3971, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:47:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:47:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:47:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:47:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:47:32,331 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 08:47:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:32,331 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:47:32,331 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:47:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:47:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:47:32,332 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:32,332 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 08:47:32,332 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:32,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-25 08:47:32,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:33,188 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-25 08:47:33,188 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:33,188 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:47:33,189 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:47:33,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:47:33,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:47:33,190 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2018-07-25 08:47:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:34,285 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:47:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:47:34,285 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-07-25 08:47:34,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:34,286 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:47:34,286 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:47:34,290 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:47:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:47:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:47:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:47:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:47:34,302 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 08:47:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:34,302 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:47:34,302 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:47:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:47:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:47:34,303 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:34,303 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 08:47:34,303 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-25 08:47:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:35,677 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-25 08:47:35,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:35,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:47:35,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:47:35,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:47:35,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:47:35,679 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-07-25 08:47:36,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:36,767 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:47:36,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:47:36,768 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-07-25 08:47:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:36,768 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:47:36,769 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:47:36,771 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:47:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:47:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:47:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:47:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:47:36,780 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 08:47:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:36,780 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:47:36,780 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:47:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:47:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:47:36,781 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:36,781 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 08:47:36,782 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-25 08:47:36,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:37,623 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-25 08:47:37,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:37,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:47:37,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:47:37,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:47:37,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:47:37,625 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2018-07-25 08:47:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:38,676 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:47:38,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:47:38,676 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-07-25 08:47:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:38,676 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:47:38,677 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:47:38,677 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:47:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:47:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:47:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:47:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:47:38,689 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 08:47:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:38,689 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:47:38,689 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:47:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:47:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:47:38,690 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:38,690 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 08:47:38,690 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:38,690 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-25 08:47:38,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:40,125 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-25 08:47:40,126 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:40,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:47:40,126 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:47:40,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:47:40,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:47:40,127 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-07-25 08:47:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:41,307 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:47:41,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:47:41,307 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-07-25 08:47:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:41,308 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:47:41,308 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:47:41,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:47:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:47:41,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:47:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:47:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:47:41,317 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 08:47:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:41,317 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:47:41,318 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:47:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:47:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:47:41,318 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:41,318 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 08:47:41,319 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:41,319 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-25 08:47:41,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:42,364 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-25 08:47:42,365 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:42,365 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:47:42,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:47:42,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:47:42,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:47:42,366 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2018-07-25 08:47:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:43,588 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:47:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:47:43,588 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-07-25 08:47:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:43,589 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:47:43,589 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:47:43,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:47:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:47:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:47:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:47:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:47:43,601 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 08:47:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:43,601 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:47:43,601 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:47:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:47:43,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:47:43,602 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:43,602 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 08:47:43,602 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-25 08:47:43,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:44,572 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-25 08:47:44,573 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:44,573 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:47:44,573 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:47:44,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:47:44,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:47:44,574 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-07-25 08:47:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:45,929 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:47:45,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:47:45,930 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-07-25 08:47:45,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:45,930 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:47:45,931 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:47:45,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:47:45,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:47:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:47:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:47:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:47:45,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 08:47:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:45,943 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:47:45,944 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:47:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:47:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:47:45,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:45,944 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 08:47:45,945 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-25 08:47:45,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:46,859 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-25 08:47:46,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:46,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:47:46,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:47:46,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:47:46,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:47:46,861 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2018-07-25 08:47:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:48,218 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:47:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:47:48,218 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-07-25 08:47:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:48,219 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:47:48,219 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:47:48,220 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:47:48,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:47:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:47:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:47:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:47:48,231 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 08:47:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:48,232 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:47:48,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:47:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:47:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:47:48,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:48,233 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 08:47:48,233 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-25 08:47:48,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:49,654 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-25 08:47:49,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:49,655 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:47:49,655 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:47:49,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:47:49,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:47:49,656 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-07-25 08:47:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:51,044 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:47:51,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:47:51,044 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-07-25 08:47:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:51,045 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:47:51,045 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:47:51,046 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:47:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:47:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:47:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:47:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:47:51,058 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 08:47:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:51,058 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:47:51,059 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:47:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:47:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:47:51,059 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:51,060 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 08:47:51,060 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-25 08:47:51,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:52,004 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-25 08:47:52,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:52,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:47:52,005 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:47:52,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:47:52,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:47:52,006 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-07-25 08:47:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:53,479 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:47:53,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:47:53,479 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-07-25 08:47:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:53,480 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:47:53,480 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:47:53,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:47:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:47:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:47:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:47:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:47:53,494 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 08:47:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:53,494 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:47:53,494 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:47:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:47:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:47:53,495 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:53,495 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 08:47:53,495 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:53,495 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-25 08:47:53,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:54,998 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-25 08:47:54,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:54,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:47:54,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:47:54,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:47:54,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:47:55,000 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-07-25 08:47:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:56,597 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:47:56,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:47:56,598 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-07-25 08:47:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:56,598 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:47:56,598 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:47:56,599 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:47:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:47:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:47:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:47:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:47:56,609 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 08:47:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:56,610 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:47:56,610 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:47:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:47:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:47:56,610 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:56,610 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 08:47:56,611 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-25 08:47:56,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:47:57,645 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-25 08:47:57,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:47:57,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:47:57,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:47:57,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:47:57,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:47:57,646 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2018-07-25 08:47:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:47:59,266 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:47:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:47:59,266 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-07-25 08:47:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:47:59,267 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:47:59,267 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:47:59,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:47:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:47:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:47:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:47:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:47:59,281 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 08:47:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:47:59,282 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:47:59,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:47:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:47:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:47:59,283 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:47:59,283 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 08:47:59,283 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:47:59,283 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-25 08:47:59,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:47:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:00,848 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-25 08:48:00,849 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:00,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:48:00,849 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:48:00,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:48:00,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:48:00,850 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-07-25 08:48:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:02,445 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:48:02,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:48:02,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-07-25 08:48:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:02,447 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:48:02,447 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:48:02,448 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:48:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:48:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:48:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:48:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:48:02,463 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 08:48:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:02,464 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:48:02,464 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:48:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:48:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:48:02,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:02,465 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 08:48:02,465 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-25 08:48:02,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:03,573 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-25 08:48:03,573 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:03,573 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:48:03,573 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:48:03,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:48:03,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:48:03,574 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2018-07-25 08:48:05,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:05,070 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:48:05,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:48:05,070 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-07-25 08:48:05,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:05,071 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:48:05,071 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:48:05,072 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:48:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:48:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:48:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:48:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:48:05,086 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 08:48:05,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:05,087 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:48:05,087 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:48:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:48:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:48:05,088 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:05,088 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 08:48:05,088 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-25 08:48:05,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:06,142 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-25 08:48:06,143 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:06,143 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:48:06,143 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:48:06,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:48:06,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:48:06,144 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-07-25 08:48:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:07,827 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:48:07,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:48:07,827 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-07-25 08:48:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:07,828 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:48:07,828 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:48:07,829 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=273, Invalid=8283, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:48:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:48:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:48:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:48:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:48:07,841 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 08:48:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:07,841 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:48:07,841 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:48:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:48:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:48:07,842 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:07,842 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 08:48:07,842 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:07,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-25 08:48:07,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:09,020 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-25 08:48:09,020 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:09,020 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:48:09,020 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:48:09,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:48:09,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:48:09,021 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2018-07-25 08:48:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:10,938 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:48:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:48:10,938 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-07-25 08:48:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:10,939 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:48:10,939 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:48:10,940 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:48:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:48:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:48:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:48:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:48:10,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 08:48:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:10,953 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:48:10,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:48:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:48:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:48:10,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:10,954 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 08:48:10,954 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-25 08:48:10,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:12,241 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-25 08:48:12,241 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:12,242 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:48:12,242 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:48:12,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:48:12,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:48:12,243 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-07-25 08:48:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:14,052 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:48:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:48:14,053 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-07-25 08:48:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:14,053 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:48:14,053 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:48:14,054 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:48:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:48:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:48:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:48:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:48:14,066 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 08:48:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:14,067 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:48:14,067 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:48:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:48:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:48:14,067 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:14,068 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 08:48:14,068 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-25 08:48:14,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:15,430 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-25 08:48:15,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:15,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:48:15,431 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:48:15,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:48:15,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:48:15,432 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2018-07-25 08:48:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:17,443 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:48:17,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:48:17,443 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-07-25 08:48:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:17,444 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:48:17,444 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:48:17,445 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:48:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:48:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:48:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:48:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:48:17,458 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 08:48:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:17,458 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:48:17,458 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:48:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:48:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:48:17,459 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:17,459 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 08:48:17,459 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:17,459 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-25 08:48:17,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:18,943 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-25 08:48:18,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:18,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:48:18,944 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:48:18,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:48:18,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:48:18,945 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-07-25 08:48:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:21,145 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:48:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:48:21,145 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-07-25 08:48:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:21,146 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:48:21,146 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:48:21,148 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=297, Invalid=9803, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:48:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:48:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:48:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:48:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:48:21,161 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 08:48:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:21,161 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:48:21,162 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:48:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:48:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:48:21,162 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:21,163 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 08:48:21,163 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-25 08:48:21,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:22,543 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-25 08:48:22,543 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:22,543 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:48:22,544 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:48:22,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:48:22,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:48:22,544 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2018-07-25 08:48:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:24,527 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:48:24,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:48:24,527 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-07-25 08:48:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:24,528 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:48:24,528 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:48:24,529 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:48:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:48:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:48:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:48:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:48:24,540 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 08:48:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:24,540 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:48:24,540 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:48:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:48:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:48:24,541 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:24,541 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 08:48:24,541 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:24,541 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-25 08:48:24,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:26,115 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-25 08:48:26,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:26,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:48:26,116 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:48:26,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:48:26,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:48:26,117 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-07-25 08:48:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:28,415 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:48:28,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:48:28,415 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-07-25 08:48:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:28,416 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:48:28,416 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:48:28,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=309, Invalid=10611, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:48:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:48:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:48:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:48:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:48:28,431 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 08:48:28,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:28,431 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:48:28,432 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:48:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:48:28,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:48:28,432 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:28,433 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 08:48:28,433 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-25 08:48:28,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:29,872 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-25 08:48:29,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:29,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:48:29,873 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:48:29,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:48:29,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:48:29,874 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2018-07-25 08:48:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:31,961 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:48:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:48:31,962 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2018-07-25 08:48:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:31,962 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:48:31,963 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:48:31,963 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:48:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:48:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:48:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:48:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:48:31,975 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 08:48:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:31,975 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:48:31,975 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:48:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:48:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:48:31,976 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:31,976 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 08:48:31,976 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-25 08:48:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:33,477 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-25 08:48:33,478 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:33,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:48:33,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:48:33,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:48:33,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:48:33,479 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-07-25 08:48:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:35,549 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:48:35,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:48:35,550 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-07-25 08:48:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:35,550 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:48:35,551 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:48:35,552 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=321, Invalid=11451, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:48:35,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:48:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:48:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:48:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:48:35,567 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 08:48:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:35,567 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:48:35,567 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:48:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:48:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:48:35,568 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:35,568 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 08:48:35,568 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-25 08:48:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:37,031 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-25 08:48:37,031 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:37,031 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:48:37,032 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:48:37,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:48:37,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:48:37,032 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2018-07-25 08:48:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:39,256 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:48:39,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:48:39,256 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2018-07-25 08:48:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:39,257 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:48:39,257 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:48:39,258 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:48:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:48:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:48:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:48:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:48:39,269 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 08:48:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:39,270 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:48:39,270 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:48:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:48:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:48:39,270 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:39,270 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 08:48:39,271 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-25 08:48:39,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:40,884 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-25 08:48:40,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:40,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:48:40,884 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:48:40,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:48:40,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:48:40,885 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-07-25 08:48:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:43,227 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:48:43,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:48:43,228 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-07-25 08:48:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:43,229 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:48:43,229 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:48:43,229 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=333, Invalid=12323, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:48:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:48:43,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:48:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:48:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:48:43,241 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 08:48:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:43,241 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:48:43,241 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:48:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:48:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:48:43,242 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:43,242 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 08:48:43,242 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-25 08:48:43,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:44,798 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-25 08:48:44,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:44,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:48:44,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:48:44,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:48:44,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:48:44,800 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2018-07-25 08:48:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:47,232 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:48:47,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:48:47,232 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2018-07-25 08:48:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:47,233 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:48:47,233 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:48:47,234 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:48:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:48:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:48:47,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:48:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:48:47,249 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 08:48:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:47,249 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:48:47,249 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:48:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:48:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:48:47,250 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:47,250 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 08:48:47,250 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-25 08:48:47,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:48,820 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-25 08:48:48,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:48,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:48:48,820 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:48:48,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:48:48,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:48:48,821 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-07-25 08:48:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:51,277 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:48:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:48:51,278 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-07-25 08:48:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:51,278 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:48:51,279 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:48:51,280 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=345, Invalid=13227, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:48:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:48:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:48:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:48:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:48:51,298 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 08:48:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:51,298 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:48:51,298 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:48:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:48:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:48:51,299 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:51,300 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 08:48:51,300 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-25 08:48:51,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:53,046 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-25 08:48:53,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:53,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:48:53,047 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:48:53,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:48:53,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:48:53,048 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2018-07-25 08:48:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:48:55,873 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:48:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:48:55,873 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2018-07-25 08:48:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:48:55,874 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:48:55,874 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:48:55,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:48:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:48:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:48:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:48:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:48:55,895 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 08:48:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:48:55,895 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:48:55,895 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:48:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:48:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:48:55,896 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:48:55,896 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 08:48:55,896 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:48:55,896 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-25 08:48:55,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:48:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:48:58,172 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-25 08:48:58,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:48:58,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:48:58,173 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:48:58,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:48:58,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:48:58,173 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-07-25 08:49:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:01,179 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:49:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:49:01,179 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-07-25 08:49:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:01,180 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:49:01,180 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:49:01,181 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=357, Invalid=14163, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:49:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:49:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:49:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:49:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:49:01,199 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 08:49:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:01,199 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:49:01,199 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:49:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:49:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:49:01,200 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:01,200 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 08:49:01,200 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-25 08:49:01,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:03,405 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-25 08:49:03,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:03,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:49:03,406 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:49:03,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:49:03,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:49:03,407 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2018-07-25 08:49:06,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:06,397 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:49:06,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:49:06,397 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2018-07-25 08:49:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:06,399 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:49:06,399 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:49:06,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:49:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:49:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:49:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:49:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:49:06,418 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 08:49:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:06,418 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:49:06,418 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:49:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:49:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:49:06,419 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:06,419 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 08:49:06,419 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:06,420 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-25 08:49:06,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:08,435 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-25 08:49:08,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:08,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:49:08,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:49:08,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:49:08,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:49:08,436 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-07-25 08:49:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:11,218 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:49:11,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:49:11,219 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-07-25 08:49:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:11,219 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:49:11,219 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:49:11,221 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=369, Invalid=15131, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:49:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:49:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:49:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:49:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:49:11,233 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 08:49:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:11,233 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:49:11,233 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:49:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:49:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:49:11,234 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:11,234 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 08:49:11,234 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-25 08:49:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:13,317 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-25 08:49:13,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:13,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:49:13,318 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:49:13,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:49:13,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:49:13,319 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2018-07-25 08:49:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:16,476 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:49:16,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:49:16,476 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2018-07-25 08:49:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:16,477 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:49:16,477 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:49:16,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:49:16,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:49:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:49:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:49:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:49:16,496 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 08:49:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:16,496 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:49:16,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:49:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:49:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:49:16,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:16,497 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 08:49:16,498 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-25 08:49:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:18,783 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-25 08:49:18,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:18,783 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:49:18,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:49:18,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:49:18,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:49:18,785 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-07-25 08:49:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:22,060 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:49:22,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:49:22,060 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-07-25 08:49:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:22,061 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:49:22,061 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:49:22,062 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=381, Invalid=16131, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:49:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:49:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:49:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:49:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:49:22,081 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 08:49:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:22,081 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:49:22,082 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:49:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:49:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:49:22,082 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:22,083 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 08:49:22,083 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:22,083 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-25 08:49:22,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:24,252 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-25 08:49:24,252 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:24,252 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:49:24,253 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:49:24,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:49:24,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:49:24,254 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2018-07-25 08:49:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:27,667 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:49:27,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:49:27,667 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2018-07-25 08:49:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:27,668 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:49:27,668 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:49:27,669 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:49:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:49:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:49:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:49:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:49:27,683 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 08:49:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:27,683 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:49:27,683 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:49:27,683 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:49:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:49:27,684 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:27,684 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 08:49:27,685 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:27,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-25 08:49:27,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:30,854 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-25 08:49:30,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:30,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:49:30,855 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:49:30,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:49:30,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:49:30,856 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-07-25 08:49:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:34,683 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:49:34,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:49:34,683 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-07-25 08:49:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:34,684 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:49:34,684 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:49:34,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=393, Invalid=17163, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:49:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:49:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:49:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:49:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:49:34,704 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 08:49:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:34,705 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:49:34,705 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:49:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:49:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:49:34,706 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:34,706 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 08:49:34,706 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:34,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-25 08:49:34,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:37,029 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-25 08:49:37,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:37,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:49:37,029 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:49:37,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:49:37,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:49:37,030 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2018-07-25 08:49:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:40,649 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:49:40,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:49:40,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2018-07-25 08:49:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:40,650 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:49:40,650 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:49:40,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:49:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:49:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:49:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:49:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:49:40,670 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 08:49:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:40,670 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:49:40,670 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:49:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:49:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:49:40,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:40,671 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 08:49:40,672 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:40,672 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-25 08:49:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:43,307 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-25 08:49:43,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:43,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:49:43,308 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:49:43,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:49:43,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:49:43,309 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-07-25 08:49:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:47,131 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:49:47,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:49:47,131 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-07-25 08:49:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:47,132 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:49:47,132 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:49:47,134 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=405, Invalid=18227, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:49:47,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:49:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:49:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:49:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:49:47,148 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 08:49:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:47,148 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:49:47,149 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:49:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:49:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:49:47,150 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:47,150 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 08:49:47,150 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:47,150 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-25 08:49:47,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:49,522 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-25 08:49:49,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:49,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:49:49,523 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:49:49,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:49:49,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:49:49,524 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2018-07-25 08:49:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:53,092 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:49:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:49:53,093 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2018-07-25 08:49:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:53,093 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:49:53,094 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:49:53,094 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 08:49:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:49:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:49:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:49:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:49:53,108 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 08:49:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:53,108 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:49:53,108 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:49:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:49:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:49:53,109 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:53,109 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 08:49:53,109 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:53,109 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-25 08:49:53,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:56,796 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-25 08:49:56,797 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:56,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:49:56,797 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:49:56,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:49:56,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:49:56,798 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-07-25 08:50:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:00,730 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:50:00,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 08:50:00,730 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-07-25 08:50:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:00,731 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:50:00,731 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:50:00,732 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=417, Invalid=19323, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 08:50:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:50:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:50:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:50:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:50:00,746 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 08:50:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:00,746 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:50:00,746 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:50:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:50:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:50:00,746 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:00,747 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 08:50:00,747 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:00,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-25 08:50:00,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:03,416 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-25 08:50:03,417 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:03,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:50:03,417 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:50:03,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:50:03,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:50:03,418 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2018-07-25 08:50:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:07,478 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:50:07,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 08:50:07,478 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2018-07-25 08:50:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:07,479 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:50:07,479 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:50:07,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 08:50:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:50:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:50:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:50:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:50:07,500 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 08:50:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:07,501 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:50:07,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:50:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:50:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:50:07,502 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:07,502 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 08:50:07,502 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:07,502 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-25 08:50:07,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:11,329 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-25 08:50:11,329 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:11,329 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:50:11,330 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:50:11,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:50:11,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:50:11,330 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-07-25 08:50:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:15,453 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:50:15,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 08:50:15,454 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-07-25 08:50:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:15,454 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:50:15,455 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:50:15,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=429, Invalid=20451, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 08:50:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:50:15,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:50:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:50:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:50:15,471 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 08:50:15,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:15,471 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:50:15,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:50:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:50:15,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:50:15,471 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:15,472 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 08:50:15,472 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-25 08:50:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:18,047 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-25 08:50:18,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:18,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:50:18,048 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:50:18,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:50:18,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:50:18,049 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2018-07-25 08:50:21,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:21,958 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:50:21,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 08:50:21,958 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2018-07-25 08:50:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:21,959 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:50:21,959 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:50:21,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 08:50:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:50:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:50:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:50:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:50:21,976 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 08:50:21,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:21,976 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:50:21,976 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:50:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:50:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:50:21,977 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:21,977 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 08:50:21,977 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:21,978 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-25 08:50:21,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:26,246 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-25 08:50:26,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:26,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:50:26,247 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:50:26,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:50:26,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:50:26,248 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-07-25 08:50:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:30,765 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:50:30,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 08:50:30,765 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-07-25 08:50:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:30,766 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:50:30,766 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:50:30,767 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=441, Invalid=21611, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 08:50:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:50:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:50:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:50:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:50:30,787 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 08:50:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:30,787 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:50:30,788 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:50:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:50:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:50:30,788 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:30,789 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 08:50:30,789 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-25 08:50:30,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:33,522 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-25 08:50:33,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:33,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:50:33,523 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:50:33,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:50:33,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:50:33,524 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2018-07-25 08:50:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:37,617 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:50:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 08:50:37,617 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2018-07-25 08:50:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:37,618 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:50:37,618 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:50:37,619 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 08:50:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:50:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:50:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:50:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:50:37,635 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 08:50:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:37,636 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:50:37,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:50:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:50:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:50:37,637 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:37,637 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 08:50:37,637 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-25 08:50:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:40,892 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-25 08:50:40,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:40,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:50:40,893 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:50:40,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:50:40,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:50:40,894 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-07-25 08:50:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:45,420 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:50:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 08:50:45,420 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-07-25 08:50:45,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:45,421 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:50:45,421 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:50:45,422 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=453, Invalid=22803, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 08:50:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:50:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:50:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:50:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:50:45,436 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 08:50:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:45,436 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:50:45,437 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:50:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:50:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:50:45,437 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:45,437 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 08:50:45,437 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-25 08:50:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:48,534 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-25 08:50:48,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:48,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:50:48,535 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:50:48,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:50:48,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:50:48,536 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2018-07-25 08:50:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:50:53,185 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:50:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 08:50:53,185 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2018-07-25 08:50:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:50:53,186 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:50:53,186 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:50:53,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 08:50:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:50:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:50:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:50:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:50:53,202 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 08:50:53,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:50:53,202 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:50:53,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:50:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:50:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:50:53,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:50:53,203 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 08:50:53,203 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:50:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-25 08:50:53,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:50:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:50:56,295 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-25 08:50:56,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:50:56,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:50:56,296 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:50:56,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:50:56,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:50:56,296 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-07-25 08:51:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:51:00,680 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:51:00,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 08:51:00,680 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-07-25 08:51:00,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:51:00,681 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:51:00,681 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:51:00,682 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=465, Invalid=24027, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 08:51:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:51:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:51:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:51:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:51:00,697 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 08:51:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:51:00,697 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:51:00,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:51:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:51:00,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:51:00,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:51:00,698 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 08:51:00,699 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:51:00,699 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-25 08:51:00,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:51:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:51:03,670 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-25 08:51:03,671 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:51:03,671 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:51:03,671 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:51:03,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:51:03,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:51:03,672 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. Received shutdown request... [2018-07-25 08:51:07,153 WARN L177 SmtUtils]: Removed 1 from assertion stack [2018-07-25 08:51:07,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:51:07,154 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:51:07,159 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:51:07,159 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:51:07 BoogieIcfgContainer [2018-07-25 08:51:07,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:51:07,160 INFO L168 Benchmark]: Toolchain (without parser) took 250148.61 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -86.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-25 08:51:07,161 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-25 08:51:07,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.69 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-25 08:51:07,162 INFO L168 Benchmark]: Boogie Preprocessor took 47.67 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-25 08:51:07,163 INFO L168 Benchmark]: RCFGBuilder took 326.69 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-25 08:51:07,165 INFO L168 Benchmark]: TraceAbstraction took 249720.41 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -97.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-07-25 08:51:07,170 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 Procedure Inliner took 48.69 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 47.67 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 326.69 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 249720.41 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -97.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 101). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 122 states, 81 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 25. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 249.6s OverallTime, 78 OverallIterations, 78 TraceHistogramMax, 142.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 155 SDslu, 3081 SDs, 0 SdLazy, 329053 SolverSat, 2989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6391 GetRequests, 78 SyntacticMatches, 89 SemanticMatches, 6223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77908 ImplicationChecksByTransitivity, 155.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=77, 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: 1.0s AutomataMinimizationTime, 77 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 10.3s SatisfiabilityAnalysisTime, 92.1s InterpolantComputationTime, 6318 NumberOfCodeBlocks, 6318 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 6240 ConstructedInterpolants, 0 QuantifiedInterpolants, 21709101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 78 InterpolantComputations, 1 PerfectInterpolantSequences, 0/158158 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/linear_sea.ch.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-51-07-184.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/linear_sea.ch.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-51-07-184.csv Completed graceful shutdown