java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-ff8eab6 [2018-09-26 08:16:41,373 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:16:41,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:16:41,388 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:16:41,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:16:41,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:16:41,390 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:16:41,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:16:41,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:16:41,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:16:41,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:16:41,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:16:41,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:16:41,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:16:41,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:16:41,400 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:16:41,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:16:41,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:16:41,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:16:41,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:16:41,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:16:41,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:16:41,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:16:41,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:16:41,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:16:41,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:16:41,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:16:41,415 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:16:41,416 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:16:41,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:16:41,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:16:41,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:16:41,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:16:41,419 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:16:41,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:16:41,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:16:41,421 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:16:41,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:16:41,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:16:41,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:16:41,431 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:16:41,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:16:41,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:16:41,432 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:16:41,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:16:41,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:16:41,511 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:16:41,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:16:41,516 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:16:41,516 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:16:41,517 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-09-26 08:16:41,517 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_sea.ch.i_4.bpl' [2018-09-26 08:16:41,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:16:41,590 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:16:41,591 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:41,591 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:16:41,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:16:41,612 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,627 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:41,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:16:41,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:16:41,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:16:41,648 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,648 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,650 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,650 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,655 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,661 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,665 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:16:41,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:16:41,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:16:41,675 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:16:41,676 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 26.09 08:16:41" (1/1) ... [2018-09-26 08:16:41,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:16:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:16:42,087 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:16:42,088 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:42 BoogieIcfgContainer [2018-09-26 08:16:42,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:16:42,090 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:16:42,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:16:42,094 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:16:42,094 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 26.09 08:16:41" (1/2) ... [2018-09-26 08:16:42,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ca5179 and model type linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:16:42, skipping insertion in model container [2018-09-26 08:16:42,096 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 26.09 08:16:42" (2/2) ... [2018-09-26 08:16:42,099 INFO L112 eAbstractionObserver]: Analyzing ICFG linear_sea.ch.i_4.bpl [2018-09-26 08:16:42,109 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:16:42,121 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:16:42,168 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:16:42,169 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:16:42,169 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:16:42,169 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:16:42,169 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:16:42,170 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:16:42,170 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:16:42,170 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:16:42,170 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:16:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:16:42,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:16:42,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:42,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:16:42,196 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:42,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:16:42,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:42,575 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:16:42,575 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:16:42,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:16:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:16:42,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:16:42,607 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-09-26 08:16:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:42,795 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-09-26 08:16:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:16:42,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:16:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:42,809 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:16:42,810 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:16:42,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:16:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:16:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:16:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:16:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:16:42,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:16:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:42,863 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:16:42,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:16:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:16:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:16:42,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:42,864 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:16:42,865 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:42,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-26 08:16:42,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:43,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:43,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:43,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:43,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:43,049 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:16:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:43,231 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:16:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:16:43,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:16:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:43,232 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:16:43,232 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:16:43,236 INFO L605 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-09-26 08:16:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:16:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:16:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:16:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:16:43,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:16:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:43,242 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:16:43,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:16:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:16:43,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:43,244 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:16:43,244 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:43,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-26 08:16:43,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:43,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:43,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:43,480 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:43,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:43,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:43,483 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 08:16:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:43,670 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:16:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:16:43,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 08:16:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:43,671 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:16:43,671 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:16:43,672 INFO L605 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-09-26 08:16:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:16:43,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:16:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:16:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:16:43,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:16:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:43,681 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:16:43,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:16:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:16:43,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:43,683 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:16:43,683 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:43,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-26 08:16:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:43,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:43,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:16:43,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:16:43,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:16:43,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:16:43,866 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2018-09-26 08:16:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,053 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:16:44,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:16:44,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-09-26 08:16:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,054 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:16:44,054 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:16:44,055 INFO L605 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-09-26 08:16:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:16:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:16:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:16:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:16:44,070 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:16:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,071 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:16:44,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:16:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:16:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:16:44,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,076 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:16:44,076 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-26 08:16:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:44,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:44,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:16:44,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:16:44,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:16:44,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:44,320 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-26 08:16:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,570 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:16:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:16:44,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 08:16:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,572 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:16:44,572 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:16:44,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:16:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:16:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:16:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:16:44,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:16:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,582 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:16:44,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:16:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:16:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:16:44,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,585 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:16:44,585 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-26 08:16:44,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:44,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:44,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:16:44,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:16:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:16:44,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:44,828 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 9 states. [2018-09-26 08:16:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,092 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:16:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:16:45,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-09-26 08:16:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,094 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:16:45,094 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:16:45,095 INFO L605 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-09-26 08:16:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:16:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:16:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:16:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:16:45,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:16:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,102 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:16:45,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:16:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:16:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:16:45,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,103 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:16:45,104 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-26 08:16:45,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:45,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:45,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:16:45,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:16:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:16:45,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:45,378 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 08:16:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,703 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:16:45,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:16:45,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 08:16:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,705 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:16:45,706 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:16:45,707 INFO L605 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-09-26 08:16:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:16:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:16:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:16:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:16:45,720 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:16:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,721 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:16:45,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:16:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:16:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:16:45,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,723 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:16:45,723 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-09-26 08:16:45,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:16:46,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:16:46,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:16:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:46,137 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 11 states. [2018-09-26 08:16:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:46,563 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:16:46,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:16:46,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-09-26 08:16:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:46,566 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:16:46,566 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:16:46,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:16:46,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:16:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:16:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:16:46,578 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:16:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:46,579 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:16:46,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:16:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:16:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:16:46,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:46,580 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:16:46,581 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:46,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-09-26 08:16:46,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:16:46,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:16:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:16:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:46,939 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 08:16:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:47,353 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:16:47,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:16:47,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 08:16:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:47,355 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:16:47,355 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:16:47,357 INFO L605 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-09-26 08:16:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:16:47,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:16:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:16:47,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:16:47,372 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:16:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:47,377 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:16:47,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:16:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:16:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:16:47,378 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:47,378 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:16:47,378 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:47,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-09-26 08:16:47,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:47,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:47,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:16:47,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:16:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:16:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:47,771 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2018-09-26 08:16:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:48,223 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:16:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:16:48,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-09-26 08:16:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:48,225 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:16:48,225 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:16:48,226 INFO L605 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-09-26 08:16:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:16:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:16:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:16:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:16:48,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:16:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,237 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:16:48,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:16:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:16:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:16:48,239 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,239 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:16:48,240 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-09-26 08:16:48,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,720 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:16:48,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:16:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:16:48,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:48,722 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-26 08:16:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:49,334 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:16:49,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:16:49,335 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-26 08:16:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:49,335 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:16:49,336 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:16:49,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:16:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:16:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:16:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:16:49,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:16:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:49,352 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:16:49,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:16:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:16:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:16:49,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:49,356 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:16:49,356 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:49,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-09-26 08:16:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:49,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:49,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:16:49,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:16:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:16:49,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:49,763 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 15 states. [2018-09-26 08:16:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,293 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:16:50,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:16:50,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-09-26 08:16:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,296 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:16:50,296 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:16:50,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:16:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:16:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:16:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:16:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:16:50,310 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:16:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,311 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:16:50,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:16:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:16:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:16:50,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,312 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:16:50,313 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-09-26 08:16:50,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:50,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:50,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:16:50,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:16:50,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:16:50,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:50,794 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-26 08:16:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:51,392 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:16:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:16:51,392 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 08:16:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:51,393 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:16:51,393 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:16:51,394 INFO L605 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-09-26 08:16:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:16:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:16:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:16:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:16:51,411 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:16:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:51,411 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:16:51,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:16:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:16:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:16:51,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:51,416 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:16:51,416 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:51,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-09-26 08:16:51,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:51,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:51,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:16:51,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:16:51,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:16:51,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:51,891 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 17 states. [2018-09-26 08:16:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:52,618 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:16:52,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:16:52,618 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-09-26 08:16:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:52,619 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:16:52,619 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:16:52,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:52,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:16:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:16:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:16:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:16:52,634 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:16:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:52,635 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:16:52,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:16:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:16:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:16:52,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:52,636 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:16:52,636 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:52,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:52,637 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-09-26 08:16:52,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:53,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:53,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:16:53,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:16:53,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:16:53,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:53,338 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-26 08:16:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:54,033 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:16:54,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:16:54,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-26 08:16:54,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:54,034 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:16:54,034 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:16:54,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:16:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:16:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:16:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:16:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:16:54,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:16:54,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:54,048 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:16:54,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:16:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:16:54,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:16:54,050 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:54,050 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:16:54,050 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:54,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:54,052 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-09-26 08:16:54,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:54,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:54,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:16:54,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:16:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:16:54,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:54,536 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 19 states. [2018-09-26 08:16:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:55,177 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:16:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:16:55,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-09-26 08:16:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:55,179 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:16:55,179 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:16:55,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:16:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:16:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:16:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:16:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:16:55,191 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:16:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:55,192 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:16:55,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:16:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:16:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:16:55,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:55,193 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:16:55,193 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:55,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:55,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-09-26 08:16:55,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:56,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:56,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:16:56,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:16:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:16:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:56,073 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-26 08:16:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:56,812 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:16:56,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:16:56,813 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-26 08:16:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:56,813 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:16:56,814 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:16:56,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:16:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:16:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:16:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:16:56,835 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:16:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:56,837 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:16:56,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:16:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:16:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:16:56,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:56,843 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:16:56,843 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:56,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-09-26 08:16:56,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:57,348 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:57,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:57,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:16:57,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:16:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:16:57,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:57,350 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2018-09-26 08:16:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:58,058 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:16:58,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:16:58,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-09-26 08:16:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:58,059 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:16:58,059 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:16:58,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:16:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:16:58,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:16:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:16:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:16:58,077 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:16:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:58,077 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:16:58,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:16:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:16:58,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:16:58,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:58,079 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:16:58,079 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:58,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:58,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-09-26 08:16:58,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:58,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:58,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:16:58,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:16:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:16:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:58,882 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-26 08:16:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:59,685 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:16:59,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:16:59,686 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-26 08:16:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:59,687 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:16:59,687 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:16:59,689 INFO L605 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-09-26 08:16:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:16:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:16:59,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:16:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:16:59,702 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:16:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:59,702 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:16:59,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:16:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:16:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:16:59,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:59,706 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:16:59,706 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:59,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-09-26 08:16:59,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:00,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:00,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:17:00,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:17:00,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:17:00,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:17:00,209 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 23 states. [2018-09-26 08:17:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:00,958 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:17:00,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:17:00,958 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-09-26 08:17:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:00,959 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:17:00,959 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:17:00,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:17:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:17:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:17:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:17:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:17:00,972 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:17:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:00,972 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:17:00,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:17:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:17:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:17:00,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:00,973 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:17:00,974 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:00,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-09-26 08:17:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:01,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:01,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:17:01,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:17:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:17:01,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:17:01,795 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-26 08:17:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:02,723 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:17:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:17:02,723 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-26 08:17:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:02,724 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:17:02,724 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:17:02,726 INFO L605 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-09-26 08:17:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:17:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:17:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:17:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:17:02,741 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-09-26 08:17:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:02,741 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:17:02,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:17:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:17:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:17:02,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:02,747 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-09-26 08:17:02,747 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:02,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-09-26 08:17:02,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:03,257 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:03,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:03,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:17:03,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:17:03,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:17:03,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:17:03,259 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 25 states. [2018-09-26 08:17:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:04,048 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:17:04,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:17:04,049 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-09-26 08:17:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:04,049 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:17:04,049 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:17:04,053 INFO L605 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-09-26 08:17:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:17:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:17:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:17:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:17:04,065 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-09-26 08:17:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:04,065 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:17:04,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:17:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:17:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:17:04,066 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:04,066 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-09-26 08:17:04,067 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:04,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-09-26 08:17:04,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:04,675 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:04,675 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:17:04,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:17:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:17:04,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:17:04,676 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-26 08:17:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:05,496 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:17:05,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:17:05,497 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-26 08:17:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:05,498 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:17:05,498 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:17:05,500 INFO L605 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-09-26 08:17:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:17:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:17:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:17:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:17:05,518 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-09-26 08:17:05,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:05,519 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:17:05,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:17:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:17:05,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:17:05,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:05,524 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-09-26 08:17:05,525 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:05,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-09-26 08:17:05,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:06,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:06,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:17:06,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:17:06,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:17:06,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:17:06,131 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 27 states. [2018-09-26 08:17:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:06,971 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:17:06,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:17:06,971 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-09-26 08:17:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:06,972 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:17:06,972 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:17:06,973 INFO L605 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-09-26 08:17:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:17:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:17:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:17:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:17:06,983 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-09-26 08:17:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:06,983 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:17:06,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:17:06,983 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:17:06,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:17:06,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:06,984 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-09-26 08:17:06,984 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:06,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:06,985 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-09-26 08:17:06,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:07,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:07,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:17:07,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:17:07,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:17:07,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:17:07,642 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-26 08:17:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:08,564 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:17:08,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:17:08,564 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-26 08:17:08,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:08,565 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:17:08,565 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:17:08,567 INFO L605 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-09-26 08:17:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:17:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:17:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:17:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:17:08,580 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-09-26 08:17:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:08,580 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:17:08,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:17:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:17:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:17:08,581 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:08,581 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-09-26 08:17:08,582 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:08,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-09-26 08:17:08,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:09,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:09,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:17:09,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:17:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:17:09,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:17:09,301 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 29 states. [2018-09-26 08:17:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:10,195 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:17:10,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:17:10,195 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-09-26 08:17:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:10,196 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:17:10,196 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:17:10,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:17:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:17:10,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:17:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:17:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:17:10,208 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-09-26 08:17:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:10,209 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:17:10,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:17:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:17:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:17:10,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:10,210 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-09-26 08:17:10,210 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:10,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-09-26 08:17:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:10,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:10,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:17:10,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:17:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:17:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:17:10,876 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-26 08:17:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:11,739 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:17:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:17:11,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-26 08:17:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:11,740 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:17:11,740 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:17:11,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=3027, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:17:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:17:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:17:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:17:11,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:17:11,753 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-09-26 08:17:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:11,753 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:17:11,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:17:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:17:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:17:11,754 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:11,754 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-09-26 08:17:11,754 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:11,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-09-26 08:17:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:12,350 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:12,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:17:12,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:17:12,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:17:12,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:17:12,351 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 31 states. [2018-09-26 08:17:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:13,161 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:17:13,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:17:13,162 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-09-26 08:17:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:13,162 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:17:13,162 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:17:13,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:17:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:17:13,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:17:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:17:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:17:13,173 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-09-26 08:17:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:13,173 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:17:13,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:17:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:17:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:17:13,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:13,173 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-09-26 08:17:13,174 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:13,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:13,174 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-09-26 08:17:13,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:13,781 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:13,781 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:13,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:17:13,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:17:13,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:17:13,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:17:13,782 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-26 08:17:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:14,861 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:17:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:17:14,861 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-26 08:17:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:14,862 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:17:14,862 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:17:14,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=3483, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:17:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:17:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:17:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:17:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:17:14,877 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-09-26 08:17:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:14,878 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:17:14,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:17:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:17:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:17:14,879 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:14,879 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-09-26 08:17:14,879 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:14,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-09-26 08:17:14,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:15,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:15,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:17:15,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:17:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:17:15,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:17:15,601 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 33 states. [2018-09-26 08:17:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:16,509 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:17:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:17:16,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-09-26 08:17:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:16,510 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:17:16,510 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:17:16,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:17:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:17:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:17:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:17:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:17:16,522 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-09-26 08:17:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:16,522 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:17:16,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:17:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:17:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:17:16,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:16,523 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-09-26 08:17:16,523 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:16,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-09-26 08:17:16,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:17,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:17,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:17:17,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:17:17,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:17:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:17:17,228 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-26 08:17:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:18,266 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:17:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:17:18,266 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-26 08:17:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:18,267 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:17:18,267 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:17:18,270 INFO L605 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-09-26 08:17:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:17:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:17:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:17:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:17:18,285 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-09-26 08:17:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:18,285 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:17:18,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:17:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:17:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:17:18,286 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:18,286 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-09-26 08:17:18,286 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:18,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-09-26 08:17:18,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:19,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:19,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:17:19,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:17:19,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:17:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:17:19,045 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 35 states. [2018-09-26 08:17:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,137 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:17:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:17:20,137 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-09-26 08:17:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,138 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:17:20,138 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:17:20,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:17:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:17:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:17:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:17:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:17:20,156 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-09-26 08:17:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,158 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:17:20,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:17:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:17:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:17:20,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,159 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-09-26 08:17:20,159 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,159 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-09-26 08:17:20,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:21,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:17:21,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:17:21,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:17:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:17:21,417 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-26 08:17:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:22,419 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:17:22,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:17:22,419 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-26 08:17:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:22,420 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:17:22,420 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:17:22,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=201, Invalid=4491, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:17:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:17:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:17:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:17:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:17:22,431 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-09-26 08:17:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:22,432 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:17:22,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:17:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:17:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:17:22,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:22,433 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-09-26 08:17:22,433 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:22,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-09-26 08:17:22,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:23,391 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:23,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:17:23,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:17:23,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:17:23,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:17:23,393 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 37 states. [2018-09-26 08:17:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:24,589 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:17:24,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:17:24,589 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-09-26 08:17:24,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:24,590 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:17:24,590 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:17:24,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:17:24,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:17:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:17:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:17:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:17:24,601 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-09-26 08:17:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:24,601 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:17:24,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:17:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:17:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:17:24,602 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:24,602 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-09-26 08:17:24,602 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:24,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-09-26 08:17:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:25,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:25,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:17:25,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:17:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:17:25,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:17:25,910 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-26 08:17:27,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:27,081 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:17:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:17:27,081 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-26 08:17:27,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:27,082 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:17:27,082 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:17:27,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=5043, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:17:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:17:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:17:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:17:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:17:27,091 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-09-26 08:17:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:27,091 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:17:27,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:17:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:17:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:17:27,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:27,092 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-09-26 08:17:27,093 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:27,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-09-26 08:17:27,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:28,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:28,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:17:28,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:17:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:17:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:17:28,146 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 39 states. [2018-09-26 08:17:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:29,350 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:17:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:17:29,351 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-09-26 08:17:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:29,351 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:17:29,351 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:17:29,352 INFO L605 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-09-26 08:17:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:17:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:17:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:17:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:17:29,360 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-09-26 08:17:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:29,360 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:17:29,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:17:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:17:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:17:29,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:29,361 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-09-26 08:17:29,361 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:29,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-09-26 08:17:29,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:30,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:30,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:17:30,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:17:30,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:17:30,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:17:30,150 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-26 08:17:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:31,288 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:17:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:17:31,289 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-26 08:17:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:31,289 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:17:31,290 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:17:31,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=225, Invalid=5627, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:17:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:17:31,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:17:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:17:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:17:31,300 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-09-26 08:17:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:31,301 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:17:31,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:17:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:17:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:17:31,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:31,302 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-09-26 08:17:31,302 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:31,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-09-26 08:17:31,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:32,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:32,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:17:32,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:17:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:17:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:17:32,355 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 41 states. [2018-09-26 08:17:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:33,528 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:17:33,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:17:33,528 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-09-26 08:17:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:33,529 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:17:33,529 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:17:33,530 INFO L605 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-09-26 08:17:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:17:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:17:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:17:33,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:17:33,543 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-09-26 08:17:33,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:33,543 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:17:33,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:17:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:17:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:17:33,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:33,544 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-09-26 08:17:33,544 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:33,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-09-26 08:17:33,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:34,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:34,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:17:34,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:17:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:17:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:17:34,974 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-26 08:17:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:36,246 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:17:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:17:36,246 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-26 08:17:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:36,247 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:17:36,247 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:17:36,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=237, Invalid=6243, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:17:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:17:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:17:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:17:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:17:36,261 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-09-26 08:17:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:36,261 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:17:36,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:17:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:17:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:17:36,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:36,263 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-09-26 08:17:36,263 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:36,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-09-26 08:17:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:37,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:17:37,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:17:37,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:17:37,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:17:37,083 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 43 states. [2018-09-26 08:17:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,330 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:17:38,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:17:38,330 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-09-26 08:17:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,331 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:17:38,331 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:17:38,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:17:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:17:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:17:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:17:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:17:38,339 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-09-26 08:17:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:38,339 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:17:38,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:17:38,340 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:17:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:17:38,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:38,340 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-09-26 08:17:38,341 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:38,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-09-26 08:17:38,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:39,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:39,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:17:39,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:17:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:17:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:17:39,698 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-26 08:17:41,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:41,218 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:17:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:17:41,218 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-26 08:17:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:41,219 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:17:41,219 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:17:41,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=249, Invalid=6891, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:17:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:17:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:17:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:17:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:17:41,231 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-09-26 08:17:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:41,232 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:17:41,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:17:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:17:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:17:41,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:41,232 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-09-26 08:17:41,233 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:41,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:41,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-09-26 08:17:41,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:42,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:42,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:17:42,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:17:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:17:42,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:17:42,189 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 45 states. [2018-09-26 08:17:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:43,715 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:17:43,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:17:43,716 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-09-26 08:17:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:43,716 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:17:43,717 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:17:43,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:17:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:17:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:17:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:17:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:17:43,728 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-09-26 08:17:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:43,729 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:17:43,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:17:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:17:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:17:43,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:43,730 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-09-26 08:17:43,730 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:43,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-09-26 08:17:43,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:45,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:45,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:17:45,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:17:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:17:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:17:45,258 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-26 08:17:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:46,814 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:17:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:17:46,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-26 08:17:46,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:46,815 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:17:46,815 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:17:46,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=261, Invalid=7571, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:17:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:17:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:17:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:17:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:17:46,836 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-09-26 08:17:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:46,836 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:17:46,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:17:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:17:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:17:46,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:46,837 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-09-26 08:17:46,838 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:46,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-09-26 08:17:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:47,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:47,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:47,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:17:47,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:17:47,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:17:47,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:17:47,849 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 47 states. [2018-09-26 08:17:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:49,359 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:17:49,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:17:49,359 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-09-26 08:17:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:49,360 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:17:49,360 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:17:49,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:17:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:17:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:17:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:17:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:17:49,372 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-09-26 08:17:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:49,372 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:17:49,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:17:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:17:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:17:49,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:49,373 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-09-26 08:17:49,374 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:49,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:49,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-09-26 08:17:49,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:50,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:50,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:17:50,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:17:50,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:17:50,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:17:50,500 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-26 08:17:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:52,073 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:17:52,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:17:52,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-26 08:17:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:52,074 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:17:52,074 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:17:52,074 INFO L605 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-09-26 08:17:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:17:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:17:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:17:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:17:52,085 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-09-26 08:17:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:52,086 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:17:52,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:17:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:17:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:17:52,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:52,087 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-09-26 08:17:52,087 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:52,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-09-26 08:17:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:53,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:53,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:17:53,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:17:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:17:53,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:17:53,097 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 49 states. [2018-09-26 08:17:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:54,709 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:17:54,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:17:54,710 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-09-26 08:17:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:54,710 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:17:54,711 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:17:54,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:17:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:17:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:17:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:17:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:17:54,722 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-09-26 08:17:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:54,722 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:17:54,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:17:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:17:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:17:54,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:54,722 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-09-26 08:17:54,723 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:54,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:54,723 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-09-26 08:17:54,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:56,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:56,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:17:56,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:17:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:17:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:17:56,053 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-26 08:17:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:57,838 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:17:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:17:57,838 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-26 08:17:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:57,839 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:17:57,839 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:17:57,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=285, Invalid=9027, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:17:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:17:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:17:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:17:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:17:57,851 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-09-26 08:17:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:57,852 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:17:57,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:17:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:17:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:17:57,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:57,853 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-09-26 08:17:57,853 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:57,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:57,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-09-26 08:17:57,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:58,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:58,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:58,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:17:58,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:17:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:17:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:17:58,974 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 51 states. [2018-09-26 08:18:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:00,686 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:18:00,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:18:00,686 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-09-26 08:18:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:00,687 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:18:00,687 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:18:00,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:18:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:18:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:18:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:18:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:18:00,700 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-09-26 08:18:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:00,701 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:18:00,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:18:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:18:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:18:00,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:00,701 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-09-26 08:18:00,701 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:00,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-09-26 08:18:00,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:01,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:01,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:18:01,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:18:01,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:18:01,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:18:01,931 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-26 08:18:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:03,825 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:18:03,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:18:03,826 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-26 08:18:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:03,826 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:18:03,826 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:18:03,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=297, Invalid=9803, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:18:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:18:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:18:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:18:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:18:03,840 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-09-26 08:18:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:03,841 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:18:03,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:18:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:18:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:18:03,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:03,841 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-09-26 08:18:03,842 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:03,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-09-26 08:18:03,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:04,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:04,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:18:04,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:18:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:18:05,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:18:05,000 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 53 states. [2018-09-26 08:18:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:06,859 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:18:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:18:06,859 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-09-26 08:18:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:06,860 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:18:06,860 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:18:06,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:18:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:18:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:18:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:18:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:18:06,871 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-09-26 08:18:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:06,871 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:18:06,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:18:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:18:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:18:06,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:06,872 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-09-26 08:18:06,872 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:06,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-09-26 08:18:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:08,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:08,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:18:08,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:18:08,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:18:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:18:08,388 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-26 08:18:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:10,213 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:18:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:18:10,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-26 08:18:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:10,214 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:18:10,215 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:18:10,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=309, Invalid=10611, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:18:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:18:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:18:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:18:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:18:10,229 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-09-26 08:18:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:10,229 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:18:10,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:18:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:18:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:18:10,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:10,230 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-09-26 08:18:10,230 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:10,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-09-26 08:18:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:11,522 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:11,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:18:11,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:18:11,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:18:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:18:11,524 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 55 states. [2018-09-26 08:18:13,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:13,568 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:18:13,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:18:13,569 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2018-09-26 08:18:13,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:13,569 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:18:13,570 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:18:13,571 INFO L605 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-09-26 08:18:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:18:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:18:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:18:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:18:13,582 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-09-26 08:18:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:13,582 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:18:13,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:18:13,582 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:18:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:18:13,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:13,583 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-09-26 08:18:13,583 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:13,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:13,583 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-09-26 08:18:13,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:14,984 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:14,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:18:14,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:18:14,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:18:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:18:14,985 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-26 08:18:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:17,054 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:18:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:18:17,055 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-26 08:18:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:17,056 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:18:17,056 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:18:17,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=321, Invalid=11451, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:18:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:18:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:18:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:18:17,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:18:17,073 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-09-26 08:18:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:17,073 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:18:17,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:18:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:18:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:18:17,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:17,074 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-09-26 08:18:17,074 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:17,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:17,074 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-09-26 08:18:17,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:18,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:18,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:18:18,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:18:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:18:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:18:18,450 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 57 states. [2018-09-26 08:18:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:20,578 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:18:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:18:20,578 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2018-09-26 08:18:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:20,579 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:18:20,579 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:18:20,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:18:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:18:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:18:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:18:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:18:20,590 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-09-26 08:18:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:20,590 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:18:20,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:18:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:18:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:18:20,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:20,591 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-09-26 08:18:20,591 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:20,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-09-26 08:18:20,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:22,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:22,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:18:22,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:18:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:18:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:18:22,234 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-26 08:18:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:24,747 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:18:24,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:18:24,747 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-26 08:18:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:24,748 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:18:24,748 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:18:24,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=333, Invalid=12323, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:18:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:18:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:18:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:18:24,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:18:24,762 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-09-26 08:18:24,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:24,763 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:18:24,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:18:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:18:24,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:18:24,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:24,763 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-09-26 08:18:24,764 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:24,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:24,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-09-26 08:18:24,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:26,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:26,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:18:26,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:18:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:18:26,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:18:26,334 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 59 states. [2018-09-26 08:18:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:28,859 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:18:28,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:18:28,859 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2018-09-26 08:18:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:28,859 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:18:28,860 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:18:28,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:18:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:18:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:18:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:18:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:18:28,876 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-09-26 08:18:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:28,876 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:18:28,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:18:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:18:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:18:28,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:28,877 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-09-26 08:18:28,877 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:28,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-09-26 08:18:28,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:30,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:30,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:18:30,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:18:30,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:18:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:18:30,598 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-26 08:18:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:33,215 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:18:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:18:33,215 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-26 08:18:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:33,216 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:18:33,216 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:18:33,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=345, Invalid=13227, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:18:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:18:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:18:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:18:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:18:33,234 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-09-26 08:18:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:33,234 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:18:33,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:18:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:18:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:18:33,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:33,235 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-09-26 08:18:33,236 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:33,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-09-26 08:18:33,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:34,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:34,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:18:34,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:18:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:18:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:18:34,902 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 61 states. [2018-09-26 08:18:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:37,384 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:18:37,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:18:37,384 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2018-09-26 08:18:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:37,385 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:18:37,385 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:18:37,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:18:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:18:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:18:37,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:18:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:18:37,406 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-09-26 08:18:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:37,406 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:18:37,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:18:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:18:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:18:37,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:37,407 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-09-26 08:18:37,407 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:37,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:37,408 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-09-26 08:18:37,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:39,848 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:39,848 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:18:39,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:18:39,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:18:39,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:18:39,849 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-26 08:18:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:42,623 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:18:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:18:42,623 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-26 08:18:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:42,624 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:18:42,624 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:18:42,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=357, Invalid=14163, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:18:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:18:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:18:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:18:42,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:18:42,643 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-09-26 08:18:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:42,643 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:18:42,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:18:42,643 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:18:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:18:42,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:42,644 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-09-26 08:18:42,644 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:42,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:42,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-09-26 08:18:42,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:44,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:44,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:18:44,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:18:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:18:44,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:18:44,466 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 63 states. [2018-09-26 08:18:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:47,054 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:18:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:18:47,054 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2018-09-26 08:18:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:47,055 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:18:47,055 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:18:47,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:18:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:18:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:18:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:18:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:18:47,067 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-09-26 08:18:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:47,067 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:18:47,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:18:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:18:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:18:47,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:47,068 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-09-26 08:18:47,068 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:47,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-09-26 08:18:47,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:48,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:48,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:18:48,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:18:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:18:48,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:18:48,893 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-26 08:18:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:51,581 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:18:51,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:18:51,582 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-26 08:18:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:51,582 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:18:51,582 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:18:51,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=369, Invalid=15131, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:18:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:18:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:18:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:18:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:18:51,595 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-09-26 08:18:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:51,595 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:18:51,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:18:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:18:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:18:51,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:51,596 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-09-26 08:18:51,597 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:51,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-09-26 08:18:51,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:53,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:53,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:18:53,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:18:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:18:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:18:53,521 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 65 states. [2018-09-26 08:18:56,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:56,697 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:18:56,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:18:56,697 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2018-09-26 08:18:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:56,698 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:18:56,698 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:18:56,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:18:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:18:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:18:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:18:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:18:56,718 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-09-26 08:18:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:56,718 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:18:56,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:18:56,718 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:18:56,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:18:56,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:56,719 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-09-26 08:18:56,719 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:56,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:56,720 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-09-26 08:18:56,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:59,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:59,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:18:59,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:18:59,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:18:59,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:18:59,021 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-26 08:19:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:02,243 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:19:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:19:02,243 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-26 08:19:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:02,244 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:19:02,244 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:19:02,245 INFO L605 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-09-26 08:19:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:19:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:19:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:19:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:19:02,263 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-09-26 08:19:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:02,263 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:19:02,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:19:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:19:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:19:02,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:02,264 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-09-26 08:19:02,264 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:02,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-09-26 08:19:02,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:04,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:04,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:19:04,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:19:04,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:19:04,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:19:04,285 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 67 states. [2018-09-26 08:19:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:07,113 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:19:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:19:07,113 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2018-09-26 08:19:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:07,114 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:19:07,114 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:19:07,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:19:07,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:19:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:19:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:19:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:19:07,127 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-09-26 08:19:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:07,127 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:19:07,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:19:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:19:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:19:07,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:07,128 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-09-26 08:19:07,128 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:07,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:07,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-09-26 08:19:07,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:10,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:10,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:19:10,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:19:10,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:19:10,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:19:10,111 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-26 08:19:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:13,584 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:19:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:19:13,584 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-26 08:19:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:13,585 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:19:13,585 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:19:13,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=393, Invalid=17163, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:19:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:19:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:19:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:19:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:19:13,604 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-09-26 08:19:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:13,604 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:19:13,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:19:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:19:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:19:13,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:13,606 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-09-26 08:19:13,606 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:13,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-09-26 08:19:13,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:15,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:15,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:19:15,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:19:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:19:15,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:19:15,944 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 69 states. [2018-09-26 08:19:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:19,181 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:19:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:19:19,181 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2018-09-26 08:19:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:19,182 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:19:19,182 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:19:19,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:19:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:19:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:19:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:19:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:19:19,202 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-09-26 08:19:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:19,202 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:19:19,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:19:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:19:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:19:19,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:19,203 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-09-26 08:19:19,203 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:19,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:19,203 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-09-26 08:19:19,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:21,561 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:21,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:19:21,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:19:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:19:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:19:21,562 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-26 08:19:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:24,980 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:19:24,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:19:24,980 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-26 08:19:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:24,981 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:19:24,981 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:19:24,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=405, Invalid=18227, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:19:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:19:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:19:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:19:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:19:24,996 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-09-26 08:19:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:24,997 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:19:24,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:19:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:19:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:19:24,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:24,997 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-09-26 08:19:24,998 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:24,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:24,998 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-09-26 08:19:24,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:27,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:27,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:19:27,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:19:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:19:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:19:27,516 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 71 states. [2018-09-26 08:19:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:31,414 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:19:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:19:31,414 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2018-09-26 08:19:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:31,415 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:19:31,415 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:19:31,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:19:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:19:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:19:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:19:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:19:31,430 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-09-26 08:19:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:31,430 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:19:31,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:19:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:19:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:19:31,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:31,431 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-09-26 08:19:31,431 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:31,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:31,432 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-09-26 08:19:31,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:35,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:35,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:19:35,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:19:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:19:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:19:35,143 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-26 08:19:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,073 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:19:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:19:39,073 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-26 08:19:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,074 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:19:39,074 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:19:39,075 INFO L605 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-09-26 08:19:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:19:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:19:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:19:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:19:39,089 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-09-26 08:19:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,089 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:19:39,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:19:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:19:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:19:39,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,090 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-09-26 08:19:39,090 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-09-26 08:19:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:41,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:41,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:19:41,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:19:41,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:19:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:19:41,445 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 73 states. [2018-09-26 08:19:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:45,184 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:19:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:19:45,184 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2018-09-26 08:19:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:45,185 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:19:45,185 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:19:45,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:19:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:19:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:19:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:19:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:19:45,201 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-09-26 08:19:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:45,201 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:19:45,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:19:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:19:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:19:45,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:45,202 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-09-26 08:19:45,202 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:45,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-09-26 08:19:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:49,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:49,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:19:49,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:19:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:19:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:19:49,023 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-26 08:19:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:53,142 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:19:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:19:53,142 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-26 08:19:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:53,142 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:19:53,143 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:19:53,143 INFO L605 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-09-26 08:19:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:19:53,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:19:53,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:19:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:19:53,158 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-09-26 08:19:53,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:53,158 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:19:53,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:19:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:19:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:19:53,159 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:53,159 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-09-26 08:19:53,159 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:53,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:53,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-09-26 08:19:53,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:19:55,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:19:55,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:19:55,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:19:55,967 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 75 states. [2018-09-26 08:20:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,218 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:20:00,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:20:00,219 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2018-09-26 08:20:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,219 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:20:00,220 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:20:00,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:20:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:20:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:20:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:20:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:20:00,241 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-09-26 08:20:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,241 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:20:00,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:20:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:20:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:20:00,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,243 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-09-26 08:20:00,243 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-09-26 08:20:00,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:04,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:04,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:20:04,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:20:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:20:04,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:20:04,004 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-26 08:20:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:08,351 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:20:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:20:08,352 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-26 08:20:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:08,352 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:20:08,353 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:20:08,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=441, Invalid=21611, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:20:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:20:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:20:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:20:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:20:08,369 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-09-26 08:20:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:08,369 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:20:08,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:20:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:20:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:20:08,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:08,370 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-09-26 08:20:08,370 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:08,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:08,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-09-26 08:20:08,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:11,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:11,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:20:11,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:20:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:20:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:20:11,279 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 77 states. [2018-09-26 08:20:15,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:15,783 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:20:15,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:20:15,783 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2018-09-26 08:20:15,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:15,784 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:20:15,784 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:20:15,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:20:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:20:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:20:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:20:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:20:15,800 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-09-26 08:20:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:15,800 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:20:15,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:20:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:20:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:20:15,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:15,801 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-09-26 08:20:15,801 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:15,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-09-26 08:20:15,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:18,713 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:20:18,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:20:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:20:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:20:18,714 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-26 08:20:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:22,665 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:20:22,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:20:22,666 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-26 08:20:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:22,666 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:20:22,667 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:20:22,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=453, Invalid=22803, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:20:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:20:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:20:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:20:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:20:22,681 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-09-26 08:20:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:22,681 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:20:22,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:20:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:20:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:20:22,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:22,682 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-09-26 08:20:22,682 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:22,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-09-26 08:20:22,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:25,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:20:25,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:20:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:20:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:20:25,578 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 79 states. [2018-09-26 08:20:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:30,450 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:20:30,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:20:30,451 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2018-09-26 08:20:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:30,451 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:20:30,451 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:20:30,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:20:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:20:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:20:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:20:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:20:30,467 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-09-26 08:20:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:30,467 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:20:30,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:20:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:20:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:20:30,468 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:30,468 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-09-26 08:20:30,468 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:30,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-09-26 08:20:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:33,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:20:33,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:20:33,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:20:33,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:20:33,530 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-26 08:20:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:38,016 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:20:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:20:38,016 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-26 08:20:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:38,017 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:20:38,017 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:20:38,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=465, Invalid=24027, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:20:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:20:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:20:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:20:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:20:38,033 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-09-26 08:20:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:38,034 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:20:38,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:20:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:20:38,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:20:38,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:38,035 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-09-26 08:20:38,035 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:38,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:38,035 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-09-26 08:20:38,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:41,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:41,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:20:41,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:20:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:20:41,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:20:41,096 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 81 states. [2018-09-26 08:20:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:45,603 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:20:45,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:20:45,603 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2018-09-26 08:20:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:45,604 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:20:45,604 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:20:45,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:20:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:20:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:20:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:20:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:20:45,621 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-09-26 08:20:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:45,621 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:20:45,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:20:45,621 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:20:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:20:45,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:45,622 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-09-26 08:20:45,622 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:45,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-09-26 08:20:45,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:20:48,827 WARN L186 SmtUtils]: Removed 4 from assertion stack [2018-09-26 08:20:48,828 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:20:48,831 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:20:48,832 INFO L202 PluginConnector]: Adding new model linear_sea.ch.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:20:48 BoogieIcfgContainer [2018-09-26 08:20:48,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:20:48,833 INFO L168 Benchmark]: Toolchain (without parser) took 247248.84 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 117.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-09-26 08:20:48,835 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-09-26 08:20:48,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.64 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-09-26 08:20:48,836 INFO L168 Benchmark]: Boogie Preprocessor took 31.43 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-09-26 08:20:48,836 INFO L168 Benchmark]: RCFGBuilder took 419.94 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-09-26 08:20:48,837 INFO L168 Benchmark]: TraceAbstraction took 246742.25 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 107.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-26 08:20:48,842 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.18 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 44.64 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 31.43 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 419.94 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 246742.25 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 107.3 MB). Peak memory consumption was 1.7 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 analyzing trace of length 161 with TraceHistMax 79, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 37. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 246.6s OverallTime, 79 OverallIterations, 79 TraceHistogramMax, 139.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 156 SDslu, 3160 SDs, 0 SdLazy, 331882 SolverSat, 3005 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6408 GetRequests, 78 SyntacticMatches, 89 SemanticMatches, 6241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79081 ImplicationChecksByTransitivity, 150.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=78, 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, 78 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 9.9s SatisfiabilityAnalysisTime, 89.4s InterpolantComputationTime, 6318 NumberOfCodeBlocks, 6318 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 6240 ConstructedInterpolants, 0 QuantifiedInterpolants, 20654256 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-09-26_08-20-48-861.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-09-26_08-20-48-861.csv Completed graceful shutdown