java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:33:16,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:33:16,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:33:16,628 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:33:16,628 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:33:16,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:33:16,631 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:33:16,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:33:16,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:33:16,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:33:16,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:33:16,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:33:16,649 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:33:16,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:33:16,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:33:16,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:33:16,652 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:33:16,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:33:16,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:33:16,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:33:16,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:33:16,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:33:16,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:33:16,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:33:16,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:33:16,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:33:16,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:33:16,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:33:16,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:33:16,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:33:16,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:33:16,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:33:16,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:33:16,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:33:16,668 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:33:16,669 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:33:16,669 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:33:16,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:33:16,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:33:16,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:33:16,687 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:33:16,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:33:16,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:33:16,688 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:33:16,688 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:33:16,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:33:16,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:33:16,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:33:16,751 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:33:16,751 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:33:16,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-07-23 15:33:16,752 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-07-23 15:33:16,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:33:16,810 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:33:16,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:33:16,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:33:16,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:33:16,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:33:16,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:33:16,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:33:16,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:33:16,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/1) ... [2018-07-23 15:33:16,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-23 15:33:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-07-23 15:33:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-07-23 15:33:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-23 15:33:17,116 INFO L258 CfgBuilder]: Using library mode [2018-07-23 15:33:17,117 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:33:17 BoogieIcfgContainer [2018-07-23 15:33:17,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:33:17,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:33:17,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:33:17,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:33:17,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:33:16" (1/2) ... [2018-07-23 15:33:17,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89ca944 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:33:17, skipping insertion in model container [2018-07-23 15:33:17,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:33:17" (2/2) ... [2018-07-23 15:33:17,126 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-07-23 15:33:17,137 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:33:17,145 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-07-23 15:33:17,194 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:33:17,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:33:17,195 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:33:17,195 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:33:17,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:33:17,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:33:17,196 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:33:17,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:33:17,196 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:33:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-07-23 15:33:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:33:17,221 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:17,222 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:33:17,222 INFO L414 AbstractCegarLoop]: === Iteration 1 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:17,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1762732, now seen corresponding path program 1 times [2018-07-23 15:33:17,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:17,350 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:33:17,350 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-07-23 15:33:17,355 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:33:17,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:33:17,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:33:17,376 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-07-23 15:33:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:17,427 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-07-23 15:33:17,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:33:17,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 15:33:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:17,444 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:33:17,445 INFO L226 Difference]: Without dead ends: 6 [2018-07-23 15:33:17,448 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:33:17,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-23 15:33:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-23 15:33:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-23 15:33:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-07-23 15:33:17,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-07-23 15:33:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:17,487 INFO L471 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-07-23 15:33:17,488 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:33:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-07-23 15:33:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:33:17,494 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:17,494 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:33:17,494 INFO L414 AbstractCegarLoop]: === Iteration 2 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1762733, now seen corresponding path program 1 times [2018-07-23 15:33:17,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:17,555 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:33:17,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:33:17,557 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:33:17,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:33:17,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:33:17,558 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-07-23 15:33:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:17,590 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-07-23 15:33:17,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:33:17,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-23 15:33:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:17,591 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:33:17,591 INFO L226 Difference]: Without dead ends: 10 [2018-07-23 15:33:17,595 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:33:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-23 15:33:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-07-23 15:33:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:33:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-07-23 15:33:17,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 4 [2018-07-23 15:33:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:17,607 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-07-23 15:33:17,607 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:33:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-07-23 15:33:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-23 15:33:17,608 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:17,608 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-07-23 15:33:17,609 INFO L414 AbstractCegarLoop]: === Iteration 3 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash 979785560, now seen corresponding path program 1 times [2018-07-23 15:33:17,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:17,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:17,640 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:33:17,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 15:33:17,641 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:33:17,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:33:17,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:33:17,642 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 3 states. [2018-07-23 15:33:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:17,656 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-07-23 15:33:17,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:33:17,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-07-23 15:33:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:17,657 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:33:17,658 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 15:33:17,658 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:33:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 15:33:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 15:33:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:33:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:33:17,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-23 15:33:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:17,663 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:33:17,664 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:33:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:33:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:33:17,664 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:17,664 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-07-23 15:33:17,665 INFO L414 AbstractCegarLoop]: === Iteration 4 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash 142791408, now seen corresponding path program 1 times [2018-07-23 15:33:17,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:17,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:17,724 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-07-23 15:33:17,725 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:33:17,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:33:17,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:33:17,727 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2018-07-23 15:33:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:17,762 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:33:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:33:17,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-23 15:33:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:17,763 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:33:17,764 INFO L226 Difference]: Without dead ends: 14 [2018-07-23 15:33:17,764 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:33:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-23 15:33:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-07-23 15:33:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:33:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:33:17,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-07-23 15:33:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:17,771 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:33:17,772 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:33:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:33:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:33:17,772 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:17,773 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-07-23 15:33:17,773 INFO L414 AbstractCegarLoop]: === Iteration 5 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1797495117, now seen corresponding path program 2 times [2018-07-23 15:33:17,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:17,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:17,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:33:17,885 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:33:17,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:33:17,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:33:17,886 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2018-07-23 15:33:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:17,941 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 15:33:17,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:33:17,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-07-23 15:33:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:17,943 INFO L225 Difference]: With dead ends: 19 [2018-07-23 15:33:17,943 INFO L226 Difference]: Without dead ends: 18 [2018-07-23 15:33:17,943 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:33:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-23 15:33:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-07-23 15:33:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:33:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:33:17,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-07-23 15:33:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:17,952 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:33:17,952 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:33:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:33:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:33:17,953 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:17,954 INFO L353 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-07-23 15:33:17,954 INFO L414 AbstractCegarLoop]: === Iteration 6 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:17,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1861247222, now seen corresponding path program 3 times [2018-07-23 15:33:17,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:18,055 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:18,056 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:33:18,056 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:33:18,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:33:18,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:33:18,057 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-07-23 15:33:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:18,095 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 15:33:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:33:18,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-07-23 15:33:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:18,097 INFO L225 Difference]: With dead ends: 23 [2018-07-23 15:33:18,097 INFO L226 Difference]: Without dead ends: 22 [2018-07-23 15:33:18,098 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:33:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-23 15:33:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-07-23 15:33:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 15:33:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 15:33:18,110 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-07-23 15:33:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:18,114 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 15:33:18,114 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:33:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 15:33:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:33:18,115 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:18,115 INFO L353 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-07-23 15:33:18,115 INFO L414 AbstractCegarLoop]: === Iteration 7 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash -836271687, now seen corresponding path program 4 times [2018-07-23 15:33:18,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:18,205 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:18,205 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:33:18,206 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:33:18,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:33:18,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:33:18,207 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-07-23 15:33:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:18,272 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 15:33:18,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:33:18,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-07-23 15:33:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:18,273 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:33:18,273 INFO L226 Difference]: Without dead ends: 26 [2018-07-23 15:33:18,274 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:33:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-23 15:33:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-07-23 15:33:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:33:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 15:33:18,286 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-07-23 15:33:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 15:33:18,286 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:33:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 15:33:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:33:18,288 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:18,288 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-07-23 15:33:18,288 INFO L414 AbstractCegarLoop]: === Iteration 8 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2020964100, now seen corresponding path program 5 times [2018-07-23 15:33:18,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:18,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:18,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:33:18,407 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:33:18,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:33:18,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:33:18,409 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 8 states. [2018-07-23 15:33:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:18,449 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 15:33:18,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:33:18,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-07-23 15:33:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:18,451 INFO L225 Difference]: With dead ends: 31 [2018-07-23 15:33:18,451 INFO L226 Difference]: Without dead ends: 30 [2018-07-23 15:33:18,452 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:33:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-23 15:33:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-07-23 15:33:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:33:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:33:18,464 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-07-23 15:33:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:18,465 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:33:18,465 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:33:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:33:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:33:18,466 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:18,466 INFO L353 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-07-23 15:33:18,467 INFO L414 AbstractCegarLoop]: === Iteration 9 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1036138175, now seen corresponding path program 6 times [2018-07-23 15:33:18,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:18,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:18,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:33:18,542 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:33:18,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:33:18,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:33:18,543 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2018-07-23 15:33:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:18,587 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 15:33:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:33:18,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-07-23 15:33:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:18,589 INFO L225 Difference]: With dead ends: 35 [2018-07-23 15:33:18,589 INFO L226 Difference]: Without dead ends: 34 [2018-07-23 15:33:18,590 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:33:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-23 15:33:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-07-23 15:33:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 15:33:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 15:33:18,602 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-07-23 15:33:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:18,603 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 15:33:18,603 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:33:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 15:33:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 15:33:18,604 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:18,605 INFO L353 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-07-23 15:33:18,605 INFO L414 AbstractCegarLoop]: === Iteration 10 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1860744446, now seen corresponding path program 7 times [2018-07-23 15:33:18,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:18,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:18,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:33:18,708 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:33:18,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:33:18,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:33:18,712 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 10 states. [2018-07-23 15:33:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:18,762 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 15:33:18,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:33:18,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-07-23 15:33:18,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:18,764 INFO L225 Difference]: With dead ends: 39 [2018-07-23 15:33:18,764 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 15:33:18,765 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:33:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 15:33:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-07-23 15:33:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 15:33:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 15:33:18,787 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-07-23 15:33:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:18,787 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 15:33:18,787 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:33:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 15:33:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 15:33:18,789 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:18,789 INFO L353 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-07-23 15:33:18,789 INFO L414 AbstractCegarLoop]: === Iteration 11 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1332905413, now seen corresponding path program 8 times [2018-07-23 15:33:18,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:18,918 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:18,918 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:33:18,919 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:33:18,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:33:18,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:33:18,922 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-07-23 15:33:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:18,977 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 15:33:18,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:33:18,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-07-23 15:33:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:18,978 INFO L225 Difference]: With dead ends: 43 [2018-07-23 15:33:18,979 INFO L226 Difference]: Without dead ends: 42 [2018-07-23 15:33:18,979 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:33:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-23 15:33:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-07-23 15:33:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 15:33:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 15:33:19,001 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-07-23 15:33:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:19,001 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 15:33:19,003 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:33:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 15:33:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 15:33:19,004 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:19,006 INFO L353 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-07-23 15:33:19,006 INFO L414 AbstractCegarLoop]: === Iteration 12 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1537431800, now seen corresponding path program 9 times [2018-07-23 15:33:19,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:19,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:19,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:33:19,103 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:33:19,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:33:19,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:33:19,104 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2018-07-23 15:33:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:19,163 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 15:33:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:33:19,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-07-23 15:33:19,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:19,166 INFO L225 Difference]: With dead ends: 47 [2018-07-23 15:33:19,168 INFO L226 Difference]: Without dead ends: 46 [2018-07-23 15:33:19,169 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:33:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-23 15:33:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-07-23 15:33:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 15:33:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 15:33:19,188 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-07-23 15:33:19,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:19,188 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 15:33:19,189 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:33:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 15:33:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 15:33:19,193 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:19,193 INFO L353 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-07-23 15:33:19,193 INFO L414 AbstractCegarLoop]: === Iteration 13 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:19,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1224634059, now seen corresponding path program 10 times [2018-07-23 15:33:19,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:19,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:19,303 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:33:19,304 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:33:19,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:33:19,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:33:19,305 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 13 states. [2018-07-23 15:33:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:19,370 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 15:33:19,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:33:19,370 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-07-23 15:33:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:19,371 INFO L225 Difference]: With dead ends: 51 [2018-07-23 15:33:19,373 INFO L226 Difference]: Without dead ends: 50 [2018-07-23 15:33:19,374 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:33:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-23 15:33:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-07-23 15:33:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 15:33:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 15:33:19,392 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-07-23 15:33:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:19,393 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 15:33:19,393 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:33:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 15:33:19,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 15:33:19,394 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:19,396 INFO L353 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-07-23 15:33:19,396 INFO L414 AbstractCegarLoop]: === Iteration 14 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1272931058, now seen corresponding path program 11 times [2018-07-23 15:33:19,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:19,528 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:19,528 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:33:19,529 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:33:19,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:33:19,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:33:19,530 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 14 states. [2018-07-23 15:33:19,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:19,595 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 15:33:19,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:33:19,595 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-07-23 15:33:19,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:19,596 INFO L225 Difference]: With dead ends: 55 [2018-07-23 15:33:19,596 INFO L226 Difference]: Without dead ends: 54 [2018-07-23 15:33:19,597 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:33:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-23 15:33:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-07-23 15:33:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 15:33:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 15:33:19,628 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-07-23 15:33:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:19,628 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 15:33:19,628 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:33:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 15:33:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 15:33:19,630 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:19,630 INFO L353 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-07-23 15:33:19,632 INFO L414 AbstractCegarLoop]: === Iteration 15 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1244393937, now seen corresponding path program 12 times [2018-07-23 15:33:19,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:19,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:19,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:33:19,772 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:33:19,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:33:19,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:33:19,773 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 15 states. [2018-07-23 15:33:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:19,824 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 15:33:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:33:19,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-07-23 15:33:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:19,826 INFO L225 Difference]: With dead ends: 59 [2018-07-23 15:33:19,826 INFO L226 Difference]: Without dead ends: 58 [2018-07-23 15:33:19,826 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:33:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-23 15:33:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-07-23 15:33:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 15:33:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 15:33:19,843 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-07-23 15:33:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:19,844 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 15:33:19,844 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:33:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 15:33:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 15:33:19,850 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:19,850 INFO L353 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-07-23 15:33:19,851 INFO L414 AbstractCegarLoop]: === Iteration 16 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1926681324, now seen corresponding path program 13 times [2018-07-23 15:33:19,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:19,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:19,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:33:19,973 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:33:19,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:33:19,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:33:19,974 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 16 states. [2018-07-23 15:33:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:20,026 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 15:33:20,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:33:20,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-07-23 15:33:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:20,028 INFO L225 Difference]: With dead ends: 63 [2018-07-23 15:33:20,028 INFO L226 Difference]: Without dead ends: 62 [2018-07-23 15:33:20,029 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:33:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-23 15:33:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-07-23 15:33:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 15:33:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 15:33:20,046 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-07-23 15:33:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:20,046 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 15:33:20,046 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:33:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 15:33:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 15:33:20,047 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:20,047 INFO L353 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-07-23 15:33:20,048 INFO L414 AbstractCegarLoop]: === Iteration 17 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:20,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1287720663, now seen corresponding path program 14 times [2018-07-23 15:33:20,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:20,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:20,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:33:20,172 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:33:20,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:33:20,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:33:20,173 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 17 states. [2018-07-23 15:33:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:20,232 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 15:33:20,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:33:20,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-07-23 15:33:20,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:20,233 INFO L225 Difference]: With dead ends: 67 [2018-07-23 15:33:20,233 INFO L226 Difference]: Without dead ends: 66 [2018-07-23 15:33:20,234 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:33:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-23 15:33:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-07-23 15:33:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:33:20,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 15:33:20,256 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-07-23 15:33:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:20,257 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 15:33:20,257 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:33:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 15:33:20,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:33:20,258 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:20,258 INFO L353 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-07-23 15:33:20,258 INFO L414 AbstractCegarLoop]: === Iteration 18 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash -700688614, now seen corresponding path program 15 times [2018-07-23 15:33:20,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:20,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:20,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:33:20,443 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:33:20,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:33:20,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:33:20,444 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 18 states. [2018-07-23 15:33:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:20,512 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 15:33:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:33:20,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-07-23 15:33:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:20,514 INFO L225 Difference]: With dead ends: 71 [2018-07-23 15:33:20,514 INFO L226 Difference]: Without dead ends: 70 [2018-07-23 15:33:20,515 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:33:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-23 15:33:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-07-23 15:33:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 15:33:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 15:33:20,538 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-07-23 15:33:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:20,539 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 15:33:20,539 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:33:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 15:33:20,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:33:20,540 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:20,540 INFO L353 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-07-23 15:33:20,540 INFO L414 AbstractCegarLoop]: === Iteration 19 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:20,540 INFO L82 PathProgramCache]: Analyzing trace with hash 612615645, now seen corresponding path program 16 times [2018-07-23 15:33:20,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:20,705 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:20,705 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:33:20,706 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 15:33:20,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 15:33:20,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:33:20,707 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 19 states. [2018-07-23 15:33:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:20,780 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 15:33:20,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:33:20,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2018-07-23 15:33:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:20,782 INFO L225 Difference]: With dead ends: 75 [2018-07-23 15:33:20,782 INFO L226 Difference]: Without dead ends: 74 [2018-07-23 15:33:20,783 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:33:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-23 15:33:20,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-07-23 15:33:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 15:33:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 15:33:20,809 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-07-23 15:33:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:20,809 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 15:33:20,810 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 15:33:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 15:33:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 15:33:20,811 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:20,811 INFO L353 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-07-23 15:33:20,811 INFO L414 AbstractCegarLoop]: === Iteration 20 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash 270539552, now seen corresponding path program 17 times [2018-07-23 15:33:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:20,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:20,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 15:33:20,996 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 15:33:20,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 15:33:20,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:33:20,997 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 20 states. [2018-07-23 15:33:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:21,073 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 15:33:21,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:33:21,074 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2018-07-23 15:33:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:21,075 INFO L225 Difference]: With dead ends: 79 [2018-07-23 15:33:21,075 INFO L226 Difference]: Without dead ends: 78 [2018-07-23 15:33:21,076 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:33:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-23 15:33:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-07-23 15:33:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 15:33:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 15:33:21,106 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-07-23 15:33:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:21,106 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 15:33:21,106 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 15:33:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 15:33:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:33:21,107 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:21,107 INFO L353 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-07-23 15:33:21,108 INFO L414 AbstractCegarLoop]: === Iteration 21 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:21,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2134513379, now seen corresponding path program 18 times [2018-07-23 15:33:21,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:21,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:21,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 15:33:21,406 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 15:33:21,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 15:33:21,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:33:21,407 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 21 states. [2018-07-23 15:33:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:21,480 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 15:33:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:33:21,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-07-23 15:33:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:21,481 INFO L225 Difference]: With dead ends: 83 [2018-07-23 15:33:21,481 INFO L226 Difference]: Without dead ends: 82 [2018-07-23 15:33:21,482 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:33:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-23 15:33:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-07-23 15:33:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 15:33:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 15:33:21,513 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-07-23 15:33:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:21,513 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 15:33:21,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 15:33:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 15:33:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 15:33:21,514 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:21,514 INFO L353 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-07-23 15:33:21,514 INFO L414 AbstractCegarLoop]: === Iteration 22 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1785038554, now seen corresponding path program 19 times [2018-07-23 15:33:21,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:21,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:21,697 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 15:33:21,698 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 15:33:21,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 15:33:21,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:33:21,700 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 22 states. [2018-07-23 15:33:21,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:21,774 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 15:33:21,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:33:21,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2018-07-23 15:33:21,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:21,775 INFO L225 Difference]: With dead ends: 87 [2018-07-23 15:33:21,776 INFO L226 Difference]: Without dead ends: 86 [2018-07-23 15:33:21,778 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:33:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-23 15:33:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-07-23 15:33:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 15:33:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 15:33:21,820 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-07-23 15:33:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:21,820 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 15:33:21,820 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 15:33:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 15:33:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 15:33:21,821 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:21,821 INFO L353 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-07-23 15:33:21,821 INFO L414 AbstractCegarLoop]: === Iteration 23 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash -458620439, now seen corresponding path program 20 times [2018-07-23 15:33:21,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:22,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:22,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 15:33:22,001 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 15:33:22,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 15:33:22,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:33:22,002 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 23 states. [2018-07-23 15:33:22,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:22,095 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 15:33:22,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:33:22,095 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 84 [2018-07-23 15:33:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:22,096 INFO L225 Difference]: With dead ends: 91 [2018-07-23 15:33:22,096 INFO L226 Difference]: Without dead ends: 90 [2018-07-23 15:33:22,097 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:33:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-23 15:33:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-07-23 15:33:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:33:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 15:33:22,123 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-07-23 15:33:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:22,123 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 15:33:22,123 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 15:33:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 15:33:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:33:22,124 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:22,124 INFO L353 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-07-23 15:33:22,125 INFO L414 AbstractCegarLoop]: === Iteration 24 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1687064276, now seen corresponding path program 21 times [2018-07-23 15:33:22,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:22,322 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:22,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 15:33:22,323 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 15:33:22,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 15:33:22,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:33:22,324 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 24 states. [2018-07-23 15:33:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:22,401 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 15:33:22,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:33:22,401 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2018-07-23 15:33:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:22,402 INFO L225 Difference]: With dead ends: 95 [2018-07-23 15:33:22,402 INFO L226 Difference]: Without dead ends: 94 [2018-07-23 15:33:22,403 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:33:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-23 15:33:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-07-23 15:33:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 15:33:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 15:33:22,429 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-07-23 15:33:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:22,430 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 15:33:22,430 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 15:33:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 15:33:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 15:33:22,431 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:22,431 INFO L353 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-07-23 15:33:22,431 INFO L414 AbstractCegarLoop]: === Iteration 25 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1231452433, now seen corresponding path program 22 times [2018-07-23 15:33:22,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:22,621 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:22,621 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 15:33:22,622 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 15:33:22,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 15:33:22,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:33:22,623 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 25 states. [2018-07-23 15:33:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:22,695 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 15:33:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:33:22,695 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 92 [2018-07-23 15:33:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:22,696 INFO L225 Difference]: With dead ends: 99 [2018-07-23 15:33:22,696 INFO L226 Difference]: Without dead ends: 98 [2018-07-23 15:33:22,697 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:33:22,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-23 15:33:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-07-23 15:33:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 15:33:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 15:33:22,727 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-07-23 15:33:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:22,727 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 15:33:22,728 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 15:33:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 15:33:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 15:33:22,729 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:22,729 INFO L353 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-07-23 15:33:22,729 INFO L414 AbstractCegarLoop]: === Iteration 26 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash 812319538, now seen corresponding path program 23 times [2018-07-23 15:33:22,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:22,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:22,923 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 15:33:22,924 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 15:33:22,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 15:33:22,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:33:22,925 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 26 states. [2018-07-23 15:33:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:23,008 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 15:33:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:33:23,009 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2018-07-23 15:33:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:23,010 INFO L225 Difference]: With dead ends: 103 [2018-07-23 15:33:23,010 INFO L226 Difference]: Without dead ends: 102 [2018-07-23 15:33:23,010 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:33:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-23 15:33:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-07-23 15:33:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 15:33:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 15:33:23,042 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-07-23 15:33:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:23,042 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 15:33:23,042 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 15:33:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 15:33:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 15:33:23,043 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:23,043 INFO L353 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-07-23 15:33:23,044 INFO L414 AbstractCegarLoop]: === Iteration 27 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:23,044 INFO L82 PathProgramCache]: Analyzing trace with hash 818849269, now seen corresponding path program 24 times [2018-07-23 15:33:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:23,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:23,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 15:33:23,288 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 15:33:23,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 15:33:23,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:33:23,289 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 27 states. [2018-07-23 15:33:23,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:23,371 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 15:33:23,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:33:23,371 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-07-23 15:33:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:23,372 INFO L225 Difference]: With dead ends: 107 [2018-07-23 15:33:23,372 INFO L226 Difference]: Without dead ends: 106 [2018-07-23 15:33:23,373 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:33:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-23 15:33:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-07-23 15:33:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 15:33:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 15:33:23,406 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-07-23 15:33:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:23,406 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 15:33:23,406 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 15:33:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 15:33:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 15:33:23,407 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:23,408 INFO L353 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-07-23 15:33:23,408 INFO L414 AbstractCegarLoop]: === Iteration 28 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1028468536, now seen corresponding path program 25 times [2018-07-23 15:33:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:23,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:23,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 15:33:23,665 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 15:33:23,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 15:33:23,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:33:23,667 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 28 states. [2018-07-23 15:33:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:23,767 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 15:33:23,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:33:23,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-07-23 15:33:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:23,769 INFO L225 Difference]: With dead ends: 111 [2018-07-23 15:33:23,769 INFO L226 Difference]: Without dead ends: 110 [2018-07-23 15:33:23,770 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:33:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-23 15:33:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-07-23 15:33:23,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 15:33:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-23 15:33:23,812 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-07-23 15:33:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:23,812 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-23 15:33:23,812 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 15:33:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-23 15:33:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 15:33:23,814 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:23,814 INFO L353 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-07-23 15:33:23,814 INFO L414 AbstractCegarLoop]: === Iteration 29 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:23,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1762615035, now seen corresponding path program 26 times [2018-07-23 15:33:23,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:24,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:24,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 15:33:24,141 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 15:33:24,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 15:33:24,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:33:24,142 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 29 states. [2018-07-23 15:33:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:24,243 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-23 15:33:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:33:24,244 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 108 [2018-07-23 15:33:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:24,245 INFO L225 Difference]: With dead ends: 115 [2018-07-23 15:33:24,245 INFO L226 Difference]: Without dead ends: 114 [2018-07-23 15:33:24,246 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:33:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-23 15:33:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-07-23 15:33:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 15:33:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 15:33:24,287 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-07-23 15:33:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:24,288 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 15:33:24,288 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 15:33:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 15:33:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 15:33:24,289 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:24,289 INFO L353 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-07-23 15:33:24,289 INFO L414 AbstractCegarLoop]: === Iteration 30 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:24,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2065828546, now seen corresponding path program 27 times [2018-07-23 15:33:24,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:24,536 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:24,536 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 15:33:24,537 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 15:33:24,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 15:33:24,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:33:24,538 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 30 states. [2018-07-23 15:33:24,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:24,646 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-23 15:33:24,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:33:24,646 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2018-07-23 15:33:24,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:24,647 INFO L225 Difference]: With dead ends: 119 [2018-07-23 15:33:24,648 INFO L226 Difference]: Without dead ends: 118 [2018-07-23 15:33:24,649 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:33:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-23 15:33:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-07-23 15:33:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 15:33:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-23 15:33:24,690 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-07-23 15:33:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:24,690 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-23 15:33:24,690 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 15:33:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-23 15:33:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 15:33:24,692 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:24,692 INFO L353 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-07-23 15:33:24,692 INFO L414 AbstractCegarLoop]: === Iteration 31 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1327608321, now seen corresponding path program 28 times [2018-07-23 15:33:24,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:24,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:24,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 15:33:24,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 15:33:24,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 15:33:24,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:33:24,958 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 31 states. [2018-07-23 15:33:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:25,063 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 15:33:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:33:25,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 116 [2018-07-23 15:33:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:25,064 INFO L225 Difference]: With dead ends: 123 [2018-07-23 15:33:25,064 INFO L226 Difference]: Without dead ends: 122 [2018-07-23 15:33:25,065 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:33:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-23 15:33:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-07-23 15:33:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 15:33:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-23 15:33:25,115 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-07-23 15:33:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:25,116 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-23 15:33:25,116 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 15:33:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-23 15:33:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 15:33:25,117 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:25,117 INFO L353 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-07-23 15:33:25,118 INFO L414 AbstractCegarLoop]: === Iteration 32 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:25,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1545382588, now seen corresponding path program 29 times [2018-07-23 15:33:25,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:25,416 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:25,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 15:33:25,417 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 15:33:25,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 15:33:25,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:33:25,421 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 32 states. [2018-07-23 15:33:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:25,537 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-23 15:33:25,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 15:33:25,537 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 120 [2018-07-23 15:33:25,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:25,538 INFO L225 Difference]: With dead ends: 127 [2018-07-23 15:33:25,538 INFO L226 Difference]: Without dead ends: 126 [2018-07-23 15:33:25,541 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:33:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-23 15:33:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-07-23 15:33:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 15:33:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 15:33:25,592 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-07-23 15:33:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:25,594 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 15:33:25,595 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 15:33:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 15:33:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 15:33:25,596 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:25,597 INFO L353 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-07-23 15:33:25,597 INFO L414 AbstractCegarLoop]: === Iteration 33 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:25,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1395941625, now seen corresponding path program 30 times [2018-07-23 15:33:25,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:25,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:25,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 15:33:25,898 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 15:33:25,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 15:33:25,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:33:25,901 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 33 states. [2018-07-23 15:33:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:26,017 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-23 15:33:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:33:26,017 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-07-23 15:33:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:26,018 INFO L225 Difference]: With dead ends: 131 [2018-07-23 15:33:26,019 INFO L226 Difference]: Without dead ends: 130 [2018-07-23 15:33:26,020 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:33:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-23 15:33:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-07-23 15:33:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 15:33:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-23 15:33:26,065 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-07-23 15:33:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:26,066 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-23 15:33:26,066 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 15:33:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-23 15:33:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 15:33:26,068 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:26,068 INFO L353 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-07-23 15:33:26,068 INFO L414 AbstractCegarLoop]: === Iteration 34 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash 287526730, now seen corresponding path program 31 times [2018-07-23 15:33:26,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:26,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:26,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 15:33:26,336 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 15:33:26,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 15:33:26,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:33:26,337 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 34 states. [2018-07-23 15:33:26,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:26,452 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 15:33:26,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:33:26,453 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2018-07-23 15:33:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:26,454 INFO L225 Difference]: With dead ends: 135 [2018-07-23 15:33:26,454 INFO L226 Difference]: Without dead ends: 134 [2018-07-23 15:33:26,455 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:33:26,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-23 15:33:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-07-23 15:33:26,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 15:33:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-23 15:33:26,504 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-07-23 15:33:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:26,504 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-23 15:33:26,505 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 15:33:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-23 15:33:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 15:33:26,506 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:26,506 INFO L353 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-07-23 15:33:26,506 INFO L414 AbstractCegarLoop]: === Iteration 35 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash 634594829, now seen corresponding path program 32 times [2018-07-23 15:33:26,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:26,839 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:26,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 15:33:26,840 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 15:33:26,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 15:33:26,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:33:26,842 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 35 states. [2018-07-23 15:33:26,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:26,969 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-23 15:33:26,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:33:26,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2018-07-23 15:33:26,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:26,970 INFO L225 Difference]: With dead ends: 139 [2018-07-23 15:33:26,971 INFO L226 Difference]: Without dead ends: 138 [2018-07-23 15:33:26,972 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:33:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-23 15:33:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-07-23 15:33:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:33:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 15:33:27,032 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-07-23 15:33:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:27,033 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 15:33:27,033 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 15:33:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 15:33:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 15:33:27,034 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:27,035 INFO L353 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-07-23 15:33:27,035 INFO L414 AbstractCegarLoop]: === Iteration 36 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash 493085520, now seen corresponding path program 33 times [2018-07-23 15:33:27,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:27,353 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:27,353 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 15:33:27,354 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 15:33:27,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 15:33:27,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:33:27,355 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 36 states. [2018-07-23 15:33:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:27,485 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-23 15:33:27,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:33:27,485 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2018-07-23 15:33:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:27,486 INFO L225 Difference]: With dead ends: 143 [2018-07-23 15:33:27,486 INFO L226 Difference]: Without dead ends: 142 [2018-07-23 15:33:27,488 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:33:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-23 15:33:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-07-23 15:33:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 15:33:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-23 15:33:27,541 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-07-23 15:33:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:27,541 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-23 15:33:27,541 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 15:33:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-23 15:33:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 15:33:27,543 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:27,543 INFO L353 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-07-23 15:33:27,543 INFO L414 AbstractCegarLoop]: === Iteration 37 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash 939411219, now seen corresponding path program 34 times [2018-07-23 15:33:27,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:27,828 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:27,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 15:33:27,828 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 15:33:27,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 15:33:27,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:33:27,831 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 37 states. [2018-07-23 15:33:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:27,953 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 15:33:27,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:33:27,954 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2018-07-23 15:33:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:27,955 INFO L225 Difference]: With dead ends: 147 [2018-07-23 15:33:27,955 INFO L226 Difference]: Without dead ends: 146 [2018-07-23 15:33:27,956 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:33:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-23 15:33:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-07-23 15:33:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 15:33:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-23 15:33:28,009 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-07-23 15:33:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:28,009 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-23 15:33:28,009 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 15:33:28,009 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-23 15:33:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 15:33:28,011 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:28,011 INFO L353 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-07-23 15:33:28,011 INFO L414 AbstractCegarLoop]: === Iteration 38 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:28,013 INFO L82 PathProgramCache]: Analyzing trace with hash -211087018, now seen corresponding path program 35 times [2018-07-23 15:33:28,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:28,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:28,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 15:33:28,299 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 15:33:28,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 15:33:28,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:33:28,300 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 38 states. [2018-07-23 15:33:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:28,427 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-23 15:33:28,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 15:33:28,428 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 144 [2018-07-23 15:33:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:28,429 INFO L225 Difference]: With dead ends: 151 [2018-07-23 15:33:28,429 INFO L226 Difference]: Without dead ends: 150 [2018-07-23 15:33:28,430 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:33:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-23 15:33:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-07-23 15:33:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 15:33:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 15:33:28,484 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-07-23 15:33:28,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:28,484 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 15:33:28,484 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 15:33:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 15:33:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 15:33:28,486 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:28,486 INFO L353 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-07-23 15:33:28,486 INFO L414 AbstractCegarLoop]: === Iteration 39 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash 991101465, now seen corresponding path program 36 times [2018-07-23 15:33:28,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:28,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:28,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 15:33:28,781 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 15:33:28,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 15:33:28,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:33:28,783 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 39 states. [2018-07-23 15:33:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:28,913 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-23 15:33:28,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:33:28,914 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2018-07-23 15:33:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:28,915 INFO L225 Difference]: With dead ends: 155 [2018-07-23 15:33:28,915 INFO L226 Difference]: Without dead ends: 154 [2018-07-23 15:33:28,916 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:33:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-23 15:33:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-07-23 15:33:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 15:33:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-23 15:33:28,970 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-07-23 15:33:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:28,970 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-23 15:33:28,970 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 15:33:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-23 15:33:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 15:33:28,972 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:28,972 INFO L353 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-07-23 15:33:28,972 INFO L414 AbstractCegarLoop]: === Iteration 40 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1744905892, now seen corresponding path program 37 times [2018-07-23 15:33:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:29,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 15:33:29,271 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 15:33:29,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 15:33:29,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:33:29,273 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 40 states. [2018-07-23 15:33:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,400 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 15:33:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:33:29,400 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-07-23 15:33:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,401 INFO L225 Difference]: With dead ends: 159 [2018-07-23 15:33:29,402 INFO L226 Difference]: Without dead ends: 158 [2018-07-23 15:33:29,403 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:33:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-23 15:33:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-07-23 15:33:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 15:33:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-23 15:33:29,458 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-07-23 15:33:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:29,458 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-23 15:33:29,459 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 15:33:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-23 15:33:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 15:33:29,460 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:29,460 INFO L353 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-07-23 15:33:29,460 INFO L414 AbstractCegarLoop]: === Iteration 41 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1624725279, now seen corresponding path program 38 times [2018-07-23 15:33:29,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:29,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:29,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 15:33:29,820 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 15:33:29,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 15:33:29,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:33:29,822 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 41 states. [2018-07-23 15:33:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:29,972 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-23 15:33:29,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 15:33:29,972 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 156 [2018-07-23 15:33:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:29,974 INFO L225 Difference]: With dead ends: 163 [2018-07-23 15:33:29,974 INFO L226 Difference]: Without dead ends: 162 [2018-07-23 15:33:29,975 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:33:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-23 15:33:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-07-23 15:33:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 15:33:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 15:33:30,048 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-07-23 15:33:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,048 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 15:33:30,048 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 15:33:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 15:33:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 15:33:30,050 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,050 INFO L353 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-07-23 15:33:30,050 INFO L414 AbstractCegarLoop]: === Iteration 42 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash -370853022, now seen corresponding path program 39 times [2018-07-23 15:33:30,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:30,490 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:30,490 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 15:33:30,491 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 15:33:30,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 15:33:30,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:33:30,492 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 42 states. [2018-07-23 15:33:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:30,636 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-23 15:33:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 15:33:30,637 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-07-23 15:33:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:30,638 INFO L225 Difference]: With dead ends: 167 [2018-07-23 15:33:30,638 INFO L226 Difference]: Without dead ends: 166 [2018-07-23 15:33:30,639 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:33:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-23 15:33:30,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-07-23 15:33:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 15:33:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-23 15:33:30,706 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-07-23 15:33:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:30,706 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-23 15:33:30,706 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 15:33:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-23 15:33:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 15:33:30,708 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:30,708 INFO L353 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-07-23 15:33:30,708 INFO L414 AbstractCegarLoop]: === Iteration 43 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1257159131, now seen corresponding path program 40 times [2018-07-23 15:33:30,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:31,067 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:31,067 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 15:33:31,067 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 15:33:31,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 15:33:31,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:33:31,069 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 43 states. [2018-07-23 15:33:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:31,209 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 15:33:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:33:31,209 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 164 [2018-07-23 15:33:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:31,210 INFO L225 Difference]: With dead ends: 171 [2018-07-23 15:33:31,211 INFO L226 Difference]: Without dead ends: 170 [2018-07-23 15:33:31,212 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:33:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-23 15:33:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-07-23 15:33:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 15:33:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-23 15:33:31,281 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-07-23 15:33:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:31,282 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-23 15:33:31,282 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 15:33:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-23 15:33:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 15:33:31,284 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:31,284 INFO L353 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-07-23 15:33:31,285 INFO L414 AbstractCegarLoop]: === Iteration 44 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1578879128, now seen corresponding path program 41 times [2018-07-23 15:33:31,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:31,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:31,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 15:33:31,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 15:33:31,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 15:33:31,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:33:31,645 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 44 states. [2018-07-23 15:33:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:31,794 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-23 15:33:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 15:33:31,794 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 168 [2018-07-23 15:33:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:31,796 INFO L225 Difference]: With dead ends: 175 [2018-07-23 15:33:31,796 INFO L226 Difference]: Without dead ends: 174 [2018-07-23 15:33:31,797 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:33:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-23 15:33:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-07-23 15:33:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 15:33:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 15:33:31,864 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-07-23 15:33:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:31,865 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 15:33:31,865 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 15:33:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 15:33:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 15:33:31,866 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:31,867 INFO L353 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-07-23 15:33:31,867 INFO L414 AbstractCegarLoop]: === Iteration 45 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:31,867 INFO L82 PathProgramCache]: Analyzing trace with hash 495374123, now seen corresponding path program 42 times [2018-07-23 15:33:31,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:32,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:32,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 15:33:32,207 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 15:33:32,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 15:33:32,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:33:32,209 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 45 states. [2018-07-23 15:33:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:32,351 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-23 15:33:32,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:33:32,351 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-07-23 15:33:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:32,352 INFO L225 Difference]: With dead ends: 179 [2018-07-23 15:33:32,352 INFO L226 Difference]: Without dead ends: 178 [2018-07-23 15:33:32,354 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:33:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-23 15:33:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-07-23 15:33:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 15:33:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-23 15:33:32,434 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-07-23 15:33:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:32,434 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-23 15:33:32,435 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 15:33:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-23 15:33:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 15:33:32,437 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:32,437 INFO L353 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-07-23 15:33:32,437 INFO L414 AbstractCegarLoop]: === Iteration 46 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1388432750, now seen corresponding path program 43 times [2018-07-23 15:33:32,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:32,843 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:32,843 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 15:33:32,844 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 15:33:32,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 15:33:32,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:33:32,845 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 46 states. [2018-07-23 15:33:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:32,990 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 15:33:32,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:33:32,991 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-07-23 15:33:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:32,992 INFO L225 Difference]: With dead ends: 183 [2018-07-23 15:33:32,992 INFO L226 Difference]: Without dead ends: 182 [2018-07-23 15:33:32,993 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:33:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-23 15:33:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-07-23 15:33:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 15:33:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-23 15:33:33,063 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-07-23 15:33:33,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:33,063 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-23 15:33:33,064 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 15:33:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-23 15:33:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 15:33:33,067 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:33,067 INFO L353 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-07-23 15:33:33,068 INFO L414 AbstractCegarLoop]: === Iteration 47 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:33,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814833, now seen corresponding path program 44 times [2018-07-23 15:33:33,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:33,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:33,405 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 15:33:33,406 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 15:33:33,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 15:33:33,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:33:33,407 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 47 states. [2018-07-23 15:33:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:33,556 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-23 15:33:33,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 15:33:33,557 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 180 [2018-07-23 15:33:33,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:33,558 INFO L225 Difference]: With dead ends: 187 [2018-07-23 15:33:33,558 INFO L226 Difference]: Without dead ends: 186 [2018-07-23 15:33:33,559 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:33:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-23 15:33:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-07-23 15:33:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:33:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 15:33:33,632 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-07-23 15:33:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:33,632 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 15:33:33,632 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 15:33:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 15:33:33,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 15:33:33,635 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:33,635 INFO L353 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-07-23 15:33:33,635 INFO L414 AbstractCegarLoop]: === Iteration 48 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1766063476, now seen corresponding path program 45 times [2018-07-23 15:33:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:33,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:33,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 15:33:33,999 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 15:33:34,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 15:33:34,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:33:34,000 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 48 states. [2018-07-23 15:33:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:34,166 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-23 15:33:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 15:33:34,167 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2018-07-23 15:33:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:34,168 INFO L225 Difference]: With dead ends: 191 [2018-07-23 15:33:34,172 INFO L226 Difference]: Without dead ends: 190 [2018-07-23 15:33:34,173 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:33:34,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-23 15:33:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-07-23 15:33:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 15:33:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-23 15:33:34,253 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-07-23 15:33:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:34,254 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-23 15:33:34,254 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 15:33:34,254 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-23 15:33:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 15:33:34,256 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:34,256 INFO L353 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-07-23 15:33:34,257 INFO L414 AbstractCegarLoop]: === Iteration 49 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:34,257 INFO L82 PathProgramCache]: Analyzing trace with hash 71085879, now seen corresponding path program 46 times [2018-07-23 15:33:34,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:34,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:34,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 15:33:34,623 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 15:33:34,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 15:33:34,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:33:34,625 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 49 states. [2018-07-23 15:33:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:34,793 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-23 15:33:34,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 15:33:34,793 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 188 [2018-07-23 15:33:34,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:34,795 INFO L225 Difference]: With dead ends: 195 [2018-07-23 15:33:34,795 INFO L226 Difference]: Without dead ends: 194 [2018-07-23 15:33:34,796 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:33:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-23 15:33:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-07-23 15:33:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 15:33:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-23 15:33:34,878 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-07-23 15:33:34,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:34,878 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-23 15:33:34,878 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 15:33:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-23 15:33:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 15:33:34,881 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:34,881 INFO L353 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-07-23 15:33:34,882 INFO L414 AbstractCegarLoop]: === Iteration 50 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:34,882 INFO L82 PathProgramCache]: Analyzing trace with hash 741394298, now seen corresponding path program 47 times [2018-07-23 15:33:34,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:35,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:35,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 15:33:35,294 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 15:33:35,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 15:33:35,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:33:35,295 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 50 states. [2018-07-23 15:33:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:35,482 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-23 15:33:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 15:33:35,482 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 192 [2018-07-23 15:33:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:35,483 INFO L225 Difference]: With dead ends: 199 [2018-07-23 15:33:35,484 INFO L226 Difference]: Without dead ends: 198 [2018-07-23 15:33:35,485 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:33:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-23 15:33:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-07-23 15:33:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 15:33:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-23 15:33:35,573 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-07-23 15:33:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:35,574 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-23 15:33:35,574 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 15:33:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-23 15:33:35,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 15:33:35,576 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:35,576 INFO L353 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-07-23 15:33:35,577 INFO L414 AbstractCegarLoop]: === Iteration 51 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:35,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1878456771, now seen corresponding path program 48 times [2018-07-23 15:33:35,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:36,071 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:36,072 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 15:33:36,072 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 15:33:36,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 15:33:36,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:33:36,074 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 51 states. [2018-07-23 15:33:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:36,255 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-23 15:33:36,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 15:33:36,255 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2018-07-23 15:33:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:36,257 INFO L225 Difference]: With dead ends: 203 [2018-07-23 15:33:36,257 INFO L226 Difference]: Without dead ends: 202 [2018-07-23 15:33:36,258 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:33:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-23 15:33:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-07-23 15:33:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 15:33:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-23 15:33:36,348 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-07-23 15:33:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:36,348 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-23 15:33:36,349 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 15:33:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-23 15:33:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 15:33:36,355 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:36,355 INFO L353 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-07-23 15:33:36,356 INFO L414 AbstractCegarLoop]: === Iteration 52 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1135727744, now seen corresponding path program 49 times [2018-07-23 15:33:36,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:36,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:36,792 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 15:33:36,792 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 15:33:36,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 15:33:36,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:33:36,794 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 52 states. [2018-07-23 15:33:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:37,014 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-23 15:33:37,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 15:33:37,015 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 200 [2018-07-23 15:33:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:37,016 INFO L225 Difference]: With dead ends: 207 [2018-07-23 15:33:37,017 INFO L226 Difference]: Without dead ends: 206 [2018-07-23 15:33:37,017 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:33:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-23 15:33:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-07-23 15:33:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-23 15:33:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-23 15:33:37,118 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-07-23 15:33:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:37,118 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-23 15:33:37,118 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 15:33:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-23 15:33:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 15:33:37,121 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:37,121 INFO L353 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-07-23 15:33:37,121 INFO L414 AbstractCegarLoop]: === Iteration 53 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:37,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1260975939, now seen corresponding path program 50 times [2018-07-23 15:33:37,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:37,581 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:37,581 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 15:33:37,581 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 15:33:37,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 15:33:37,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:33:37,583 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 53 states. [2018-07-23 15:33:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:37,800 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-23 15:33:37,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 15:33:37,801 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2018-07-23 15:33:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:37,803 INFO L225 Difference]: With dead ends: 211 [2018-07-23 15:33:37,803 INFO L226 Difference]: Without dead ends: 210 [2018-07-23 15:33:37,809 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:33:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-07-23 15:33:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-07-23 15:33:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-23 15:33:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-23 15:33:37,906 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-07-23 15:33:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:37,907 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-23 15:33:37,907 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 15:33:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-23 15:33:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 15:33:37,909 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:37,909 INFO L353 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-07-23 15:33:37,909 INFO L414 AbstractCegarLoop]: === Iteration 54 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash 341977478, now seen corresponding path program 51 times [2018-07-23 15:33:37,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:38,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:38,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 15:33:38,371 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 15:33:38,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 15:33:38,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:33:38,373 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 54 states. [2018-07-23 15:33:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:38,595 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-23 15:33:38,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:33:38,595 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 208 [2018-07-23 15:33:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:38,597 INFO L225 Difference]: With dead ends: 215 [2018-07-23 15:33:38,597 INFO L226 Difference]: Without dead ends: 214 [2018-07-23 15:33:38,598 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:33:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-23 15:33:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-07-23 15:33:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-23 15:33:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-23 15:33:38,712 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-07-23 15:33:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:38,713 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-23 15:33:38,713 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 15:33:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-23 15:33:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-23 15:33:38,716 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:38,716 INFO L353 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-07-23 15:33:38,716 INFO L414 AbstractCegarLoop]: === Iteration 55 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1566736969, now seen corresponding path program 52 times [2018-07-23 15:33:38,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:39,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:39,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 15:33:39,214 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 15:33:39,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 15:33:39,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:33:39,215 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 55 states. [2018-07-23 15:33:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:39,428 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-23 15:33:39,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 15:33:39,429 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 212 [2018-07-23 15:33:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:39,434 INFO L225 Difference]: With dead ends: 219 [2018-07-23 15:33:39,434 INFO L226 Difference]: Without dead ends: 218 [2018-07-23 15:33:39,435 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:33:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-07-23 15:33:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-07-23 15:33:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-23 15:33:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-23 15:33:39,533 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-07-23 15:33:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:39,534 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-23 15:33:39,534 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 15:33:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-23 15:33:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-23 15:33:39,536 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:39,536 INFO L353 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-07-23 15:33:39,537 INFO L414 AbstractCegarLoop]: === Iteration 56 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash 154321292, now seen corresponding path program 53 times [2018-07-23 15:33:39,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:39,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:39,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 15:33:39,945 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 15:33:39,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 15:33:39,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:33:39,946 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 56 states. [2018-07-23 15:33:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:40,168 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-23 15:33:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 15:33:40,169 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 216 [2018-07-23 15:33:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:40,170 INFO L225 Difference]: With dead ends: 223 [2018-07-23 15:33:40,170 INFO L226 Difference]: Without dead ends: 222 [2018-07-23 15:33:40,171 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:33:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-07-23 15:33:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-07-23 15:33:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 15:33:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-23 15:33:40,274 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-07-23 15:33:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:40,275 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-23 15:33:40,275 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 15:33:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-23 15:33:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 15:33:40,278 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:40,278 INFO L353 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-07-23 15:33:40,278 INFO L414 AbstractCegarLoop]: === Iteration 57 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:40,279 INFO L82 PathProgramCache]: Analyzing trace with hash -931420337, now seen corresponding path program 54 times [2018-07-23 15:33:40,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:40,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:40,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 15:33:40,726 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 15:33:40,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 15:33:40,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:33:40,727 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 57 states. [2018-07-23 15:33:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:40,980 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-23 15:33:40,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 15:33:40,981 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 220 [2018-07-23 15:33:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:40,982 INFO L225 Difference]: With dead ends: 227 [2018-07-23 15:33:40,983 INFO L226 Difference]: Without dead ends: 226 [2018-07-23 15:33:40,983 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:33:40,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-07-23 15:33:41,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-07-23 15:33:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 15:33:41,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-23 15:33:41,093 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-07-23 15:33:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:41,093 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-23 15:33:41,093 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 15:33:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-23 15:33:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-23 15:33:41,097 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:41,097 INFO L353 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-07-23 15:33:41,097 INFO L414 AbstractCegarLoop]: === Iteration 58 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1233515410, now seen corresponding path program 55 times [2018-07-23 15:33:41,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:41,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:41,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 15:33:41,623 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 15:33:41,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 15:33:41,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:33:41,625 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 58 states. [2018-07-23 15:33:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:41,920 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-23 15:33:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 15:33:41,920 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 224 [2018-07-23 15:33:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:41,922 INFO L225 Difference]: With dead ends: 231 [2018-07-23 15:33:41,922 INFO L226 Difference]: Without dead ends: 230 [2018-07-23 15:33:41,923 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:33:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-07-23 15:33:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-07-23 15:33:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-23 15:33:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-23 15:33:42,052 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-07-23 15:33:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:42,052 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-23 15:33:42,052 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 15:33:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-23 15:33:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-23 15:33:42,055 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:42,056 INFO L353 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-07-23 15:33:42,056 INFO L414 AbstractCegarLoop]: === Iteration 59 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1748657749, now seen corresponding path program 56 times [2018-07-23 15:33:42,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:42,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:42,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 15:33:42,629 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 15:33:42,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 15:33:42,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:33:42,631 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 59 states. [2018-07-23 15:33:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:42,883 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-23 15:33:42,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 15:33:42,883 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 228 [2018-07-23 15:33:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:42,885 INFO L225 Difference]: With dead ends: 235 [2018-07-23 15:33:42,885 INFO L226 Difference]: Without dead ends: 234 [2018-07-23 15:33:42,886 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:33:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-23 15:33:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-07-23 15:33:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 15:33:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-23 15:33:42,999 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-07-23 15:33:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:43,000 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-23 15:33:43,000 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 15:33:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-23 15:33:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 15:33:43,003 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:43,003 INFO L353 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-07-23 15:33:43,003 INFO L414 AbstractCegarLoop]: === Iteration 60 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1579270040, now seen corresponding path program 57 times [2018-07-23 15:33:43,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:43,457 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:43,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 15:33:43,458 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 15:33:43,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 15:33:43,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:33:43,459 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 60 states. [2018-07-23 15:33:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:43,718 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-23 15:33:43,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 15:33:43,719 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 232 [2018-07-23 15:33:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:43,720 INFO L225 Difference]: With dead ends: 239 [2018-07-23 15:33:43,721 INFO L226 Difference]: Without dead ends: 238 [2018-07-23 15:33:43,722 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:33:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-07-23 15:33:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-07-23 15:33:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-23 15:33:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-23 15:33:43,830 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-07-23 15:33:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:43,831 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-23 15:33:43,831 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 15:33:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-23 15:33:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-23 15:33:43,832 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:43,832 INFO L353 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-07-23 15:33:43,833 INFO L414 AbstractCegarLoop]: === Iteration 61 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash -228278437, now seen corresponding path program 58 times [2018-07-23 15:33:43,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:44,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:44,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 15:33:44,363 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 15:33:44,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 15:33:44,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:33:44,365 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 61 states. [2018-07-23 15:33:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:44,613 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-23 15:33:44,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 15:33:44,613 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 236 [2018-07-23 15:33:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:44,615 INFO L225 Difference]: With dead ends: 243 [2018-07-23 15:33:44,615 INFO L226 Difference]: Without dead ends: 242 [2018-07-23 15:33:44,615 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:33:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-07-23 15:33:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-07-23 15:33:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-23 15:33:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-23 15:33:44,710 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-07-23 15:33:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:44,711 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-23 15:33:44,711 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 15:33:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-23 15:33:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-23 15:33:44,712 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:44,712 INFO L353 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-07-23 15:33:44,712 INFO L414 AbstractCegarLoop]: === Iteration 62 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1446238818, now seen corresponding path program 59 times [2018-07-23 15:33:44,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:45,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:45,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 15:33:45,234 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 15:33:45,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 15:33:45,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:33:45,235 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 62 states. [2018-07-23 15:33:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:45,458 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-23 15:33:45,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 15:33:45,458 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 240 [2018-07-23 15:33:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:45,460 INFO L225 Difference]: With dead ends: 247 [2018-07-23 15:33:45,460 INFO L226 Difference]: Without dead ends: 246 [2018-07-23 15:33:45,461 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:33:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-07-23 15:33:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-07-23 15:33:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 15:33:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-23 15:33:45,568 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-07-23 15:33:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:45,569 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-23 15:33:45,569 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 15:33:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-23 15:33:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-23 15:33:45,570 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:45,570 INFO L353 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-07-23 15:33:45,571 INFO L414 AbstractCegarLoop]: === Iteration 63 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash -155143583, now seen corresponding path program 60 times [2018-07-23 15:33:45,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:46,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:46,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 15:33:46,044 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 15:33:46,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 15:33:46,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:33:46,045 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 63 states. [2018-07-23 15:33:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:46,329 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-23 15:33:46,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 15:33:46,329 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 244 [2018-07-23 15:33:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:46,331 INFO L225 Difference]: With dead ends: 251 [2018-07-23 15:33:46,331 INFO L226 Difference]: Without dead ends: 250 [2018-07-23 15:33:46,332 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:33:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-07-23 15:33:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-07-23 15:33:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-23 15:33:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-23 15:33:46,456 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-07-23 15:33:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-23 15:33:46,457 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 15:33:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-23 15:33:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-23 15:33:46,458 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:46,458 INFO L353 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-07-23 15:33:46,458 INFO L414 AbstractCegarLoop]: === Iteration 64 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:46,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1766532516, now seen corresponding path program 61 times [2018-07-23 15:33:46,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:46,862 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:46,862 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 15:33:46,863 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 15:33:46,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 15:33:46,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:33:46,866 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 64 states. [2018-07-23 15:33:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:47,170 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-23 15:33:47,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 15:33:47,170 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 248 [2018-07-23 15:33:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:47,172 INFO L225 Difference]: With dead ends: 255 [2018-07-23 15:33:47,172 INFO L226 Difference]: Without dead ends: 254 [2018-07-23 15:33:47,173 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:33:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-23 15:33:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-07-23 15:33:47,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-23 15:33:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-23 15:33:47,266 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-07-23 15:33:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:47,267 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-23 15:33:47,267 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 15:33:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-23 15:33:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-23 15:33:47,268 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:47,268 INFO L353 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-07-23 15:33:47,268 INFO L414 AbstractCegarLoop]: === Iteration 65 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -552321177, now seen corresponding path program 62 times [2018-07-23 15:33:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:47,685 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:47,685 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 15:33:47,686 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 15:33:47,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 15:33:47,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:33:47,686 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 65 states. [2018-07-23 15:33:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:47,925 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-23 15:33:47,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 15:33:47,926 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2018-07-23 15:33:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:47,927 INFO L225 Difference]: With dead ends: 259 [2018-07-23 15:33:47,928 INFO L226 Difference]: Without dead ends: 258 [2018-07-23 15:33:47,928 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:33:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-07-23 15:33:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-07-23 15:33:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-23 15:33:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-23 15:33:48,045 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-07-23 15:33:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:48,046 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-23 15:33:48,046 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 15:33:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-23 15:33:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-23 15:33:48,047 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:48,047 INFO L353 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-07-23 15:33:48,047 INFO L414 AbstractCegarLoop]: === Iteration 66 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1285242966, now seen corresponding path program 63 times [2018-07-23 15:33:48,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:48,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:48,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 15:33:48,725 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 15:33:48,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 15:33:48,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:33:48,726 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 66 states. [2018-07-23 15:33:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:48,936 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-23 15:33:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 15:33:48,936 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2018-07-23 15:33:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:48,938 INFO L225 Difference]: With dead ends: 263 [2018-07-23 15:33:48,938 INFO L226 Difference]: Without dead ends: 262 [2018-07-23 15:33:48,939 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:33:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-07-23 15:33:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-07-23 15:33:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-23 15:33:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-23 15:33:49,035 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-07-23 15:33:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:49,036 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-23 15:33:49,036 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 15:33:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-23 15:33:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-23 15:33:49,037 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:49,037 INFO L353 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-07-23 15:33:49,038 INFO L414 AbstractCegarLoop]: === Iteration 67 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash -282761619, now seen corresponding path program 64 times [2018-07-23 15:33:49,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:49,441 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:49,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 15:33:49,442 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 15:33:49,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 15:33:49,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:33:49,443 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 67 states. [2018-07-23 15:33:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:49,654 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-23 15:33:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 15:33:49,655 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 260 [2018-07-23 15:33:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:49,657 INFO L225 Difference]: With dead ends: 267 [2018-07-23 15:33:49,657 INFO L226 Difference]: Without dead ends: 266 [2018-07-23 15:33:49,657 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:33:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-07-23 15:33:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-07-23 15:33:49,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-23 15:33:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-23 15:33:49,769 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-07-23 15:33:49,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:49,770 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-23 15:33:49,770 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 15:33:49,770 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-23 15:33:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-23 15:33:49,771 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:49,772 INFO L353 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-07-23 15:33:49,772 INFO L414 AbstractCegarLoop]: === Iteration 68 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:49,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2027877296, now seen corresponding path program 65 times [2018-07-23 15:33:49,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:50,139 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:50,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 15:33:50,140 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 15:33:50,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 15:33:50,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:33:50,141 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 68 states. [2018-07-23 15:33:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:50,326 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-23 15:33:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 15:33:50,327 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 264 [2018-07-23 15:33:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:50,328 INFO L225 Difference]: With dead ends: 271 [2018-07-23 15:33:50,329 INFO L226 Difference]: Without dead ends: 270 [2018-07-23 15:33:50,329 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:33:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-07-23 15:33:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-07-23 15:33:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-23 15:33:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-23 15:33:50,418 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-07-23 15:33:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:50,419 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-23 15:33:50,419 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 15:33:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-23 15:33:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-23 15:33:50,420 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:50,420 INFO L353 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-07-23 15:33:50,420 INFO L414 AbstractCegarLoop]: === Iteration 69 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:50,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1153050483, now seen corresponding path program 66 times [2018-07-23 15:33:50,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:50,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:50,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 15:33:50,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 15:33:50,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 15:33:50,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:33:50,815 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 69 states. [2018-07-23 15:33:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:51,039 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-23 15:33:51,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 15:33:51,039 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2018-07-23 15:33:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:51,041 INFO L225 Difference]: With dead ends: 275 [2018-07-23 15:33:51,041 INFO L226 Difference]: Without dead ends: 274 [2018-07-23 15:33:51,041 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:33:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-07-23 15:33:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-07-23 15:33:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-23 15:33:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-23 15:33:51,142 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-07-23 15:33:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:51,143 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-23 15:33:51,143 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 15:33:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-23 15:33:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-23 15:33:51,144 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:51,144 INFO L353 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-07-23 15:33:51,144 INFO L414 AbstractCegarLoop]: === Iteration 70 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash -2072002122, now seen corresponding path program 67 times [2018-07-23 15:33:51,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:51,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:51,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:51,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 15:33:51,631 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 15:33:51,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 15:33:51,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:33:51,632 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 70 states. [2018-07-23 15:33:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:51,905 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-23 15:33:51,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 15:33:51,905 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 272 [2018-07-23 15:33:51,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:51,907 INFO L225 Difference]: With dead ends: 279 [2018-07-23 15:33:51,907 INFO L226 Difference]: Without dead ends: 278 [2018-07-23 15:33:51,908 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:33:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-07-23 15:33:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-07-23 15:33:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-23 15:33:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-23 15:33:52,007 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-07-23 15:33:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:52,007 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-23 15:33:52,007 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 15:33:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-23 15:33:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-23 15:33:52,009 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:52,009 INFO L353 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-07-23 15:33:52,009 INFO L414 AbstractCegarLoop]: === Iteration 71 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash -677870983, now seen corresponding path program 68 times [2018-07-23 15:33:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:52,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:52,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 15:33:52,624 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 15:33:52,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 15:33:52,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:33:52,625 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 71 states. [2018-07-23 15:33:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:52,854 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-23 15:33:52,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 15:33:52,854 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 276 [2018-07-23 15:33:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:52,855 INFO L225 Difference]: With dead ends: 283 [2018-07-23 15:33:52,855 INFO L226 Difference]: Without dead ends: 282 [2018-07-23 15:33:52,856 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:33:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-07-23 15:33:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-07-23 15:33:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-23 15:33:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-23 15:33:52,972 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-07-23 15:33:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:52,972 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-23 15:33:52,972 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 15:33:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-23 15:33:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-23 15:33:52,973 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:52,973 INFO L353 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-07-23 15:33:52,973 INFO L414 AbstractCegarLoop]: === Iteration 72 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2064460220, now seen corresponding path program 69 times [2018-07-23 15:33:52,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:53,426 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:53,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 15:33:53,427 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 15:33:53,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 15:33:53,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:33:53,428 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 72 states. [2018-07-23 15:33:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:53,659 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-23 15:33:53,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 15:33:53,659 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 280 [2018-07-23 15:33:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:53,661 INFO L225 Difference]: With dead ends: 287 [2018-07-23 15:33:53,661 INFO L226 Difference]: Without dead ends: 286 [2018-07-23 15:33:53,662 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:33:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-07-23 15:33:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-07-23 15:33:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-23 15:33:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-23 15:33:53,780 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-07-23 15:33:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:53,780 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-23 15:33:53,781 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 15:33:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-23 15:33:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-23 15:33:53,783 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:53,783 INFO L353 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-07-23 15:33:53,783 INFO L414 AbstractCegarLoop]: === Iteration 73 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2038855551, now seen corresponding path program 70 times [2018-07-23 15:33:53,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:54,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:54,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 15:33:54,288 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 15:33:54,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 15:33:54,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:33:54,289 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 73 states. [2018-07-23 15:33:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:54,531 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-23 15:33:54,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 15:33:54,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 284 [2018-07-23 15:33:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:54,533 INFO L225 Difference]: With dead ends: 291 [2018-07-23 15:33:54,533 INFO L226 Difference]: Without dead ends: 290 [2018-07-23 15:33:54,533 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:33:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-07-23 15:33:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-07-23 15:33:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-23 15:33:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-07-23 15:33:54,646 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-07-23 15:33:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:54,647 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-07-23 15:33:54,647 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 15:33:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-07-23 15:33:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-23 15:33:54,648 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:54,649 INFO L353 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-07-23 15:33:54,649 INFO L414 AbstractCegarLoop]: === Iteration 74 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:54,649 INFO L82 PathProgramCache]: Analyzing trace with hash -615699518, now seen corresponding path program 71 times [2018-07-23 15:33:54,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:55,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:55,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 15:33:55,171 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 15:33:55,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 15:33:55,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:33:55,172 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 74 states. [2018-07-23 15:33:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:55,366 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-23 15:33:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 15:33:55,366 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 288 [2018-07-23 15:33:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:55,368 INFO L225 Difference]: With dead ends: 295 [2018-07-23 15:33:55,368 INFO L226 Difference]: Without dead ends: 294 [2018-07-23 15:33:55,369 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:33:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-23 15:33:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-07-23 15:33:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-23 15:33:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-23 15:33:55,495 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-07-23 15:33:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:55,495 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-23 15:33:55,495 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 15:33:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-23 15:33:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-23 15:33:55,497 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:55,497 INFO L353 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-07-23 15:33:55,497 INFO L414 AbstractCegarLoop]: === Iteration 75 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:55,498 INFO L82 PathProgramCache]: Analyzing trace with hash -699791739, now seen corresponding path program 72 times [2018-07-23 15:33:55,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:55,959 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:55,959 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 15:33:55,959 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 15:33:55,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 15:33:55,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:33:55,960 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 75 states. [2018-07-23 15:33:56,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:56,293 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-23 15:33:56,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 15:33:56,293 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 292 [2018-07-23 15:33:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:56,294 INFO L225 Difference]: With dead ends: 299 [2018-07-23 15:33:56,295 INFO L226 Difference]: Without dead ends: 298 [2018-07-23 15:33:56,295 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:33:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-07-23 15:33:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-07-23 15:33:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-23 15:33:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-07-23 15:33:56,434 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-07-23 15:33:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:56,435 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-07-23 15:33:56,435 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 15:33:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-07-23 15:33:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-23 15:33:56,436 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:56,436 INFO L353 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-07-23 15:33:56,436 INFO L414 AbstractCegarLoop]: === Iteration 76 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:56,436 INFO L82 PathProgramCache]: Analyzing trace with hash -33175608, now seen corresponding path program 73 times [2018-07-23 15:33:56,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:56,940 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:56,940 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 15:33:56,940 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 15:33:56,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 15:33:56,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:33:56,942 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 76 states. [2018-07-23 15:33:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:57,214 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-23 15:33:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 15:33:57,214 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 296 [2018-07-23 15:33:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:57,216 INFO L225 Difference]: With dead ends: 303 [2018-07-23 15:33:57,216 INFO L226 Difference]: Without dead ends: 302 [2018-07-23 15:33:57,217 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:33:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-07-23 15:33:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-07-23 15:33:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-23 15:33:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-23 15:33:57,352 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-07-23 15:33:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:57,352 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-23 15:33:57,352 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 15:33:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-23 15:33:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-23 15:33:57,353 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:57,353 INFO L353 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-07-23 15:33:57,353 INFO L414 AbstractCegarLoop]: === Iteration 77 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1940467595, now seen corresponding path program 74 times [2018-07-23 15:33:57,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:57,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:57,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 15:33:57,847 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 15:33:57,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 15:33:57,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:33:57,848 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 77 states. [2018-07-23 15:33:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:58,140 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-23 15:33:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 15:33:58,140 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2018-07-23 15:33:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:58,142 INFO L225 Difference]: With dead ends: 307 [2018-07-23 15:33:58,142 INFO L226 Difference]: Without dead ends: 306 [2018-07-23 15:33:58,143 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:33:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-07-23 15:33:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-07-23 15:33:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-23 15:33:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-23 15:33:58,265 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-07-23 15:33:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:58,265 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-23 15:33:58,266 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 15:33:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-23 15:33:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-23 15:33:58,267 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:58,267 INFO L353 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-07-23 15:33:58,267 INFO L414 AbstractCegarLoop]: === Iteration 78 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:58,267 INFO L82 PathProgramCache]: Analyzing trace with hash 368901582, now seen corresponding path program 75 times [2018-07-23 15:33:58,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:58,768 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:58,768 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 15:33:58,768 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 15:33:58,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 15:33:58,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:33:58,769 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 78 states. [2018-07-23 15:33:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:33:59,064 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-23 15:33:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 15:33:59,064 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 304 [2018-07-23 15:33:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:33:59,066 INFO L225 Difference]: With dead ends: 311 [2018-07-23 15:33:59,066 INFO L226 Difference]: Without dead ends: 310 [2018-07-23 15:33:59,067 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:33:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-07-23 15:33:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-07-23 15:33:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-23 15:33:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-07-23 15:33:59,249 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-07-23 15:33:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:33:59,250 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-07-23 15:33:59,250 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 15:33:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-07-23 15:33:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-23 15:33:59,251 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:33:59,252 INFO L353 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-07-23 15:33:59,252 INFO L414 AbstractCegarLoop]: === Iteration 79 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:33:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1318456687, now seen corresponding path program 76 times [2018-07-23 15:33:59,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:33:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:33:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:33:59,805 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:33:59,805 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 15:33:59,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 15:33:59,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 15:33:59,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:33:59,807 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 79 states. [2018-07-23 15:34:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:00,103 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-23 15:34:00,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 15:34:00,103 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 308 [2018-07-23 15:34:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:00,105 INFO L225 Difference]: With dead ends: 315 [2018-07-23 15:34:00,105 INFO L226 Difference]: Without dead ends: 314 [2018-07-23 15:34:00,106 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:34:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-07-23 15:34:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-07-23 15:34:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-23 15:34:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-07-23 15:34:00,235 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2018-07-23 15:34:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:00,235 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-07-23 15:34:00,235 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 15:34:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-07-23 15:34:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-23 15:34:00,237 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:00,237 INFO L353 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2018-07-23 15:34:00,237 INFO L414 AbstractCegarLoop]: === Iteration 80 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash 804834772, now seen corresponding path program 77 times [2018-07-23 15:34:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:00,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:00,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 15:34:00,855 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 15:34:00,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 15:34:00,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:34:00,856 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 80 states. [2018-07-23 15:34:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:01,139 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-23 15:34:01,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 15:34:01,139 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 312 [2018-07-23 15:34:01,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:01,141 INFO L225 Difference]: With dead ends: 319 [2018-07-23 15:34:01,141 INFO L226 Difference]: Without dead ends: 318 [2018-07-23 15:34:01,142 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:34:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-07-23 15:34:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2018-07-23 15:34:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-23 15:34:01,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-07-23 15:34:01,258 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2018-07-23 15:34:01,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:01,258 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-07-23 15:34:01,258 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 15:34:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-07-23 15:34:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-23 15:34:01,259 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:01,260 INFO L353 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2018-07-23 15:34:01,260 INFO L414 AbstractCegarLoop]: === Iteration 81 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash -917352553, now seen corresponding path program 78 times [2018-07-23 15:34:01,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:01,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:01,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 15:34:01,831 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 15:34:01,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 15:34:01,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:34:01,832 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 81 states. [2018-07-23 15:34:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:02,097 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-23 15:34:02,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 15:34:02,098 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 316 [2018-07-23 15:34:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:02,099 INFO L225 Difference]: With dead ends: 323 [2018-07-23 15:34:02,099 INFO L226 Difference]: Without dead ends: 322 [2018-07-23 15:34:02,100 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:34:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-07-23 15:34:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2018-07-23 15:34:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-23 15:34:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-23 15:34:02,279 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2018-07-23 15:34:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:02,280 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-23 15:34:02,280 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 15:34:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-23 15:34:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-23 15:34:02,281 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:02,282 INFO L353 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2018-07-23 15:34:02,282 INFO L414 AbstractCegarLoop]: === Iteration 82 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash 851392474, now seen corresponding path program 79 times [2018-07-23 15:34:02,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:02,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:02,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 15:34:02,811 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 15:34:02,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 15:34:02,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:34:02,813 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 82 states. [2018-07-23 15:34:03,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:03,050 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-23 15:34:03,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 15:34:03,051 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 320 [2018-07-23 15:34:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:03,052 INFO L225 Difference]: With dead ends: 327 [2018-07-23 15:34:03,052 INFO L226 Difference]: Without dead ends: 326 [2018-07-23 15:34:03,053 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:34:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-07-23 15:34:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2018-07-23 15:34:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-23 15:34:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-07-23 15:34:03,211 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2018-07-23 15:34:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:03,212 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-07-23 15:34:03,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 15:34:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-07-23 15:34:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-23 15:34:03,214 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:03,214 INFO L353 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2018-07-23 15:34:03,214 INFO L414 AbstractCegarLoop]: === Iteration 83 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash -819444067, now seen corresponding path program 80 times [2018-07-23 15:34:03,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:03,886 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:03,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 15:34:03,886 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 15:34:03,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 15:34:03,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:34:03,887 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 83 states. [2018-07-23 15:34:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:04,214 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-07-23 15:34:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 15:34:04,214 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 324 [2018-07-23 15:34:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:04,216 INFO L225 Difference]: With dead ends: 331 [2018-07-23 15:34:04,216 INFO L226 Difference]: Without dead ends: 330 [2018-07-23 15:34:04,217 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:34:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-07-23 15:34:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2018-07-23 15:34:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-07-23 15:34:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-07-23 15:34:04,353 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2018-07-23 15:34:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:04,353 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-07-23 15:34:04,353 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 15:34:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-07-23 15:34:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-23 15:34:04,355 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:04,355 INFO L353 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2018-07-23 15:34:04,355 INFO L414 AbstractCegarLoop]: === Iteration 84 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash -552191008, now seen corresponding path program 81 times [2018-07-23 15:34:04,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:04,974 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:04,974 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 15:34:04,975 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 15:34:04,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 15:34:04,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:34:04,977 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 84 states. [2018-07-23 15:34:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:05,351 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-23 15:34:05,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 15:34:05,351 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 328 [2018-07-23 15:34:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:05,353 INFO L225 Difference]: With dead ends: 335 [2018-07-23 15:34:05,353 INFO L226 Difference]: Without dead ends: 334 [2018-07-23 15:34:05,354 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:34:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-07-23 15:34:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2018-07-23 15:34:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-07-23 15:34:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-07-23 15:34:05,541 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2018-07-23 15:34:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:05,541 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-07-23 15:34:05,541 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 15:34:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-07-23 15:34:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-23 15:34:05,542 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:05,543 INFO L353 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2018-07-23 15:34:05,543 INFO L414 AbstractCegarLoop]: === Iteration 85 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1330522205, now seen corresponding path program 82 times [2018-07-23 15:34:05,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:06,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:06,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 15:34:06,106 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 15:34:06,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 15:34:06,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:34:06,107 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 85 states. [2018-07-23 15:34:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:06,444 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-07-23 15:34:06,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 15:34:06,444 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 332 [2018-07-23 15:34:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:06,446 INFO L225 Difference]: With dead ends: 339 [2018-07-23 15:34:06,446 INFO L226 Difference]: Without dead ends: 338 [2018-07-23 15:34:06,447 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:34:06,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-07-23 15:34:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2018-07-23 15:34:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-23 15:34:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-07-23 15:34:06,692 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2018-07-23 15:34:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:06,693 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-07-23 15:34:06,693 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 15:34:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-07-23 15:34:06,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-23 15:34:06,695 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:06,695 INFO L353 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2018-07-23 15:34:06,695 INFO L414 AbstractCegarLoop]: === Iteration 86 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:06,695 INFO L82 PathProgramCache]: Analyzing trace with hash -809248282, now seen corresponding path program 83 times [2018-07-23 15:34:06,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:07,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:07,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 15:34:07,375 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 15:34:07,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 15:34:07,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:34:07,376 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 86 states. [2018-07-23 15:34:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:07,630 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-07-23 15:34:07,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 15:34:07,630 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 336 [2018-07-23 15:34:07,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:07,632 INFO L225 Difference]: With dead ends: 343 [2018-07-23 15:34:07,632 INFO L226 Difference]: Without dead ends: 342 [2018-07-23 15:34:07,633 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:34:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-07-23 15:34:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2018-07-23 15:34:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-23 15:34:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-07-23 15:34:07,779 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2018-07-23 15:34:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:07,780 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-07-23 15:34:07,780 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 15:34:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-07-23 15:34:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-23 15:34:07,782 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:07,782 INFO L353 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2018-07-23 15:34:07,782 INFO L414 AbstractCegarLoop]: === Iteration 87 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:07,783 INFO L82 PathProgramCache]: Analyzing trace with hash 901055145, now seen corresponding path program 84 times [2018-07-23 15:34:07,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:08,513 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:08,513 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 15:34:08,513 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 15:34:08,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 15:34:08,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:34:08,515 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 87 states. [2018-07-23 15:34:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:08,888 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-07-23 15:34:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 15:34:08,888 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 340 [2018-07-23 15:34:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:08,890 INFO L225 Difference]: With dead ends: 347 [2018-07-23 15:34:08,890 INFO L226 Difference]: Without dead ends: 346 [2018-07-23 15:34:08,890 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:34:08,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-07-23 15:34:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2018-07-23 15:34:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-07-23 15:34:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-07-23 15:34:09,028 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2018-07-23 15:34:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:09,028 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-07-23 15:34:09,028 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 15:34:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-07-23 15:34:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-07-23 15:34:09,029 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:09,030 INFO L353 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2018-07-23 15:34:09,030 INFO L414 AbstractCegarLoop]: === Iteration 88 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2039353836, now seen corresponding path program 85 times [2018-07-23 15:34:09,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:09,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:09,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 15:34:09,659 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 15:34:09,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 15:34:09,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:34:09,661 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 88 states. [2018-07-23 15:34:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:09,948 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-07-23 15:34:09,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 15:34:09,948 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 344 [2018-07-23 15:34:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:09,949 INFO L225 Difference]: With dead ends: 351 [2018-07-23 15:34:09,950 INFO L226 Difference]: Without dead ends: 350 [2018-07-23 15:34:09,950 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:34:09,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-07-23 15:34:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2018-07-23 15:34:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-07-23 15:34:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-07-23 15:34:10,119 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2018-07-23 15:34:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-07-23 15:34:10,120 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 15:34:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-07-23 15:34:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-07-23 15:34:10,121 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:10,121 INFO L353 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2018-07-23 15:34:10,121 INFO L414 AbstractCegarLoop]: === Iteration 89 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:10,121 INFO L82 PathProgramCache]: Analyzing trace with hash -538705, now seen corresponding path program 86 times [2018-07-23 15:34:10,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:10,752 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:10,752 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 15:34:10,753 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 15:34:10,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 15:34:10,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:34:10,754 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 89 states. [2018-07-23 15:34:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:11,132 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-07-23 15:34:11,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 15:34:11,133 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 348 [2018-07-23 15:34:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:11,134 INFO L225 Difference]: With dead ends: 355 [2018-07-23 15:34:11,134 INFO L226 Difference]: Without dead ends: 354 [2018-07-23 15:34:11,135 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:34:11,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-07-23 15:34:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2018-07-23 15:34:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-07-23 15:34:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-07-23 15:34:11,286 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2018-07-23 15:34:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:11,286 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-07-23 15:34:11,286 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 15:34:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-07-23 15:34:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-23 15:34:11,288 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:11,289 INFO L353 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2018-07-23 15:34:11,289 INFO L414 AbstractCegarLoop]: === Iteration 90 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:11,289 INFO L82 PathProgramCache]: Analyzing trace with hash 725279730, now seen corresponding path program 87 times [2018-07-23 15:34:11,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:12,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:12,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 15:34:12,209 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 15:34:12,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 15:34:12,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:34:12,210 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 90 states. [2018-07-23 15:34:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:12,562 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-07-23 15:34:12,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 15:34:12,562 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 352 [2018-07-23 15:34:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:12,563 INFO L225 Difference]: With dead ends: 359 [2018-07-23 15:34:12,563 INFO L226 Difference]: Without dead ends: 358 [2018-07-23 15:34:12,564 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:34:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-07-23 15:34:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2018-07-23 15:34:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-07-23 15:34:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-07-23 15:34:12,717 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2018-07-23 15:34:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:12,717 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-07-23 15:34:12,717 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 15:34:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-07-23 15:34:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-07-23 15:34:12,718 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:12,719 INFO L353 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2018-07-23 15:34:12,719 INFO L414 AbstractCegarLoop]: === Iteration 91 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1958730059, now seen corresponding path program 88 times [2018-07-23 15:34:12,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:13,378 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:13,378 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 15:34:13,378 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 15:34:13,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 15:34:13,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:34:13,380 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 91 states. [2018-07-23 15:34:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:13,701 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-07-23 15:34:13,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 15:34:13,702 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 356 [2018-07-23 15:34:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:13,703 INFO L225 Difference]: With dead ends: 363 [2018-07-23 15:34:13,703 INFO L226 Difference]: Without dead ends: 362 [2018-07-23 15:34:13,704 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:34:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-07-23 15:34:13,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2018-07-23 15:34:13,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-07-23 15:34:13,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-07-23 15:34:13,883 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2018-07-23 15:34:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:13,883 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-07-23 15:34:13,883 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 15:34:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-07-23 15:34:13,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-07-23 15:34:13,885 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:13,885 INFO L353 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2018-07-23 15:34:13,885 INFO L414 AbstractCegarLoop]: === Iteration 92 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:13,885 INFO L82 PathProgramCache]: Analyzing trace with hash 227561464, now seen corresponding path program 89 times [2018-07-23 15:34:13,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:14,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:14,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 15:34:14,543 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 15:34:14,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 15:34:14,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:34:14,544 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 92 states. [2018-07-23 15:34:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:14,868 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-07-23 15:34:14,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 15:34:14,869 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 360 [2018-07-23 15:34:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:14,870 INFO L225 Difference]: With dead ends: 367 [2018-07-23 15:34:14,870 INFO L226 Difference]: Without dead ends: 366 [2018-07-23 15:34:14,871 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:34:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-07-23 15:34:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2018-07-23 15:34:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-07-23 15:34:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-07-23 15:34:15,033 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2018-07-23 15:34:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:15,034 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-07-23 15:34:15,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 15:34:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-07-23 15:34:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-07-23 15:34:15,035 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:15,036 INFO L353 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2018-07-23 15:34:15,036 INFO L414 AbstractCegarLoop]: === Iteration 93 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:15,036 INFO L82 PathProgramCache]: Analyzing trace with hash 760487867, now seen corresponding path program 90 times [2018-07-23 15:34:15,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:15,791 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:15,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 15:34:15,792 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 15:34:15,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 15:34:15,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:34:15,793 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 93 states. [2018-07-23 15:34:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:16,211 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-07-23 15:34:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 15:34:16,211 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 364 [2018-07-23 15:34:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:16,212 INFO L225 Difference]: With dead ends: 371 [2018-07-23 15:34:16,213 INFO L226 Difference]: Without dead ends: 370 [2018-07-23 15:34:16,214 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:34:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-07-23 15:34:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2018-07-23 15:34:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-07-23 15:34:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-07-23 15:34:16,376 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2018-07-23 15:34:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:16,377 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-07-23 15:34:16,377 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 15:34:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-07-23 15:34:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-07-23 15:34:16,378 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:16,378 INFO L353 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2018-07-23 15:34:16,378 INFO L414 AbstractCegarLoop]: === Iteration 94 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 592729598, now seen corresponding path program 91 times [2018-07-23 15:34:16,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:17,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:17,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 15:34:17,257 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 15:34:17,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 15:34:17,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:34:17,258 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 94 states. [2018-07-23 15:34:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:17,672 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-07-23 15:34:17,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 15:34:17,673 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 368 [2018-07-23 15:34:17,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:17,674 INFO L225 Difference]: With dead ends: 375 [2018-07-23 15:34:17,674 INFO L226 Difference]: Without dead ends: 374 [2018-07-23 15:34:17,675 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:34:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-07-23 15:34:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-07-23 15:34:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-07-23 15:34:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-07-23 15:34:17,866 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2018-07-23 15:34:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:17,866 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-07-23 15:34:17,866 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 15:34:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-07-23 15:34:17,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-07-23 15:34:17,867 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:17,868 INFO L353 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2018-07-23 15:34:17,868 INFO L414 AbstractCegarLoop]: === Iteration 95 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash 368685761, now seen corresponding path program 92 times [2018-07-23 15:34:17,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:18,641 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:18,641 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 15:34:18,667 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 15:34:18,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 15:34:18,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:34:18,669 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 95 states. [2018-07-23 15:34:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:18,978 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-07-23 15:34:18,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 15:34:18,979 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 372 [2018-07-23 15:34:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:18,980 INFO L225 Difference]: With dead ends: 379 [2018-07-23 15:34:18,980 INFO L226 Difference]: Without dead ends: 378 [2018-07-23 15:34:18,981 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:34:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-07-23 15:34:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2018-07-23 15:34:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-07-23 15:34:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-07-23 15:34:19,148 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2018-07-23 15:34:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:19,148 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-07-23 15:34:19,148 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 15:34:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-07-23 15:34:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-07-23 15:34:19,150 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:19,150 INFO L353 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2018-07-23 15:34:19,150 INFO L414 AbstractCegarLoop]: === Iteration 96 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1229780484, now seen corresponding path program 93 times [2018-07-23 15:34:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:19,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:19,913 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 15:34:19,913 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 15:34:19,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 15:34:19,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:34:19,915 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 96 states. [2018-07-23 15:34:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:20,359 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-07-23 15:34:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 15:34:20,359 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 376 [2018-07-23 15:34:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:20,361 INFO L225 Difference]: With dead ends: 383 [2018-07-23 15:34:20,361 INFO L226 Difference]: Without dead ends: 382 [2018-07-23 15:34:20,362 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:34:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-07-23 15:34:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2018-07-23 15:34:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-23 15:34:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-07-23 15:34:20,543 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2018-07-23 15:34:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:20,543 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-07-23 15:34:20,544 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 15:34:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-07-23 15:34:20,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-07-23 15:34:20,545 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:20,545 INFO L353 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2018-07-23 15:34:20,546 INFO L414 AbstractCegarLoop]: === Iteration 97 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1324801991, now seen corresponding path program 94 times [2018-07-23 15:34:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:21,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:21,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 15:34:21,313 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 15:34:21,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 15:34:21,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:34:21,315 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 97 states. [2018-07-23 15:34:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:21,761 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-07-23 15:34:21,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 15:34:21,761 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 380 [2018-07-23 15:34:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:21,762 INFO L225 Difference]: With dead ends: 387 [2018-07-23 15:34:21,762 INFO L226 Difference]: Without dead ends: 386 [2018-07-23 15:34:21,763 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:34:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-07-23 15:34:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2018-07-23 15:34:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-07-23 15:34:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-07-23 15:34:21,940 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2018-07-23 15:34:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:21,941 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-07-23 15:34:21,941 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 15:34:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-07-23 15:34:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-07-23 15:34:21,942 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:21,942 INFO L353 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2018-07-23 15:34:21,943 INFO L414 AbstractCegarLoop]: === Iteration 98 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash 910176266, now seen corresponding path program 95 times [2018-07-23 15:34:21,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:23,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:23,004 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 15:34:23,005 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 15:34:23,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 15:34:23,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:34:23,006 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 98 states. [2018-07-23 15:34:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:23,371 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-07-23 15:34:23,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 15:34:23,371 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 384 [2018-07-23 15:34:23,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:23,372 INFO L225 Difference]: With dead ends: 391 [2018-07-23 15:34:23,373 INFO L226 Difference]: Without dead ends: 390 [2018-07-23 15:34:23,373 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:34:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-07-23 15:34:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2018-07-23 15:34:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-07-23 15:34:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-07-23 15:34:23,552 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2018-07-23 15:34:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:23,552 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-07-23 15:34:23,552 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 15:34:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-07-23 15:34:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-07-23 15:34:23,554 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:23,554 INFO L353 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2018-07-23 15:34:23,554 INFO L414 AbstractCegarLoop]: === Iteration 99 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1139693875, now seen corresponding path program 96 times [2018-07-23 15:34:23,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:24,344 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:24,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 15:34:24,345 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 15:34:24,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 15:34:24,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:34:24,346 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 99 states. [2018-07-23 15:34:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:24,709 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-07-23 15:34:24,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 15:34:24,709 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 388 [2018-07-23 15:34:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:24,710 INFO L225 Difference]: With dead ends: 395 [2018-07-23 15:34:24,711 INFO L226 Difference]: Without dead ends: 394 [2018-07-23 15:34:24,711 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:34:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-07-23 15:34:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2018-07-23 15:34:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-07-23 15:34:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-07-23 15:34:24,902 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2018-07-23 15:34:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:24,902 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-07-23 15:34:24,902 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 15:34:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-07-23 15:34:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-07-23 15:34:24,904 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:24,904 INFO L353 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2018-07-23 15:34:24,904 INFO L414 AbstractCegarLoop]: === Iteration 100 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2062812176, now seen corresponding path program 97 times [2018-07-23 15:34:24,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:25,765 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:25,765 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 15:34:25,766 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 15:34:25,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 15:34:25,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:34:25,768 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 100 states. [2018-07-23 15:34:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:26,203 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-07-23 15:34:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 15:34:26,204 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 392 [2018-07-23 15:34:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:26,205 INFO L225 Difference]: With dead ends: 399 [2018-07-23 15:34:26,205 INFO L226 Difference]: Without dead ends: 398 [2018-07-23 15:34:26,206 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:34:26,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-07-23 15:34:26,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2018-07-23 15:34:26,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-07-23 15:34:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-07-23 15:34:26,395 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2018-07-23 15:34:26,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:26,396 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-07-23 15:34:26,396 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 15:34:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-07-23 15:34:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-07-23 15:34:26,397 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:26,398 INFO L353 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2018-07-23 15:34:26,398 INFO L414 AbstractCegarLoop]: === Iteration 101 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash 454035411, now seen corresponding path program 98 times [2018-07-23 15:34:26,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:27,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:27,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 15:34:27,224 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 15:34:27,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 15:34:27,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:34:27,226 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 101 states. [2018-07-23 15:34:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:27,761 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-07-23 15:34:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 15:34:27,762 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 396 [2018-07-23 15:34:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:27,763 INFO L225 Difference]: With dead ends: 403 [2018-07-23 15:34:27,763 INFO L226 Difference]: Without dead ends: 402 [2018-07-23 15:34:27,765 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:34:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-07-23 15:34:27,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2018-07-23 15:34:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-07-23 15:34:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-07-23 15:34:27,962 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2018-07-23 15:34:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:27,962 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-07-23 15:34:27,962 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 15:34:27,962 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-07-23 15:34:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-07-23 15:34:27,964 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:27,964 INFO L353 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2018-07-23 15:34:27,964 INFO L414 AbstractCegarLoop]: === Iteration 102 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:27,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2110885354, now seen corresponding path program 99 times [2018-07-23 15:34:27,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:28,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:28,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 15:34:28,889 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 15:34:28,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 15:34:28,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:34:28,892 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 102 states. [2018-07-23 15:34:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:29,411 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2018-07-23 15:34:29,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 15:34:29,411 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 400 [2018-07-23 15:34:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:29,413 INFO L225 Difference]: With dead ends: 406 [2018-07-23 15:34:29,413 INFO L226 Difference]: Without dead ends: 405 [2018-07-23 15:34:29,414 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:34:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-07-23 15:34:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-07-23 15:34:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-07-23 15:34:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-07-23 15:34:29,614 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2018-07-23 15:34:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:29,614 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-07-23 15:34:29,614 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 15:34:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-07-23 15:34:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-07-23 15:34:29,616 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:34:29,616 INFO L353 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2018-07-23 15:34:29,616 INFO L414 AbstractCegarLoop]: === Iteration 103 === [mainErr0RequiresViolationPRE_CONDITION, mainErr1RequiresViolationPRE_CONDITION]=== [2018-07-23 15:34:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash 62391001, now seen corresponding path program 100 times [2018-07-23 15:34:29,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:34:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:34:30,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 15:34:30,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:34:30,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 15:34:30,925 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 15:34:30,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 15:34:30,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5155, Invalid=5557, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:34:30,930 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 104 states. [2018-07-23 15:34:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:34:31,743 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-07-23 15:34:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 15:34:31,743 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 404 [2018-07-23 15:34:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:34:31,744 INFO L225 Difference]: With dead ends: 408 [2018-07-23 15:34:31,744 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 15:34:31,747 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:34:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 15:34:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 15:34:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 15:34:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 15:34:31,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2018-07-23 15:34:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:34:31,748 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 15:34:31,748 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 15:34:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 15:34:31,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 15:34:31,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 15:34:44,212 WARN L169 SmtUtils]: Spent 12.27 s on a formula simplification. DAG size of input: 808 DAG size of output: 610 [2018-07-23 15:34:44,884 WARN L169 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 607 [2018-07-23 15:34:45,450 WARN L169 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 610 [2018-07-23 15:34:45,936 WARN L169 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 610 [2018-07-23 15:34:46,343 WARN L169 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 612 [2018-07-23 15:34:46,348 INFO L417 ceAbstractionStarter]: At program point mainErr1RequiresViolationPRE_CONDITION(lines 16 42) the Hoare annotation is: false [2018-07-23 15:34:46,348 INFO L421 ceAbstractionStarter]: For program point mainFINAL(lines 1 34) no Hoare annotation was computed. [2018-07-23 15:34:46,353 INFO L417 ceAbstractionStarter]: At program point L12(lines 12 31) the Hoare annotation is: (let ((.cse0 (select |#length| main_~q~1.base))) (let ((.cse2 (= 400 .cse0)) (.cse1 (select |#valid| main_~q~1.base))) (or (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ main_~q~1.offset 40) .cse0) .cse1) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) (<= (+ main_~q~1.offset 72) .cse0) .cse1) (and (<= (+ main_~q~1.offset 340) .cse0) (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 88) .cse0) (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 248) .cse0) .cse1 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 92) .cse0) (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 344) .cse0)) (and (<= (+ main_~q~1.offset 48) .cse0) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 312) .cse0) .cse1 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 268) .cse0)) (and (<= (+ main_~q~1.offset 296) .cse0) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 256) .cse0) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) (<= (+ main_~q~1.offset 244) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse0)) (and (<= (+ main_~q~1.offset 80) .cse0) (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 116) .cse0) (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 28) .cse0)) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) (<= (+ main_~q~1.offset 140) .cse0) .cse1) (and (<= (+ main_~q~1.offset 44) .cse0) .cse1 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 32) .cse0) (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 276) .cse0) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse1) (and (<= main_~q~1.offset 4) .cse2 (<= (+ main_~p~1.offset 4) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 84) .cse0) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse0) .cse1) (and (<= (+ main_~p~1.offset 216) main_~q~1.offset) (<= (+ main_~q~1.offset 184) .cse0) .cse1) (and (<= (+ main_~q~1.offset 300) .cse0) (<= (+ main_~p~1.offset 100) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 292) .cse0) .cse1 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 364) .cse0) (<= (+ main_~p~1.offset 36) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 384) .cse0) .cse1 (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 96) .cse0)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse0) .cse1) (and (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse0) .cse1) (and (<= (+ main_~p~1.offset 296) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 104) .cse0)) (and (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ main_~q~1.offset 120) .cse0) .cse1) (and (<= (+ main_~q~1.offset 128) .cse0) .cse1 (<= (+ main_~p~1.offset 272) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 328) .cse0)) (and (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 180) .cse0)) (and (<= (+ main_~q~1.offset 284) .cse0) (<= (+ main_~p~1.offset 116) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 148) .cse0) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 236) .cse0)) (and (<= (+ main_~q~1.offset 124) .cse0) (<= (+ main_~p~1.offset 276) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 264) .cse0) (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 304) .cse0) .cse1 (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 228) .cse0)) (and (<= (+ main_~q~1.offset 360) .cse0) .cse1 (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 220) .cse0)) (and (<= (+ main_~q~1.offset 152) .cse0) .cse1 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 68) .cse0) (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 192) .cse0) (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse0) .cse1) (and (<= (+ main_~q~1.offset 160) .cse0) (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 232) .cse0)) (and (<= (+ main_~q~1.offset 224) .cse0) (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 292) main_~q~1.offset) (<= (+ main_~q~1.offset 108) .cse0) .cse1) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) (<= (+ main_~q~1.offset 100) .cse0) .cse1) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 144) .cse0)) (and (<= (+ main_~q~1.offset 372) .cse0) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 376) .cse0) (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ main_~q~1.offset 8) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 112) main_~q~1.offset) (<= (+ main_~q~1.offset 288) .cse0)) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse0) .cse1) (and (<= (+ main_~q~1.offset 4) .cse0) (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 380) .cse0)) (and (<= (+ main_~q~1.offset 308) .cse0) (<= (+ main_~p~1.offset 92) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse0)) (and (<= (+ main_~q~1.offset 240) .cse0) (<= (+ main_~p~1.offset 160) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 200) .cse0) .cse1 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 324) .cse0) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 168) .cse0) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 204) .cse0) .cse1 (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 52) .cse0) .cse1 (<= (+ main_~p~1.offset 348) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse0) .cse1) (and (<= (+ main_~q~1.offset 112) .cse0) .cse1 (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse0)) (and (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 352) .cse0)) (and (<= (+ main_~q~1.offset 172) .cse0) (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 140) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 260) .cse0)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 392) .cse0)) (and (<= (+ main_~q~1.offset 272) .cse0) .cse1 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 52) main_~q~1.offset) (<= (+ main_~q~1.offset 348) .cse0)) (and (= main_~p~1.offset main_~q~1.offset) (<= main_~p~1.offset 0) .cse2 .cse1) (and (<= (+ main_~q~1.offset 212) .cse0) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 368) .cse0) (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 356) .cse0) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) (<= (+ main_~q~1.offset 20) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 400) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 164) .cse0) (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse0) .cse1) (and (<= (+ main_~q~1.offset 252) .cse0) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse0)) (and (<= (+ main_~q~1.offset 24) .cse0) (<= (+ main_~p~1.offset 376) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse0)) (and (<= (+ main_~q~1.offset 316) .cse0) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse0)) (and (<= (+ main_~q~1.offset 76) .cse0) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 16) .cse0)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 280) .cse0)) (and (<= (+ main_~p~1.offset 204) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 196) .cse0)) (and (<= (+ main_~q~1.offset 332) .cse0) .cse1 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) (<= (+ main_~q~1.offset 156) .cse0) .cse1) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 208) .cse0))))) [2018-07-23 15:34:46,354 INFO L421 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2018-07-23 15:34:46,354 INFO L417 ceAbstractionStarter]: At program point mainErr0RequiresViolationPRE_CONDITION(lines 16 41) the Hoare annotation is: false [2018-07-23 15:34:46,354 INFO L417 ceAbstractionStarter]: At program point mainEXIT(lines 1 34) the Hoare annotation is: (select |#valid| main_~q~1.base) [2018-07-23 15:34:46,354 INFO L424 ceAbstractionStarter]: At program point mainENTRY(lines 1 34) the Hoare annotation is: true [2018-07-23 15:34:46,358 INFO L417 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (let ((.cse0 (select |#length| main_~q~1.base))) (let ((.cse2 (= 400 .cse0)) (.cse1 (select |#valid| main_~q~1.base))) (or (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ main_~q~1.offset 40) .cse0) .cse1) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) (<= (+ main_~q~1.offset 72) .cse0) .cse1) (and (<= (+ main_~q~1.offset 340) .cse0) (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 88) .cse0) (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 248) .cse0) .cse1 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 92) .cse0) (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 344) .cse0)) (and (<= (+ main_~q~1.offset 48) .cse0) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 312) .cse0) .cse1 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 268) .cse0)) (and (<= (+ main_~q~1.offset 296) .cse0) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 256) .cse0) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) (<= (+ main_~q~1.offset 244) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse0)) (and (<= (+ main_~q~1.offset 80) .cse0) (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 116) .cse0) (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 28) .cse0)) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) (<= (+ main_~q~1.offset 140) .cse0) .cse1) (and (<= (+ main_~q~1.offset 44) .cse0) .cse1 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 32) .cse0) (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 276) .cse0) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse1) (and (<= main_~q~1.offset 4) .cse2 (<= (+ main_~p~1.offset 4) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 84) .cse0) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse0) .cse1) (and (<= (+ main_~p~1.offset 216) main_~q~1.offset) (<= (+ main_~q~1.offset 184) .cse0) .cse1) (and (<= (+ main_~q~1.offset 300) .cse0) (<= (+ main_~p~1.offset 100) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 292) .cse0) .cse1 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 364) .cse0) (<= (+ main_~p~1.offset 36) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 384) .cse0) .cse1 (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 96) .cse0)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse0) .cse1) (and (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse0) .cse1) (and (<= (+ main_~p~1.offset 296) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 104) .cse0)) (and (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ main_~q~1.offset 120) .cse0) .cse1) (and (<= (+ main_~q~1.offset 128) .cse0) .cse1 (<= (+ main_~p~1.offset 272) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 328) .cse0)) (and (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 180) .cse0)) (and (<= (+ main_~q~1.offset 284) .cse0) (<= (+ main_~p~1.offset 116) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 148) .cse0) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 236) .cse0)) (and (<= (+ main_~q~1.offset 124) .cse0) (<= (+ main_~p~1.offset 276) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 264) .cse0) (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 304) .cse0) .cse1 (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 228) .cse0)) (and (<= (+ main_~q~1.offset 360) .cse0) .cse1 (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 220) .cse0)) (and (<= (+ main_~q~1.offset 152) .cse0) .cse1 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 68) .cse0) (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 192) .cse0) (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse0) .cse1) (and (<= (+ main_~q~1.offset 160) .cse0) (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 232) .cse0)) (and (<= (+ main_~q~1.offset 224) .cse0) (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 292) main_~q~1.offset) (<= (+ main_~q~1.offset 108) .cse0) .cse1) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) (<= (+ main_~q~1.offset 100) .cse0) .cse1) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 144) .cse0)) (and (<= (+ main_~q~1.offset 372) .cse0) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 376) .cse0) (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ main_~q~1.offset 8) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 112) main_~q~1.offset) (<= (+ main_~q~1.offset 288) .cse0)) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse0) .cse1) (and (<= (+ main_~q~1.offset 4) .cse0) (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 380) .cse0)) (and (<= (+ main_~q~1.offset 308) .cse0) (<= (+ main_~p~1.offset 92) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse0)) (and (<= (+ main_~q~1.offset 240) .cse0) (<= (+ main_~p~1.offset 160) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 200) .cse0) .cse1 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 324) .cse0) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 168) .cse0) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 204) .cse0) .cse1 (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 52) .cse0) .cse1 (<= (+ main_~p~1.offset 348) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse0) .cse1) (and (<= (+ main_~q~1.offset 112) .cse0) .cse1 (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse0)) (and (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 352) .cse0)) (and (<= (+ main_~q~1.offset 172) .cse0) (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 140) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 260) .cse0)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 392) .cse0)) (and (<= (+ main_~q~1.offset 272) .cse0) .cse1 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 52) main_~q~1.offset) (<= (+ main_~q~1.offset 348) .cse0)) (and (= main_~p~1.offset main_~q~1.offset) (<= main_~p~1.offset 0) .cse2 .cse1) (and (<= (+ main_~q~1.offset 212) .cse0) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 368) .cse0) (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 356) .cse0) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) (<= (+ main_~q~1.offset 20) .cse0) .cse1) (and (<= (+ main_~q~1.offset 164) .cse0) (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse0) .cse1) (and (<= (+ main_~q~1.offset 252) .cse0) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse0)) (and (<= (+ main_~q~1.offset 24) .cse0) (<= (+ main_~p~1.offset 376) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse0)) (and (<= (+ main_~q~1.offset 316) .cse0) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse0)) (and (<= (+ main_~q~1.offset 76) .cse0) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 16) .cse0)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 280) .cse0)) (and (<= (+ main_~p~1.offset 204) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 196) .cse0)) (and (<= (+ main_~q~1.offset 332) .cse0) .cse1 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) (<= (+ main_~q~1.offset 156) .cse0) .cse1) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 208) .cse0))))) [2018-07-23 15:34:46,370 INFO L417 ceAbstractionStarter]: At program point L15(lines 15 18) the Hoare annotation is: (let ((.cse0 (select |#length| main_~q~1.base))) (let ((.cse2 (= 400 .cse0)) (.cse1 (select |#valid| main_~q~1.base))) (or (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ main_~q~1.offset 40) .cse0) .cse1) (and (not |main_#t~short2|) .cse1 (<= (+ main_~p~1.offset 400) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) (<= (+ main_~q~1.offset 72) .cse0) .cse1) (and (<= (+ main_~q~1.offset 340) .cse0) (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 88) .cse0) (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 248) .cse0) .cse1 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 92) .cse0) (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 344) .cse0)) (and (<= (+ main_~q~1.offset 48) .cse0) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 312) .cse0) .cse1 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 268) .cse0)) (and (<= (+ main_~q~1.offset 296) .cse0) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 256) .cse0) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) (<= (+ main_~q~1.offset 244) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse0)) (and (<= (+ main_~q~1.offset 80) .cse0) (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 116) .cse0) (<= (+ main_~p~1.offset 284) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 28) .cse0)) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) (<= (+ main_~q~1.offset 140) .cse0) .cse1) (and (<= (+ main_~q~1.offset 44) .cse0) .cse1 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 32) .cse0) (<= (+ main_~p~1.offset 368) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 276) .cse0) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse1) (and (<= main_~q~1.offset 4) .cse2 (<= (+ main_~p~1.offset 4) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 84) .cse0) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse0) .cse1) (and (<= (+ main_~p~1.offset 216) main_~q~1.offset) (<= (+ main_~q~1.offset 184) .cse0) .cse1) (and (<= (+ main_~q~1.offset 300) .cse0) (<= (+ main_~p~1.offset 100) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 292) .cse0) .cse1 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 364) .cse0) (<= (+ main_~p~1.offset 36) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 384) .cse0) .cse1 (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 96) .cse0)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse0) .cse1) (and (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse0) .cse1) (and (<= (+ main_~p~1.offset 296) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 104) .cse0)) (and (<= (+ main_~p~1.offset 280) main_~q~1.offset) (<= (+ main_~q~1.offset 120) .cse0) .cse1) (and (<= (+ main_~q~1.offset 128) .cse0) .cse1 (<= (+ main_~p~1.offset 272) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 328) .cse0)) (and (<= (+ main_~p~1.offset 220) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 180) .cse0)) (and (<= (+ main_~q~1.offset 284) .cse0) (<= (+ main_~p~1.offset 116) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 148) .cse0) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 236) .cse0)) (and (<= (+ main_~q~1.offset 124) .cse0) (<= (+ main_~p~1.offset 276) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 264) .cse0) (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 304) .cse0) .cse1 (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 228) .cse0)) (and (<= (+ main_~q~1.offset 360) .cse0) .cse1 (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 220) .cse0)) (and (<= (+ main_~q~1.offset 152) .cse0) .cse1 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and .cse1 (<= (+ main_~q~1.offset 68) .cse0) (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 192) .cse0) (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse0) .cse1) (and (<= (+ main_~q~1.offset 160) .cse0) (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 232) .cse0)) (and (<= (+ main_~q~1.offset 224) .cse0) (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 292) main_~q~1.offset) (<= (+ main_~q~1.offset 108) .cse0) .cse1) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) (<= (+ main_~q~1.offset 100) .cse0) .cse1) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 144) .cse0)) (and (<= (+ main_~q~1.offset 372) .cse0) (<= (+ main_~p~1.offset 28) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 376) .cse0) (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ main_~q~1.offset 8) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 112) main_~q~1.offset) (<= (+ main_~q~1.offset 288) .cse0)) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse0) .cse1) (and (<= (+ main_~q~1.offset 4) .cse0) (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 20) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 380) .cse0)) (and (<= (+ main_~q~1.offset 308) .cse0) (<= (+ main_~p~1.offset 92) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse0)) (and (<= (+ main_~q~1.offset 240) .cse0) (<= (+ main_~p~1.offset 160) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 200) .cse0) .cse1 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 324) .cse0) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 168) .cse0) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 204) .cse0) .cse1 (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 52) .cse0) .cse1 (<= (+ main_~p~1.offset 348) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse0) .cse1) (and (<= (+ main_~q~1.offset 112) .cse0) .cse1 (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse0)) (and (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 352) .cse0)) (and (<= (+ main_~q~1.offset 172) .cse0) (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 140) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 260) .cse0)) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 392) .cse0)) (and (<= (+ main_~q~1.offset 272) .cse0) .cse1 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 52) main_~q~1.offset) (<= (+ main_~q~1.offset 348) .cse0)) (and (= main_~p~1.offset main_~q~1.offset) (<= main_~p~1.offset 0) .cse2 .cse1) (and (<= (+ main_~q~1.offset 212) .cse0) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 368) .cse0) (<= (+ main_~p~1.offset 32) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 356) .cse0) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) (<= (+ main_~q~1.offset 20) .cse0) .cse1) (and (<= (+ main_~q~1.offset 164) .cse0) (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse0) .cse1) (and (<= (+ main_~q~1.offset 252) .cse0) (<= (+ main_~p~1.offset 148) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse0)) (and (<= (+ main_~q~1.offset 24) .cse0) (<= (+ main_~p~1.offset 376) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse0)) (and (<= (+ main_~q~1.offset 316) .cse0) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse0)) (and (<= (+ main_~q~1.offset 76) .cse0) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 16) .cse0)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 280) .cse0)) (and (<= (+ main_~p~1.offset 204) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 196) .cse0)) (and (<= (+ main_~q~1.offset 332) .cse0) .cse1 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) (<= (+ main_~q~1.offset 156) .cse0) .cse1) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 208) .cse0))))) [2018-07-23 15:34:46,371 INFO L421 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-07-23 15:34:46,379 INFO L417 ceAbstractionStarter]: At program point L19(lines 15 27) the Hoare annotation is: (let ((.cse0 (select |#length| main_~q~1.base))) (let ((.cse2 (= 400 .cse0)) (.cse1 (select |#valid| main_~q~1.base))) (or (and (<= (+ main_~p~1.offset 360) main_~q~1.offset) (<= (+ main_~q~1.offset 40) .cse0) .cse1) (and (<= (+ main_~p~1.offset 280) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 120) .cse0)) (and (<= (+ main_~p~1.offset 328) main_~q~1.offset) (<= (+ main_~q~1.offset 72) .cse0) .cse1) (and (<= (+ main_~q~1.offset 340) .cse0) (<= (+ main_~p~1.offset 60) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 88) .cse0) (<= (+ main_~p~1.offset 312) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 248) .cse0) .cse1 (<= (+ main_~p~1.offset 152) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 92) .cse0) (<= (+ main_~p~1.offset 308) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 56) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 344) .cse0)) (and (<= (+ main_~q~1.offset 48) .cse0) (<= (+ main_~p~1.offset 352) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 312) .cse0) .cse1 (<= (+ main_~p~1.offset 88) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 132) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 268) .cse0)) (and (<= (+ main_~q~1.offset 296) .cse0) (<= (+ main_~p~1.offset 104) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 256) .cse0) (<= (+ main_~p~1.offset 144) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 156) main_~q~1.offset) (<= (+ main_~q~1.offset 244) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 64) main_~q~1.offset) (<= (+ main_~q~1.offset 336) .cse0)) (and (<= (+ main_~q~1.offset 80) .cse0) (<= (+ main_~p~1.offset 320) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 252) .cse0) .cse1 (<= (+ main_~p~1.offset 148) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 372) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 28) .cse0)) (and .cse1 (<= (+ main_~p~1.offset 140) main_~q~1.offset) (<= (+ main_~q~1.offset 260) .cse0)) (and (<= (+ main_~q~1.offset 240) .cse0) .cse1 (<= (+ main_~p~1.offset 160) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 260) main_~q~1.offset) (<= (+ main_~q~1.offset 140) .cse0) .cse1) (and (<= (+ main_~q~1.offset 44) .cse0) .cse1 (<= (+ main_~p~1.offset 356) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 276) .cse0) (<= (+ main_~p~1.offset 124) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 84) .cse0) (<= (+ main_~p~1.offset 316) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 12) main_~q~1.offset) (<= (+ main_~q~1.offset 388) .cse0) .cse1) (and (<= (+ main_~p~1.offset 216) main_~q~1.offset) (<= (+ main_~q~1.offset 184) .cse0) .cse1) (and (<= (+ main_~q~1.offset 292) .cse0) .cse1 (<= (+ main_~p~1.offset 108) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 304) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 96) .cse0)) (and (<= (+ main_~p~1.offset 336) main_~q~1.offset) (<= (+ main_~q~1.offset 64) .cse0) .cse1) (and (<= (+ main_~p~1.offset 264) main_~q~1.offset) (<= (+ main_~q~1.offset 136) .cse0) .cse1) (and (<= (+ main_~p~1.offset 296) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 104) .cse0)) (and (<= (+ main_~p~1.offset 72) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 328) .cse0)) (and (<= (+ main_~q~1.offset 284) .cse0) (<= (+ main_~p~1.offset 116) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~q~1.offset 128) .cse0) (<= (+ main_~p~1.offset 272) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 164) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 236) .cse0)) (and (<= (+ main_~q~1.offset 148) .cse0) (<= (+ main_~p~1.offset 252) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 124) .cse0) (<= (+ main_~p~1.offset 276) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 264) .cse0) (<= (+ main_~p~1.offset 136) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 304) .cse0) .cse1 (<= (+ main_~p~1.offset 96) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 172) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 228) .cse0)) (and (<= (+ main_~q~1.offset 360) .cse0) .cse1 (<= (+ main_~p~1.offset 40) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 180) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 220) .cse0)) (and (<= main_~q~1.offset 4) .cse2 .cse1 (<= (+ main_~p~1.offset 4) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 152) .cse0) .cse1 (<= (+ main_~p~1.offset 248) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 192) .cse0) (<= (+ main_~p~1.offset 208) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 212) main_~q~1.offset) (<= (+ main_~q~1.offset 188) .cse0) .cse1) (and .cse1 (<= (+ main_~q~1.offset 68) .cse0) (<= (+ main_~p~1.offset 332) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 160) .cse0) (<= (+ main_~p~1.offset 240) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 224) .cse0) (<= (+ main_~p~1.offset 176) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 168) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 232) .cse0)) (and (<= (+ main_~q~1.offset 116) .cse0) .cse1 (<= (+ main_~p~1.offset 284) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 292) main_~q~1.offset) (<= (+ main_~q~1.offset 108) .cse0) .cse1) (and (<= (+ main_~p~1.offset 300) main_~q~1.offset) (<= (+ main_~q~1.offset 100) .cse0) .cse1) (and (<= (+ main_~p~1.offset 256) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 144) .cse0)) (and (<= (+ main_~q~1.offset 376) .cse0) (<= (+ main_~p~1.offset 24) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 392) main_~q~1.offset) (<= (+ main_~q~1.offset 8) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 20) main_~q~1.offset) (<= (+ main_~q~1.offset 380) .cse0)) (and .cse1 (<= (+ main_~p~1.offset 112) main_~q~1.offset) (<= (+ main_~q~1.offset 288) .cse0)) (and (<= (+ main_~q~1.offset 4) .cse0) (<= (+ main_~p~1.offset 396) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 364) main_~q~1.offset) (<= (+ main_~q~1.offset 36) .cse0) .cse1) (and (<= (+ main_~q~1.offset 300) .cse0) .cse1 (<= (+ main_~p~1.offset 100) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 308) .cse0) (<= (+ main_~p~1.offset 92) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 372) .cse0) .cse1 (<= (+ main_~p~1.offset 28) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 388) main_~q~1.offset) (<= (+ main_~q~1.offset 12) .cse0)) (and .cse1 (<= (+ main_~p~1.offset 220) main_~q~1.offset) (<= (+ main_~q~1.offset 180) .cse0)) (and (<= (+ main_~q~1.offset 200) .cse0) .cse1 (<= (+ main_~p~1.offset 200) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 324) .cse0) (<= (+ main_~p~1.offset 76) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 168) .cse0) (<= (+ main_~p~1.offset 232) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 204) .cse0) .cse1 (<= (+ main_~p~1.offset 196) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 52) .cse0) .cse1 (<= (+ main_~p~1.offset 348) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 184) main_~q~1.offset) (<= (+ main_~q~1.offset 216) .cse0) .cse1) (and .cse1 (<= (+ main_~q~1.offset 384) .cse0) (<= (+ main_~p~1.offset 16) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 368) .cse0) .cse1 (<= (+ main_~p~1.offset 32) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 112) .cse0) .cse1 (<= (+ main_~p~1.offset 288) main_~q~1.offset)) (and .cse1 (<= (+ main_~p~1.offset 80) main_~q~1.offset) (<= (+ main_~q~1.offset 320) .cse0)) (and (<= (+ main_~p~1.offset 48) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 352) .cse0)) (and (<= (+ main_~q~1.offset 172) .cse0) (<= (+ main_~p~1.offset 228) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 8) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 392) .cse0)) (and .cse1 (<= (+ main_~p~1.offset 52) main_~q~1.offset) (<= (+ main_~q~1.offset 348) .cse0)) (and (<= (+ main_~q~1.offset 272) .cse0) .cse1 (<= (+ main_~p~1.offset 128) main_~q~1.offset)) (and (= main_~p~1.offset main_~q~1.offset) (<= main_~p~1.offset 0) .cse2 .cse1) (and (<= (+ main_~q~1.offset 212) .cse0) (<= (+ main_~p~1.offset 188) main_~q~1.offset) .cse1) (and (<= (+ main_~q~1.offset 32) .cse0) .cse1 (<= (+ main_~p~1.offset 368) main_~q~1.offset)) (and (<= (+ main_~q~1.offset 356) .cse0) (<= (+ main_~p~1.offset 44) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 380) main_~q~1.offset) (<= (+ main_~q~1.offset 20) .cse0) .cse1) (and (<= (+ main_~q~1.offset 164) .cse0) (<= (+ main_~p~1.offset 236) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 344) main_~q~1.offset) (<= (+ main_~q~1.offset 56) .cse0) .cse1) (and .cse1 (<= (+ main_~p~1.offset 224) main_~q~1.offset) (<= (+ main_~q~1.offset 176) .cse0)) (and .cse1 (<= (+ main_~p~1.offset 340) main_~q~1.offset) (<= (+ main_~q~1.offset 60) .cse0)) (and (<= (+ main_~q~1.offset 24) .cse0) (<= (+ main_~p~1.offset 376) main_~q~1.offset) .cse1) (and (not |main_#t~short2|) .cse1) (and (<= (+ main_~q~1.offset 316) .cse0) (<= (+ main_~p~1.offset 84) main_~q~1.offset) .cse1) (and .cse1 (<= (+ main_~p~1.offset 268) main_~q~1.offset) (<= (+ main_~q~1.offset 132) .cse0)) (and (<= (+ main_~q~1.offset 76) .cse0) (<= (+ main_~p~1.offset 324) main_~q~1.offset) .cse1) (and (<= (+ main_~p~1.offset 384) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 16) .cse0)) (and (<= (+ main_~q~1.offset 364) .cse0) .cse1 (<= (+ main_~p~1.offset 36) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 120) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 280) .cse0)) (and (<= (+ main_~p~1.offset 204) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 196) .cse0)) (and (<= (+ main_~q~1.offset 332) .cse0) .cse1 (<= (+ main_~p~1.offset 68) main_~q~1.offset)) (and (<= (+ main_~p~1.offset 244) main_~q~1.offset) (<= (+ main_~q~1.offset 156) .cse0) .cse1) (and (<= (+ main_~p~1.offset 192) main_~q~1.offset) .cse1 (<= (+ main_~q~1.offset 208) .cse0))))) [2018-07-23 15:34:46,379 INFO L417 ceAbstractionStarter]: At program point L12'(lines 12 31) the Hoare annotation is: (select |#valid| main_~q~1.base) [2018-07-23 15:34:46,456 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:34:46 BoogieIcfgContainer [2018-07-23 15:34:46,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:34:46,457 INFO L168 Benchmark]: Toolchain (without parser) took 89647.92 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:34:46,459 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:34:46,459 INFO L168 Benchmark]: Boogie Preprocessor took 51.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-23 15:34:46,460 INFO L168 Benchmark]: RCFGBuilder took 253.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-23 15:34:46,460 INFO L168 Benchmark]: TraceAbstraction took 89338.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-23 15:34:46,465 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 253.74 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89338.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.4 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 16]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((~p~1!offset + 360 <= ~q~1!offset && ~q~1!offset + 40 <= #length[~q~1!base]) && #valid[~q~1!base]) || ((~p~1!offset + 328 <= ~q~1!offset && ~q~1!offset + 72 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 340 <= #length[~q~1!base] && ~p~1!offset + 60 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 88 <= #length[~q~1!base] && ~p~1!offset + 312 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 248 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 152 <= ~q~1!offset)) || ((~q~1!offset + 92 <= #length[~q~1!base] && ~p~1!offset + 308 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 56 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 344 <= #length[~q~1!base])) || ((~q~1!offset + 48 <= #length[~q~1!base] && ~p~1!offset + 352 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 312 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 88 <= ~q~1!offset)) || ((~p~1!offset + 132 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 268 <= #length[~q~1!base])) || ((~q~1!offset + 296 <= #length[~q~1!base] && ~p~1!offset + 104 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 256 <= #length[~q~1!base] && ~p~1!offset + 144 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 156 <= ~q~1!offset && ~q~1!offset + 244 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((#valid[~q~1!base] && ~p~1!offset + 64 <= ~q~1!offset) && ~q~1!offset + 336 <= #length[~q~1!base])) || ((~q~1!offset + 80 <= #length[~q~1!base] && ~p~1!offset + 320 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 116 <= #length[~q~1!base] && ~p~1!offset + 284 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 372 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 28 <= #length[~q~1!base])) || ((~p~1!offset + 260 <= ~q~1!offset && ~q~1!offset + 140 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 44 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 356 <= ~q~1!offset)) || ((~q~1!offset + 32 <= #length[~q~1!base] && ~p~1!offset + 368 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 276 <= #length[~q~1!base] && ~p~1!offset + 124 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset <= 4 && 400 == #length[~q~1!base]) && ~p~1!offset + 4 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 84 <= #length[~q~1!base] && ~p~1!offset + 316 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 12 <= ~q~1!offset && ~q~1!offset + 388 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~p~1!offset + 216 <= ~q~1!offset && ~q~1!offset + 184 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 300 <= #length[~q~1!base] && ~p~1!offset + 100 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 292 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 108 <= ~q~1!offset)) || ((~q~1!offset + 364 <= #length[~q~1!base] && ~p~1!offset + 36 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 384 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 16 <= ~q~1!offset)) || ((~p~1!offset + 304 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 96 <= #length[~q~1!base])) || ((~p~1!offset + 336 <= ~q~1!offset && ~q~1!offset + 64 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~p~1!offset + 264 <= ~q~1!offset && ~q~1!offset + 136 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~p~1!offset + 296 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 104 <= #length[~q~1!base])) || ((~p~1!offset + 280 <= ~q~1!offset && ~q~1!offset + 120 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 128 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 272 <= ~q~1!offset)) || ((~p~1!offset + 72 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 328 <= #length[~q~1!base])) || ((~p~1!offset + 220 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 180 <= #length[~q~1!base])) || ((~q~1!offset + 284 <= #length[~q~1!base] && ~p~1!offset + 116 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 148 <= #length[~q~1!base] && ~p~1!offset + 252 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 164 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 236 <= #length[~q~1!base])) || ((~q~1!offset + 124 <= #length[~q~1!base] && ~p~1!offset + 276 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 264 <= #length[~q~1!base] && ~p~1!offset + 136 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 304 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 96 <= ~q~1!offset)) || ((~p~1!offset + 172 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 228 <= #length[~q~1!base])) || ((~q~1!offset + 360 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 40 <= ~q~1!offset)) || ((~p~1!offset + 180 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 220 <= #length[~q~1!base])) || ((~q~1!offset + 152 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 248 <= ~q~1!offset)) || ((#valid[~q~1!base] && ~q~1!offset + 68 <= #length[~q~1!base]) && ~p~1!offset + 332 <= ~q~1!offset)) || ((~q~1!offset + 192 <= #length[~q~1!base] && ~p~1!offset + 208 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 212 <= ~q~1!offset && ~q~1!offset + 188 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 160 <= #length[~q~1!base] && ~p~1!offset + 240 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 168 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 232 <= #length[~q~1!base])) || ((~q~1!offset + 224 <= #length[~q~1!base] && ~p~1!offset + 176 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 292 <= ~q~1!offset && ~q~1!offset + 108 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~p~1!offset + 300 <= ~q~1!offset && ~q~1!offset + 100 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~p~1!offset + 256 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 144 <= #length[~q~1!base])) || ((~q~1!offset + 372 <= #length[~q~1!base] && ~p~1!offset + 28 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 376 <= #length[~q~1!base] && ~p~1!offset + 24 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 392 <= ~q~1!offset && ~q~1!offset + 8 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((#valid[~q~1!base] && ~p~1!offset + 112 <= ~q~1!offset) && ~q~1!offset + 288 <= #length[~q~1!base])) || ((~p~1!offset + 364 <= ~q~1!offset && ~q~1!offset + 36 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 4 <= #length[~q~1!base] && ~p~1!offset + 396 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 20 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 380 <= #length[~q~1!base])) || ((~q~1!offset + 308 <= #length[~q~1!base] && ~p~1!offset + 92 <= ~q~1!offset) && #valid[~q~1!base])) || ((#valid[~q~1!base] && ~p~1!offset + 388 <= ~q~1!offset) && ~q~1!offset + 12 <= #length[~q~1!base])) || ((~q~1!offset + 240 <= #length[~q~1!base] && ~p~1!offset + 160 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 200 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 200 <= ~q~1!offset)) || ((~q~1!offset + 324 <= #length[~q~1!base] && ~p~1!offset + 76 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 168 <= #length[~q~1!base] && ~p~1!offset + 232 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 204 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 196 <= ~q~1!offset)) || ((~q~1!offset + 52 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 348 <= ~q~1!offset)) || ((~p~1!offset + 184 <= ~q~1!offset && ~q~1!offset + 216 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 112 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 288 <= ~q~1!offset)) || ((#valid[~q~1!base] && ~p~1!offset + 80 <= ~q~1!offset) && ~q~1!offset + 320 <= #length[~q~1!base])) || ((~p~1!offset + 48 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 352 <= #length[~q~1!base])) || ((~q~1!offset + 172 <= #length[~q~1!base] && ~p~1!offset + 228 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 140 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 260 <= #length[~q~1!base])) || ((~p~1!offset + 8 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 392 <= #length[~q~1!base])) || ((~q~1!offset + 272 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 128 <= ~q~1!offset)) || ((#valid[~q~1!base] && ~p~1!offset + 52 <= ~q~1!offset) && ~q~1!offset + 348 <= #length[~q~1!base])) || (((~p~1!offset == ~q~1!offset && ~p~1!offset <= 0) && 400 == #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 212 <= #length[~q~1!base] && ~p~1!offset + 188 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 368 <= #length[~q~1!base] && ~p~1!offset + 32 <= ~q~1!offset) && #valid[~q~1!base])) || ((~q~1!offset + 356 <= #length[~q~1!base] && ~p~1!offset + 44 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 380 <= ~q~1!offset && ~q~1!offset + 20 <= #length[~q~1!base]) && #valid[~q~1!base])) || (#valid[~q~1!base] && ~p~1!offset + 400 <= ~q~1!offset)) || ((~q~1!offset + 164 <= #length[~q~1!base] && ~p~1!offset + 236 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 344 <= ~q~1!offset && ~q~1!offset + 56 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~q~1!offset + 252 <= #length[~q~1!base] && ~p~1!offset + 148 <= ~q~1!offset) && #valid[~q~1!base])) || ((#valid[~q~1!base] && ~p~1!offset + 224 <= ~q~1!offset) && ~q~1!offset + 176 <= #length[~q~1!base])) || ((~q~1!offset + 24 <= #length[~q~1!base] && ~p~1!offset + 376 <= ~q~1!offset) && #valid[~q~1!base])) || ((#valid[~q~1!base] && ~p~1!offset + 340 <= ~q~1!offset) && ~q~1!offset + 60 <= #length[~q~1!base])) || ((~q~1!offset + 316 <= #length[~q~1!base] && ~p~1!offset + 84 <= ~q~1!offset) && #valid[~q~1!base])) || ((#valid[~q~1!base] && ~p~1!offset + 268 <= ~q~1!offset) && ~q~1!offset + 132 <= #length[~q~1!base])) || ((~q~1!offset + 76 <= #length[~q~1!base] && ~p~1!offset + 324 <= ~q~1!offset) && #valid[~q~1!base])) || ((~p~1!offset + 384 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 16 <= #length[~q~1!base])) || ((~p~1!offset + 120 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 280 <= #length[~q~1!base])) || ((~p~1!offset + 204 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 196 <= #length[~q~1!base])) || ((~q~1!offset + 332 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 68 <= ~q~1!offset)) || ((~p~1!offset + 244 <= ~q~1!offset && ~q~1!offset + 156 <= #length[~q~1!base]) && #valid[~q~1!base])) || ((~p~1!offset + 192 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 208 <= #length[~q~1!base]) - ProcedureContractResult [Line: 1]: Procedure Contract for main Derived contract for procedure main: #valid[~q~1!base] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 2 error locations. SAFE Result, 89.1s OverallTime, 103 OverallIterations, 101 TraceHistogramMax, 21.3s AutomataDifference, 0.0s DeadEndRemovalTime, 14.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 415 SDtfs, 5059 SDslu, 5353 SDs, 0 SdLazy, 20268 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5257 GetRequests, 3 SyntacticMatches, 98 SemanticMatches, 5156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=102, 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: 9.1s AutomataMinimizationTime, 103 MinimizatonAttempts, 99 StatesRemovedByMinimization, 99 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 414 NumberOfFragments, 6439 HoareAnnotationTreeSize, 9 FomulaSimplifications, -1112 FormulaSimplificationTreeSizeReduction, 12.5s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 6.9s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 20615 NumberOfCodeBlocks, 20615 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 20512 ConstructedInterpolants, 0 QuantifiedInterpolants, 38981898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 3 PerfectInterpolantSequences, 19605/681752 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-34-46-492.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-34-46-492.csv Received shutdown request...