java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:23:56,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:23:56,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:23:56,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:23:56,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:23:56,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:23:56,740 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:23:56,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:23:56,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:23:56,745 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:23:56,746 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:23:56,747 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:23:56,748 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:23:56,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:23:56,750 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:23:56,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:23:56,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:23:56,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:23:56,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:23:56,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:23:56,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:23:56,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:23:56,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:23:56,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:23:56,763 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:23:56,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:23:56,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:23:56,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:23:56,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:23:56,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:23:56,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:23:56,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:23:56,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:23:56,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:23:56,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:23:56,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:23:56,773 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:23:56,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:23:56,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:23:56,786 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:23:56,786 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:23:56,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:23:56,789 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:23:56,789 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:23:56,789 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:23:56,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:23:56,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:23:56,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:23:56,864 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:23:56,864 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:23:56,865 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl [2018-09-26 08:23:56,865 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-WithArrays.bpl' [2018-09-26 08:23:56,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:23:56,920 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:23:56,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:23:56,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:23:56,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:23:56,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,965 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:23:56,966 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:23:56,966 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:23:56,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:23:56,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:23:56,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:23:56,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:23:56,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:56,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:23:56,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:23:56,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:23:56,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:23:56,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/1) ... [2018-09-26 08:23:57,094 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:23:57,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:23:57,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:23:57,252 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:23:57,253 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:23:57 BoogieIcfgContainer [2018-09-26 08:23:57,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:23:57,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:23:57,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:23:57,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:23:57,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:23:56" (1/2) ... [2018-09-26 08:23:57,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dacd0dd and model type Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:23:57, skipping insertion in model container [2018-09-26 08:23:57,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:23:57" (2/2) ... [2018-09-26 08:23:57,263 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-WithArrays.bpl [2018-09-26 08:23:57,274 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:23:57,287 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:23:57,340 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:23:57,341 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:23:57,341 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:23:57,341 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:23:57,342 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:23:57,342 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:23:57,342 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:23:57,342 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:23:57,343 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:23:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:23:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:23:57,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:57,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:23:57,372 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:57,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:57,387 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-09-26 08:23:57,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:57,548 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:23:57,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:23:57,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:23:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:23:57,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:23:57,569 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:23:57,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:57,604 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:23:57,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:23:57,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:23:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:57,621 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:23:57,621 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:23:57,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:23:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:23:57,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:23:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:23:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:23:57,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:23:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:57,669 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:23:57,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:23:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:23:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:23:57,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:57,670 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:23:57,670 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:57,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-09-26 08:23:57,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:57,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:57,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:23:57,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:23:57,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:23:57,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:23:57,760 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:23:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:57,778 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:23:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:23:57,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:23:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:57,779 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:23:57,779 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:23:57,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:23:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:23:57,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:23:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:23:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:23:57,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:23:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:57,787 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:23:57,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:23:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:23:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:23:57,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:57,790 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:23:57,790 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:57,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-09-26 08:23:57,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:57,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:57,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:23:57,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:23:57,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:23:57,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:23:57,933 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:23:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:57,959 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:23:57,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:23:57,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:23:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:57,960 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:23:57,960 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:23:57,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:23:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:23:57,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:23:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:23:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:23:57,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:23:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:57,968 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:23:57,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:23:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:23:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:23:57,971 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:57,971 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:23:57,971 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:57,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-09-26 08:23:57,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:23:58,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:23:58,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:23:58,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:23:58,169 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:23:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,193 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:23:58,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:23:58,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:23:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,194 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:23:58,194 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:23:58,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:23:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:23:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:23:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:23:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:23:58,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:23:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:58,199 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:23:58,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:23:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:23:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:23:58,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:58,200 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:23:58,200 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:58,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-09-26 08:23:58,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:23:58,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:23:58,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:23:58,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:23:58,370 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:23:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,386 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:23:58,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:23:58,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:23:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,388 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:23:58,388 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:23:58,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:23:58,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:23:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:23:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:23:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:23:58,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:23:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:58,397 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:23:58,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:23:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:23:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:23:58,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:58,399 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:23:58,399 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:58,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:58,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-09-26 08:23:58,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,561 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:23:58,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:23:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:23:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:23:58,563 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-26 08:23:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,579 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:23:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:23:58,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:23:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,580 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:23:58,581 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:23:58,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:23:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:23:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:23:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:23:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:23:58,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:23:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:58,586 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:23:58,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:23:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:23:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:23:58,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:58,587 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:23:58,588 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:58,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-09-26 08:23:58,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:23:58,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:23:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:23:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:23:58,767 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-26 08:23:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,804 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:23:58,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:23:58,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:23:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,806 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:23:58,806 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:23:58,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:23:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:23:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:23:58,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:23:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:23:58,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:23:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:58,821 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:23:58,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:23:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:23:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:23:58,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:58,823 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:23:58,823 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:58,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-09-26 08:23:58,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:23:58,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:23:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:23:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:23:58,960 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-26 08:23:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:58,988 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:23:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:23:58,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:23:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:58,989 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:23:58,989 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:23:58,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:23:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:23:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:23:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:23:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:23:59,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:23:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:59,007 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:23:59,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:23:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:23:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:23:59,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:59,008 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:23:59,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:59,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-09-26 08:23:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:59,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:59,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:23:59,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:23:59,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:23:59,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:23:59,166 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-09-26 08:23:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:59,182 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:23:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:23:59,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:23:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:59,183 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:23:59,183 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:23:59,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:23:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:23:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:23:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:23:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:23:59,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:23:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:59,189 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:23:59,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:23:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:23:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:23:59,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:59,190 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:23:59,190 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:59,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:59,192 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-09-26 08:23:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:59,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:59,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:23:59,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:23:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:23:59,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:23:59,360 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-09-26 08:23:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:59,390 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:23:59,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:23:59,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:23:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:59,391 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:23:59,391 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:23:59,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:23:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:23:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:23:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:23:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:23:59,397 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:23:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:59,397 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:23:59,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:23:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:23:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:23:59,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:59,399 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:23:59,400 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:59,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-09-26 08:23:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:59,576 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:59,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:23:59,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:23:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:23:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:23:59,578 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-09-26 08:23:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:59,596 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:23:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:23:59,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:23:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:59,597 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:23:59,597 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:23:59,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:23:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:23:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:23:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:23:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:23:59,603 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:23:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:59,604 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:23:59,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:23:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:23:59,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:23:59,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:59,606 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:23:59,607 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:59,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:59,607 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-09-26 08:23:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:59,790 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:59,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:59,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:23:59,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:23:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:23:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:23:59,793 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-09-26 08:23:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:59,819 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:23:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:23:59,820 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:23:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:59,821 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:23:59,821 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:23:59,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:23:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:23:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:23:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:23:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:23:59,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:23:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:59,827 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:23:59,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:23:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:23:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:23:59,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:59,830 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:23:59,831 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:59,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-09-26 08:23:59,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:00,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:00,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:24:00,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:24:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:24:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:00,032 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-09-26 08:24:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:00,059 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:24:00,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:24:00,059 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 08:24:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:00,060 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:24:00,060 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:24:00,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:24:00,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:24:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:24:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:24:00,066 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:24:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:00,066 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:24:00,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:24:00,067 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:24:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:24:00,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:00,068 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:24:00,068 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:00,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:00,068 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-09-26 08:24:00,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:00,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:00,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:24:00,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:24:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:24:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:00,286 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-09-26 08:24:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:00,311 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:24:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:24:00,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-26 08:24:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:00,312 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:24:00,313 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:24:00,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:24:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:24:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:24:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:24:00,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:24:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:00,319 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:24:00,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:24:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:24:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:24:00,320 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:00,321 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:24:00,321 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:00,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-09-26 08:24:00,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:00,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:00,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:24:00,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:24:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:24:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:00,556 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-09-26 08:24:00,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:00,581 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:24:00,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:24:00,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-26 08:24:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:00,582 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:24:00,582 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:24:00,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:24:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:24:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:24:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:24:00,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:24:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:00,592 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:24:00,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:24:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:24:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:24:00,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:00,593 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:24:00,594 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:00,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-09-26 08:24:00,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:00,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:00,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:24:00,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:24:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:24:00,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:00,846 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-09-26 08:24:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:00,873 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:24:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:24:00,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 08:24:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:00,875 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:24:00,875 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:24:00,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:24:00,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:24:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:24:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:24:00,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:24:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:00,884 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:24:00,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:24:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:24:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:24:00,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:00,885 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:24:00,886 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:00,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-09-26 08:24:00,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:24:01,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:24:01,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:24:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:01,149 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-09-26 08:24:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,184 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:24:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:24:01,184 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 08:24:01,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,185 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:24:01,185 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:24:01,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:24:01,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:24:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:24:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:24:01,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:24:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,192 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:24:01,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:24:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:24:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:24:01,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,199 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:24:01,199 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-09-26 08:24:01,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:24:01,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:24:01,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:24:01,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:01,471 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-09-26 08:24:01,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,501 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:24:01,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:24:01,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 08:24:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,502 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:24:01,502 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:24:01,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:01,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:24:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:24:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:24:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:24:01,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:24:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,511 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:24:01,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:24:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:24:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:24:01,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,513 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:24:01,513 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,517 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-09-26 08:24:01,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:01,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:01,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:24:01,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:24:01,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:24:01,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:01,856 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-09-26 08:24:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,914 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:24:01,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:24:01,915 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 08:24:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,915 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:24:01,915 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:24:01,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:24:01,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:24:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:24:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:24:01,927 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:24:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,928 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:24:01,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:24:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:24:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:24:01,929 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,929 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:24:01,930 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-09-26 08:24:01,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:02,211 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:02,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:24:02,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:24:02,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:24:02,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:02,212 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-09-26 08:24:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:02,231 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:24:02,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:24:02,231 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-09-26 08:24:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:02,232 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:24:02,232 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:24:02,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:24:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:24:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:24:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:24:02,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:24:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:02,239 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:24:02,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:24:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:24:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:24:02,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:02,240 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:24:02,242 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:02,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-09-26 08:24:02,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:02,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:02,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:24:02,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:24:02,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:24:02,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:02,546 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-09-26 08:24:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:02,575 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:24:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:24:02,576 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-09-26 08:24:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:02,576 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:24:02,576 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:24:02,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:24:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:24:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:24:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:24:02,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:24:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:02,582 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:24:02,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:24:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:24:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:24:02,583 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:02,583 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:24:02,583 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:02,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:02,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-09-26 08:24:02,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:02,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:02,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:24:02,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:24:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:24:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:02,894 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-09-26 08:24:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:02,930 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:24:02,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:24:02,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-09-26 08:24:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:02,931 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:24:02,931 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:24:02,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:02,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:24:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:24:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:24:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:24:02,941 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:24:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:02,941 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:24:02,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:24:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:24:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:24:02,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:02,942 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:24:02,942 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:02,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-09-26 08:24:02,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:03,253 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:03,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:24:03,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:24:03,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:24:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:03,255 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-09-26 08:24:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:03,274 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:24:03,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:24:03,274 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-09-26 08:24:03,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:03,275 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:24:03,275 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:24:03,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:24:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:24:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:24:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:24:03,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:24:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:03,280 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:24:03,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:24:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:24:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:24:03,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:03,283 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:24:03,283 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:03,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-09-26 08:24:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:03,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:03,599 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:24:03,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:24:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:24:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:03,600 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-09-26 08:24:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:03,623 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:24:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:24:03,623 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-09-26 08:24:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:03,624 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:24:03,624 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:24:03,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:24:03,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:24:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:24:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:24:03,629 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:24:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:03,630 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:24:03,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:24:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:24:03,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:24:03,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:03,631 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:24:03,631 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:03,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:03,631 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-09-26 08:24:03,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:03,942 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:03,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:24:03,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:24:03,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:24:03,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:03,943 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-09-26 08:24:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:03,976 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:24:03,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:24:03,977 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-09-26 08:24:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:03,977 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:24:03,977 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:24:03,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:24:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:24:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:24:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:24:03,983 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:24:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:03,983 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:24:03,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:24:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:24:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:24:03,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:03,984 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:24:03,984 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:03,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:03,985 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-09-26 08:24:03,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:04,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:04,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:24:04,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:24:04,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:24:04,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:04,388 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-09-26 08:24:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:04,418 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:24:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:24:04,418 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-09-26 08:24:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:04,419 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:24:04,419 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:24:04,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:24:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:24:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:24:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:24:04,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:24:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:04,425 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:24:04,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:24:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:24:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:24:04,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:04,426 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:24:04,426 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:04,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-09-26 08:24:04,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:04,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:04,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:24:04,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:24:04,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:24:04,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:04,823 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-09-26 08:24:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:04,848 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:24:04,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:24:04,849 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-09-26 08:24:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:04,849 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:24:04,850 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:24:04,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:24:04,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:24:04,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:24:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:24:04,856 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:24:04,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:04,856 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:24:04,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:24:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:24:04,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:24:04,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:04,857 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:24:04,857 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:04,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:04,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-09-26 08:24:04,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:05,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:05,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:24:05,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:24:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:24:05,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:05,292 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-09-26 08:24:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:05,325 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:24:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:24:05,325 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-09-26 08:24:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:05,326 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:24:05,326 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:24:05,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:24:05,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:24:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:24:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:24:05,335 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:24:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:05,336 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:24:05,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:24:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:24:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:24:05,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:05,339 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:24:05,339 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:05,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:05,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-09-26 08:24:05,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:05,677 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:05,677 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:24:05,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:24:05,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:24:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:05,679 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-09-26 08:24:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:05,702 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:24:05,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:24:05,702 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-09-26 08:24:05,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:05,703 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:24:05,703 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:24:05,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:05,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:24:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:24:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:24:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:24:05,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:24:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:05,717 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:24:05,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:24:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:24:05,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:24:05,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:05,718 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:24:05,718 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:05,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-09-26 08:24:05,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:06,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:06,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:24:06,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:24:06,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:24:06,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:06,086 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-09-26 08:24:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:06,119 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:24:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:24:06,119 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-09-26 08:24:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:06,120 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:24:06,120 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:24:06,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:24:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:24:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:24:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:24:06,128 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:24:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:06,129 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:24:06,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:24:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:24:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:24:06,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:06,130 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:24:06,130 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:06,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-09-26 08:24:06,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:06,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:06,530 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:24:06,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:24:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:24:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:06,532 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-09-26 08:24:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:06,569 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:24:06,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:24:06,569 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-09-26 08:24:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:06,569 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:24:06,570 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:24:06,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:24:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:24:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:24:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:24:06,576 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:24:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:06,576 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:24:06,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:24:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:24:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:24:06,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:06,578 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:24:06,578 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:06,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:06,579 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-09-26 08:24:06,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:06,962 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:06,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:24:06,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:24:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:24:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:06,964 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-09-26 08:24:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:06,997 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:24:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:24:06,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-09-26 08:24:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:06,998 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:24:06,998 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:24:06,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:24:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:24:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:24:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:24:07,011 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:24:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:07,011 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:24:07,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:24:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:24:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:24:07,012 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:07,012 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:24:07,015 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:07,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-09-26 08:24:07,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:07,411 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:07,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:24:07,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:24:07,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:24:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:07,416 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-09-26 08:24:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:07,448 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:24:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:24:07,448 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-09-26 08:24:07,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:07,449 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:24:07,449 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:24:07,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:24:07,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:24:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:24:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:24:07,456 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:24:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:07,457 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:24:07,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:24:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:24:07,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:24:07,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:07,458 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:24:07,458 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:07,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:07,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-09-26 08:24:07,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:07,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:07,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:24:07,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:24:07,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:24:07,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:07,915 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-09-26 08:24:07,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:07,941 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:24:07,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:24:07,941 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-09-26 08:24:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:07,942 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:24:07,942 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:24:07,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:24:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:24:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:24:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:24:07,948 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:24:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:07,949 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:24:07,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:24:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:24:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:24:07,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:07,950 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:24:07,950 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:07,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-09-26 08:24:07,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:08,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:08,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:24:08,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:24:08,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:24:08,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:08,474 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-09-26 08:24:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,497 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:24:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:24:08,497 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-09-26 08:24:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,498 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:24:08,498 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:24:08,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:24:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:24:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:24:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:24:08,509 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:24:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,510 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:24:08,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:24:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:24:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:24:08,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,511 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:24:08,511 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-09-26 08:24:08,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:08,939 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:08,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:08,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:24:08,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:24:08,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:24:08,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:08,941 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-09-26 08:24:08,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:08,967 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:24:08,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:24:08,968 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-09-26 08:24:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:08,968 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:24:08,968 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:24:08,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:24:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:24:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:24:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:24:08,973 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:24:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:08,974 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:24:08,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:24:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:24:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:24:08,974 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:08,975 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:24:08,975 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:08,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:08,975 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-09-26 08:24:08,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:09,400 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,400 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:24:09,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:24:09,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:24:09,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:09,402 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-09-26 08:24:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,431 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:24:09,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:24:09,431 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-09-26 08:24:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,432 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:24:09,432 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:24:09,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:09,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:24:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:24:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:24:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:24:09,437 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:24:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,437 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:24:09,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:24:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:24:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:24:09,438 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,438 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:24:09,440 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-09-26 08:24:09,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:09,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:09,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:24:09,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:24:09,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:24:09,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:09,875 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-09-26 08:24:09,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:09,911 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:24:09,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:24:09,911 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-09-26 08:24:09,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:09,912 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:24:09,912 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:24:09,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:24:09,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:24:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:24:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:24:09,919 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:24:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:09,919 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:24:09,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:24:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:24:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:24:09,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:09,920 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:24:09,921 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:09,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-09-26 08:24:09,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:10,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,371 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:24:10,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:24:10,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:24:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:10,372 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-09-26 08:24:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,408 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:24:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:24:10,408 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-09-26 08:24:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,409 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:24:10,409 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:24:10,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:24:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:24:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:24:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:24:10,414 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:24:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,414 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:24:10,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:24:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:24:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:24:10,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,415 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:24:10,415 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-09-26 08:24:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:10,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:10,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:24:10,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:24:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:24:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:10,875 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-09-26 08:24:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:10,904 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:24:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:24:10,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-09-26 08:24:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:10,905 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:24:10,905 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:24:10,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:24:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:24:10,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:24:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:24:10,910 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:24:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:10,910 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:24:10,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:24:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:24:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:24:10,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:10,911 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:24:10,912 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:10,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:10,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-09-26 08:24:10,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:11,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:11,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:24:11,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:24:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:24:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:24:11,467 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-09-26 08:24:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:11,510 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:24:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:24:11,511 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-09-26 08:24:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:11,511 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:24:11,511 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:24:11,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:24:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:24:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:24:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:24:11,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:24:11,518 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:24:11,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:11,519 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:24:11,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:24:11,519 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:24:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:24:11,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:11,520 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:24:11,520 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:11,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-09-26 08:24:11,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:12,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:24:12,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:24:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:24:12,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:12,065 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-09-26 08:24:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:12,097 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:24:12,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:24:12,098 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-09-26 08:24:12,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:12,098 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:24:12,099 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:24:12,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:24:12,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:24:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:24:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:24:12,106 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:24:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:12,107 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:24:12,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:24:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:24:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:24:12,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:12,108 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:24:12,108 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:12,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-09-26 08:24:12,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:12,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:12,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:24:12,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:24:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:24:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:24:12,600 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-09-26 08:24:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:12,626 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:24:12,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:24:12,627 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-09-26 08:24:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:12,627 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:24:12,627 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:24:12,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:24:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:24:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:24:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:24:12,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:24:12,635 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:24:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:12,635 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:24:12,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:24:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:24:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:24:12,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:12,636 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:24:12,636 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:12,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:12,639 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-09-26 08:24:12,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:13,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:24:13,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:24:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:24:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:13,136 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-09-26 08:24:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,178 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:24:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:24:13,178 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-09-26 08:24:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,179 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:24:13,179 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:24:13,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:24:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:24:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:24:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:24:13,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:24:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,186 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:24:13,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:24:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:24:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:24:13,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,187 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:24:13,188 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,188 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-09-26 08:24:13,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:13,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:13,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:24:13,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:24:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:24:13,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:24:13,689 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-09-26 08:24:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:13,727 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:24:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:24:13,727 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-09-26 08:24:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:13,728 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:24:13,728 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:24:13,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:24:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:24:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:24:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:24:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:24:13,733 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:24:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:13,734 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:24:13,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:24:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:24:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:24:13,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:13,735 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:24:13,735 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:13,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-09-26 08:24:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:14,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:24:14,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:24:14,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:24:14,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:14,275 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-09-26 08:24:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,306 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:24:14,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:24:14,307 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-09-26 08:24:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,307 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:24:14,307 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:24:14,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:24:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:24:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:24:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:24:14,313 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:24:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,313 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:24:14,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:24:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:24:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:24:14,314 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,314 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:24:14,314 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-09-26 08:24:14,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:14,881 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:14,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:24:14,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:24:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:24:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:14,882 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-09-26 08:24:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:14,916 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:24:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:24:14,916 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-09-26 08:24:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:14,917 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:24:14,917 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:24:14,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:24:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:24:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:24:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:24:14,923 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:24:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:14,923 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:24:14,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:24:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:24:14,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:24:14,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:14,924 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:24:14,924 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:14,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-09-26 08:24:14,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:15,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:15,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:24:15,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:24:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:24:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:15,431 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-09-26 08:24:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:15,466 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:24:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:24:15,466 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-09-26 08:24:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:15,467 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:24:15,467 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:24:15,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:24:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:24:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:24:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:24:15,476 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:24:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:15,476 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:24:15,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:24:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:24:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:24:15,477 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:15,477 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:24:15,477 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:15,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-09-26 08:24:15,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:16,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:16,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:24:16,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:24:16,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:24:16,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:24:16,019 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-09-26 08:24:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:16,059 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:24:16,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:24:16,060 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-09-26 08:24:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:16,060 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:24:16,061 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:24:16,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:24:16,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:24:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:24:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:24:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:24:16,067 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:24:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:16,067 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:24:16,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:24:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:24:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:24:16,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:16,068 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:24:16,068 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:16,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-09-26 08:24:16,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:16,641 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:16,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:24:16,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:24:16,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:24:16,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:16,642 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-09-26 08:24:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:16,684 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:24:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:24:16,685 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-09-26 08:24:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:16,685 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:24:16,685 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:24:16,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:24:16,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:24:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:24:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:24:16,691 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:24:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:16,692 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:24:16,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:24:16,692 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:24:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:24:16,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:16,692 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:24:16,693 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:16,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-09-26 08:24:16,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:17,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:17,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:24:17,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:24:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:24:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:24:17,290 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-09-26 08:24:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:17,349 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:24:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:24:17,350 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-09-26 08:24:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:17,350 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:24:17,351 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:24:17,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:24:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:24:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:24:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:24:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:24:17,362 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:24:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:17,362 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:24:17,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:24:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:24:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:24:17,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:17,365 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:24:17,365 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:17,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:17,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-09-26 08:24:17,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:18,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:24:18,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:24:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:24:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:18,102 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-09-26 08:24:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:18,135 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:24:18,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:24:18,136 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-09-26 08:24:18,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:18,136 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:24:18,136 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:24:18,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:24:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:24:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:24:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:24:18,143 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:24:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:18,143 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:24:18,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:24:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:24:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:24:18,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:18,144 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:24:18,144 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:18,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-09-26 08:24:18,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:18,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:18,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:24:18,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:24:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:24:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:24:18,720 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-09-26 08:24:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:18,765 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:24:18,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:24:18,765 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-09-26 08:24:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:18,766 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:24:18,766 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:24:18,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:24:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:24:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:24:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:24:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:24:18,771 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:24:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:18,772 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:24:18,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:24:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:24:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:24:18,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:18,772 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:24:18,773 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:18,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-09-26 08:24:18,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:19,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:19,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:24:19,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:24:19,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:24:19,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:19,351 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-09-26 08:24:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:19,400 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:24:19,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:24:19,401 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-09-26 08:24:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:19,402 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:24:19,402 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:24:19,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:24:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:24:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:24:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:24:19,408 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:24:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:19,408 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:24:19,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:24:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:24:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:24:19,409 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:19,409 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:24:19,409 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:19,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-09-26 08:24:19,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:20,044 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:20,044 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:24:20,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:24:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:24:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:20,046 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-09-26 08:24:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:20,093 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:24:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:24:20,093 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-09-26 08:24:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:20,094 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:24:20,094 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:24:20,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:24:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:24:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:24:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:24:20,101 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:24:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:20,102 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:24:20,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:24:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:24:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:24:20,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:20,103 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:24:20,103 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-09-26 08:24:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:20,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:20,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:24:20,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:24:20,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:24:20,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:20,701 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-09-26 08:24:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:20,736 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:24:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:24:20,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-09-26 08:24:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:20,737 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:24:20,737 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:24:20,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:24:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:24:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:24:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:24:20,743 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:24:20,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:20,743 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:24:20,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:24:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:24:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:24:20,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:20,744 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:24:20,744 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:20,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:20,745 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-09-26 08:24:20,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:21,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:21,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:24:21,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:24:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:24:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:21,339 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-09-26 08:24:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:21,390 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:24:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:24:21,390 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-09-26 08:24:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:21,391 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:24:21,391 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:24:21,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:24:21,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:24:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:24:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:24:21,397 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:24:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:21,397 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:24:21,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:24:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:24:21,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:24:21,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:21,398 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:24:21,398 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:21,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-09-26 08:24:21,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:22,035 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:22,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:24:22,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:24:22,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:24:22,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:22,037 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-09-26 08:24:22,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:22,089 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:24:22,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:24:22,089 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-09-26 08:24:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:22,090 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:24:22,090 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:24:22,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:24:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:24:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:24:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:24:22,095 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:24:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:22,096 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:24:22,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:24:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:24:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:24:22,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:22,096 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:24:22,097 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:22,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-09-26 08:24:22,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:22,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:22,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:24:22,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:24:22,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:24:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:22,785 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-09-26 08:24:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:22,836 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:24:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:24:22,837 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-09-26 08:24:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:22,837 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:24:22,837 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:24:22,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:24:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:24:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:24:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:24:22,842 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:24:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:22,843 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:24:22,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:24:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:24:22,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:24:22,843 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:22,844 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:24:22,844 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:22,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-09-26 08:24:22,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:23,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:23,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:24:23,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:24:23,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:24:23,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:23,527 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-09-26 08:24:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:23,585 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:24:23,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:24:23,585 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-09-26 08:24:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:23,586 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:24:23,586 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:24:23,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:24:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:24:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:24:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:24:23,591 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:24:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:23,592 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:24:23,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:24:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:24:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:24:23,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:23,593 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:24:23,593 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:23,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-09-26 08:24:23,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:24,423 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:24,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:24:24,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:24:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:24:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:24,424 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-09-26 08:24:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:24,481 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:24:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:24:24,481 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-09-26 08:24:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:24,482 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:24:24,482 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:24:24,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:24:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:24:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:24:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:24:24,490 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:24:24,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:24,491 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:24:24,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:24:24,491 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:24:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:24:24,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:24,498 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:24:24,498 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:24,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-09-26 08:24:24,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:25,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:25,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:24:25,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:24:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:24:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:25,223 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-09-26 08:24:25,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:25,268 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:24:25,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:24:25,269 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-09-26 08:24:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:25,269 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:24:25,270 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:24:25,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:24:25,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:24:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:24:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:24:25,276 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:24:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:25,276 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:24:25,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:24:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:24:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:24:25,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:25,277 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:24:25,278 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:25,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-09-26 08:24:25,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:25,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:25,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:24:25,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:24:25,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:24:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:25,865 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-09-26 08:24:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:25,923 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:24:25,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:24:25,923 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-09-26 08:24:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:25,924 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:24:25,924 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:24:25,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:24:25,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:24:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:24:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:24:25,930 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:24:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:25,930 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:24:25,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:24:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:24:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:24:25,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:25,931 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:24:25,931 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:25,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:25,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-09-26 08:24:25,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:26,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:26,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:24:26,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:24:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:24:26,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:26,565 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-09-26 08:24:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:26,606 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:24:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:24:26,606 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-09-26 08:24:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:26,607 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:24:26,607 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:24:26,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:24:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:24:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:24:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:24:26,613 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:24:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:26,613 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:24:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:24:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:24:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:24:26,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:26,614 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:24:26,614 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:26,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-09-26 08:24:26,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:27,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:27,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:24:27,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:24:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:24:27,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:27,249 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-09-26 08:24:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:27,330 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:24:27,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:24:27,331 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-09-26 08:24:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:27,331 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:24:27,331 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:24:27,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:24:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:24:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:24:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:24:27,337 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:24:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:27,337 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:24:27,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:24:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:24:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:24:27,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:27,338 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:24:27,339 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:27,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-09-26 08:24:27,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:28,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:28,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:24:28,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:24:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:24:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:28,103 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-09-26 08:24:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:28,166 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:24:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:24:28,166 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-09-26 08:24:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:28,167 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:24:28,167 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:24:28,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:28,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:24:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:24:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:24:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:24:28,173 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:24:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:28,174 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:24:28,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:24:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:24:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:24:28,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:28,175 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:24:28,175 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:28,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:28,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-09-26 08:24:28,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:28,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:28,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:24:28,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:24:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:24:28,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:28,769 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-09-26 08:24:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:28,822 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:24:28,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:24:28,822 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-09-26 08:24:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:28,823 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:24:28,823 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:24:28,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:24:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:24:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:24:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:24:28,829 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:24:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:28,829 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:24:28,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:24:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:24:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:24:28,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:28,830 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:24:28,830 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:28,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:28,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-09-26 08:24:28,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:29,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:29,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:24:29,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:24:29,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:24:29,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:29,465 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-09-26 08:24:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:29,506 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:24:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:24:29,507 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-09-26 08:24:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:29,507 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:24:29,507 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:24:29,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:29,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:24:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:24:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:24:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:24:29,513 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:24:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:29,513 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:24:29,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:24:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:24:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:24:29,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:29,514 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:24:29,515 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:29,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-09-26 08:24:29,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:30,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:30,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:24:30,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:24:30,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:24:30,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:30,236 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-09-26 08:24:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:30,291 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:24:30,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:24:30,291 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-09-26 08:24:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:30,292 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:24:30,292 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:24:30,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:24:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:24:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:24:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:24:30,299 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:24:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:30,300 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:24:30,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:24:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:24:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:24:30,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:30,301 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:24:30,301 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:30,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:30,302 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-09-26 08:24:30,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:31,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:31,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:24:31,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:24:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:24:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:31,076 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-09-26 08:24:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:31,129 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:24:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:24:31,130 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-09-26 08:24:31,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:31,130 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:24:31,131 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:24:31,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:24:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:24:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:24:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:24:31,136 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:24:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:31,137 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:24:31,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:24:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:24:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:24:31,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:31,138 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:24:31,138 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:31,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:31,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-09-26 08:24:31,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:31,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:31,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:24:31,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:24:31,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:24:31,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:31,833 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-09-26 08:24:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:31,892 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:24:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:24:31,892 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-09-26 08:24:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:31,893 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:24:31,893 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:24:31,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:31,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:24:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:24:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:24:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:24:31,897 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:24:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:31,897 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:24:31,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:24:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:24:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:24:31,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:31,898 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:24:31,898 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:31,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:31,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-09-26 08:24:31,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:32,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:32,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:24:32,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:24:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:24:32,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:32,895 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-09-26 08:24:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:32,978 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:24:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:24:32,978 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-09-26 08:24:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:32,979 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:24:32,979 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:24:32,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:24:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:24:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:24:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:24:32,986 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:24:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:32,986 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:24:32,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:24:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:24:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:24:32,987 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:32,987 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:24:32,987 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:32,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:32,987 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-09-26 08:24:32,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:33,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:33,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:24:33,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:24:33,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:24:33,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:33,953 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-09-26 08:24:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:34,005 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:24:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:24:34,005 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-09-26 08:24:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:34,006 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:24:34,006 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:24:34,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:24:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:24:34,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:24:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:24:34,012 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:24:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:34,012 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:24:34,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:24:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:24:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:24:34,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:34,013 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:24:34,013 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:34,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-09-26 08:24:34,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:34,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:34,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:34,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:24:34,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:24:34,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:24:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:24:34,983 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-09-26 08:24:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,073 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:24:35,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:24:35,073 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-09-26 08:24:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,074 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:24:35,074 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:24:35,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:24:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:24:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:24:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:24:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:24:35,081 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:24:35,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,081 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:24:35,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:24:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:24:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:24:35,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,083 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:24:35,083 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-09-26 08:24:35,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,942 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:24:35,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:24:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:24:35,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:24:35,944 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-09-26 08:24:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,005 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:24:36,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:24:36,006 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-09-26 08:24:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,007 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:24:36,007 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:24:36,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:24:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:24:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:24:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:24:36,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:24:36,012 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:24:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,013 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:24:36,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:24:36,013 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:24:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:24:36,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,013 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:24:36,014 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-09-26 08:24:36,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:24:36,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:24:36,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:24:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:36,777 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-09-26 08:24:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,847 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:24:36,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:24:36,847 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-09-26 08:24:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,848 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:24:36,848 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:24:36,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:24:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:24:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:24:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:24:36,854 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:24:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,854 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:24:36,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:24:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:24:36,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:24:36,855 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,855 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:24:36,855 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,855 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-09-26 08:24:36,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:24:37,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:24:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:24:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:24:37,821 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-09-26 08:24:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,860 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:24:37,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:24:37,860 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-09-26 08:24:37,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,861 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:24:37,861 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:24:37,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:24:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:24:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:24:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:24:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:24:37,867 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:24:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,867 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:24:37,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:24:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:24:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:24:37,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,868 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:24:37,868 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,868 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-09-26 08:24:37,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:24:38,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:24:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:24:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:24:38,643 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-09-26 08:24:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,691 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:24:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:24:38,692 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-09-26 08:24:38,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,692 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:24:38,692 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:24:38,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:24:38,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:24:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:24:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:24:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:24:38,698 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:24:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,699 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:24:38,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:24:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:24:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:24:38,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,700 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:24:38,700 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-09-26 08:24:38,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:39,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:39,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:24:39,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:24:39,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:24:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:24:39,776 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-09-26 08:24:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,842 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:24:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:24:39,842 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-09-26 08:24:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,843 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:24:39,843 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:24:39,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:24:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:24:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:24:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:24:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:24:39,848 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:24:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,849 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:24:39,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:24:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:24:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:24:39,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,849 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:24:39,849 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,850 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-09-26 08:24:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:24:40,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:24:40,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:24:40,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:24:40,747 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-09-26 08:24:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,812 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:24:40,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:24:40,812 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-09-26 08:24:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,812 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:24:40,812 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:24:40,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:24:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:24:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:24:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:24:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:24:40,817 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:24:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,817 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:24:40,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:24:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:24:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:24:40,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,818 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:24:40,819 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-09-26 08:24:40,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,574 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:24:41,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:24:41,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:24:41,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:41,575 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-09-26 08:24:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,618 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:24:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:24:41,618 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-09-26 08:24:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,619 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:24:41,619 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:24:41,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:24:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:24:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:24:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:24:41,624 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:24:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,624 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:24:41,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:24:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:24:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:24:41,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,625 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:24:41,625 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-09-26 08:24:41,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:24:42,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:24:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:24:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:42,493 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-09-26 08:24:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,561 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:24:42,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:24:42,561 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-09-26 08:24:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,562 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:24:42,562 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:24:42,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:24:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:24:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:24:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:24:42,569 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:24:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,569 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:24:42,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:24:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:24:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:24:42,570 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,570 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:24:42,570 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,571 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-09-26 08:24:42,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:24:43,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:24:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:24:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:43,510 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-09-26 08:24:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,586 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:24:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:24:43,586 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-09-26 08:24:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,587 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:24:43,587 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:24:43,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:24:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:24:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:24:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:24:43,593 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:24:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,594 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:24:43,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:24:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:24:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:24:43,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,595 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:24:43,595 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-09-26 08:24:43,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:24:44,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:24:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:24:44,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:44,672 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-09-26 08:24:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,727 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:24:44,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:24:44,727 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-09-26 08:24:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,728 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:24:44,728 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:24:44,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:24:44,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:24:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:24:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:24:44,734 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:24:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,735 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:24:44,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:24:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:24:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:24:44,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,735 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:24:44,736 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-09-26 08:24:44,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:24:45,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:24:45,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:24:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:45,528 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-09-26 08:24:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,602 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:24:45,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:24:45,603 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-09-26 08:24:45,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,604 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:24:45,604 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:24:45,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:24:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:24:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:24:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:24:45,611 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:24:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,611 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:24:45,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:24:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:24:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:24:45,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,612 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:24:45,612 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,613 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-09-26 08:24:45,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:24:46,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:24:46,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:24:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:46,935 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-09-26 08:24:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,002 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:24:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:24:47,002 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-09-26 08:24:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,003 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:24:47,003 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:24:47,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:24:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:24:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:24:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:24:47,012 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:24:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,012 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:24:47,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:24:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:24:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:24:47,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,013 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:24:47,013 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-09-26 08:24:47,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,115 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:24:48,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:24:48,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:24:48,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:24:48,116 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-09-26 08:24:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,186 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:24:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:24:48,187 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-09-26 08:24:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,187 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:24:48,187 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:24:48,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:24:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:24:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:24:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:24:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:24:48,194 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:24:48,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,194 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:24:48,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:24:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:24:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:24:48,195 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,195 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-09-26 08:24:48,195 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-09-26 08:24:48,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:24:49,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:24:49,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:24:49,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:24:49,052 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-09-26 08:24:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,095 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:24:49,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:24:49,095 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-09-26 08:24:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,095 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:24:49,095 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:24:49,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:24:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:24:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:24:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:24:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:24:49,102 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:24:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,103 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:24:49,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:24:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:24:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:24:49,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,104 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-09-26 08:24:49,104 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-09-26 08:24:49,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:24:49,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:24:49,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:24:49,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:24:49,950 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-09-26 08:24:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,021 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:24:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:24:50,021 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-09-26 08:24:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,022 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:24:50,022 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:24:50,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:24:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:24:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:24:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:24:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:24:50,027 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:24:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,027 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:24:50,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:24:50,027 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:24:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:24:50,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,028 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-09-26 08:24:50,028 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-09-26 08:24:50,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:24:50,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:24:50,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:24:50,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:24:50,959 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-09-26 08:24:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,033 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:24:51,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:24:51,033 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-09-26 08:24:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,034 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:24:51,034 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:24:51,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:24:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:24:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:24:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:24:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:24:51,039 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:24:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,039 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:24:51,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:24:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:24:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:24:51,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,040 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-09-26 08:24:51,040 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-09-26 08:24:51,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:24:52,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:24:52,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:24:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:24:52,238 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-09-26 08:24:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,286 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:24:52,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:24:52,286 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-09-26 08:24:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,287 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:24:52,287 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:24:52,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:24:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:24:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:24:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:24:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:24:52,292 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:24:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,292 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:24:52,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:24:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:24:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:24:52,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,293 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-09-26 08:24:52,293 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,293 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-09-26 08:24:52,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:24:53,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:24:53,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:24:53,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:24:53,253 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-09-26 08:24:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,320 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:24:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:24:53,321 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-09-26 08:24:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,321 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:24:53,321 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:24:53,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:24:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:24:53,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:24:53,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:24:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:24:53,328 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:24:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,328 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:24:53,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:24:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:24:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:24:53,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,329 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-09-26 08:24:53,329 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-09-26 08:24:53,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:24:54,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:24:54,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:24:54,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:24:54,351 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-09-26 08:24:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,460 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:24:54,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:24:54,461 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-09-26 08:24:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,461 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:24:54,461 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:24:54,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:24:54,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:24:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:24:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:24:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:24:54,468 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:24:54,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,468 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:24:54,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:24:54,469 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:24:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:24:54,469 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,469 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-09-26 08:24:54,470 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-09-26 08:24:54,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:24:55,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:24:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:24:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:24:55,618 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-09-26 08:24:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,739 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:24:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:24:55,740 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-09-26 08:24:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,740 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:24:55,740 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:24:55,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:24:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:24:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:24:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:24:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:24:55,747 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:24:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,747 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:24:55,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:24:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:24:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:24:55,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,748 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-09-26 08:24:55,748 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,748 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-09-26 08:24:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:24:56,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:24:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:24:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:24:56,749 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-09-26 08:24:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,827 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:24:56,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:24:56,827 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-09-26 08:24:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,828 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:24:56,828 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:24:56,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:24:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:24:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:24:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:24:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:24:56,835 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:24:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,836 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:24:56,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:24:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:24:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:24:56,836 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,837 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-09-26 08:24:56,837 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-09-26 08:24:56,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,970 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:24:57,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:24:57,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:24:57,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:24:57,973 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-09-26 08:24:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,033 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:24:58,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:24:58,033 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-09-26 08:24:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,033 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:24:58,034 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:24:58,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:24:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:24:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:24:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:24:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:24:58,039 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:24:58,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,039 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:24:58,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:24:58,039 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:24:58,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:24:58,040 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,040 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-09-26 08:24:58,040 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,041 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-09-26 08:24:58,041 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,212 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,212 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:24:59,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:24:59,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:24:59,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:24:59,214 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-09-26 08:24:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,291 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:24:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:24:59,291 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-09-26 08:24:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,292 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:24:59,292 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:24:59,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:24:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:24:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:24:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:24:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:24:59,298 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:24:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,298 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:24:59,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:24:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:24:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:24:59,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,299 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-09-26 08:24:59,299 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:59,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,300 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-09-26 08:24:59,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:25:00,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:25:00,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:25:00,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:00,653 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-09-26 08:25:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,725 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:25:00,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:25:00,725 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-09-26 08:25:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,725 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:25:00,726 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:25:00,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:25:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:25:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:25:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:25:00,733 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:25:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,734 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:25:00,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:25:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:25:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:25:00,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,735 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-09-26 08:25:00,735 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-09-26 08:25:00,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:25:02,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:25:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:25:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:25:02,030 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-09-26 08:25:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,105 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:25:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:25:02,105 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-09-26 08:25:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,106 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:25:02,106 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:25:02,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:25:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:25:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:25:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:25:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:25:02,111 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:25:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,112 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:25:02,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:25:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:25:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:25:02,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,112 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-09-26 08:25:02,112 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-09-26 08:25:02,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:25:03,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:25:03,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:25:03,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:03,489 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-09-26 08:25:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,565 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:25:03,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:25:03,566 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-09-26 08:25:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,566 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:25:03,566 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:25:03,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:25:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:25:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:25:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:25:03,572 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:25:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,572 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:25:03,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:25:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:25:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:25:03,572 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,572 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-09-26 08:25:03,573 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:03,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-09-26 08:25:03,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:04,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:04,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:25:04,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:25:04,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:25:04,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:04,971 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-09-26 08:25:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,051 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:25:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:25:05,052 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-09-26 08:25:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,052 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:25:05,052 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:25:05,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:25:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:25:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:25:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:25:05,059 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:25:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,060 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:25:05,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:25:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:25:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:25:05,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,060 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-09-26 08:25:05,061 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:05,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-09-26 08:25:05,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:25:06,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:25:06,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:25:06,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:25:06,297 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-09-26 08:25:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:06,398 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:25:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:25:06,398 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-09-26 08:25:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:06,399 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:25:06,399 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:25:06,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:25:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:25:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:25:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:25:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:25:06,407 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:25:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:06,407 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:25:06,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:25:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:25:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:25:06,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:06,408 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-09-26 08:25:06,408 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:06,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-09-26 08:25:06,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:07,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:07,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:25:07,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:25:07,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:25:07,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:25:07,767 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-09-26 08:25:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:07,865 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:25:07,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:25:07,866 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-09-26 08:25:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:07,866 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:25:07,866 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:25:07,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:25:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:25:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:25:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:25:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:25:07,872 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-09-26 08:25:07,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:07,873 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:25:07,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:25:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:25:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:25:07,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:07,873 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-09-26 08:25:07,873 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:07,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:07,874 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-09-26 08:25:07,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:09,319 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:09,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:25:09,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:25:09,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:25:09,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:25:09,321 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-09-26 08:25:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,450 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:25:09,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:25:09,450 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-09-26 08:25:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,451 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:25:09,451 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:25:09,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:25:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:25:09,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:25:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:25:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:25:09,458 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-09-26 08:25:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,459 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:25:09,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:25:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:25:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:25:09,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,460 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-09-26 08:25:09,460 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:09,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-09-26 08:25:09,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:25:10,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:25:10,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:25:10,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:25:10,759 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-09-26 08:25:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:10,842 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:25:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:25:10,842 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-09-26 08:25:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:10,842 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:25:10,843 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:25:10,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:25:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:25:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:25:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:25:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:25:10,849 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-09-26 08:25:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:10,849 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:25:10,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:25:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:25:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:25:10,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:10,850 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-09-26 08:25:10,850 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:10,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-09-26 08:25:10,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:12,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:12,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:25:12,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:25:12,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:25:12,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:25:12,217 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-09-26 08:25:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:12,297 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:25:12,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:25:12,297 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-09-26 08:25:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:12,298 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:25:12,298 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:25:12,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:25:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:25:12,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:25:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:25:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:25:12,306 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-09-26 08:25:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:12,306 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:25:12,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:25:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:25:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:25:12,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:12,307 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-09-26 08:25:12,308 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:12,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-09-26 08:25:12,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:25:14,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:25:14,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:25:14,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:25:14,061 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-09-26 08:25:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,183 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:25:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:25:14,183 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-09-26 08:25:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,183 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:25:14,183 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:25:14,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:25:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:25:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:25:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:25:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:25:14,189 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-09-26 08:25:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,189 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:25:14,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:25:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:25:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:25:14,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,190 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-09-26 08:25:14,190 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-09-26 08:25:14,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,559 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,559 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:25:15,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:25:15,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:25:15,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:25:15,564 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-09-26 08:25:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,707 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:25:15,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:25:15,708 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-09-26 08:25:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,708 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:25:15,708 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:25:15,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:25:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:25:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:25:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:25:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:25:15,714 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-09-26 08:25:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,714 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:25:15,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:25:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:25:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:25:15,715 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,715 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-09-26 08:25:15,715 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-09-26 08:25:15,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:25:17,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:25:17,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:25:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:25:17,174 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-09-26 08:25:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,304 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:25:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:25:17,304 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-09-26 08:25:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,305 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:25:17,305 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:25:17,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:25:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:25:17,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:25:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:25:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:25:17,311 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-09-26 08:25:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,311 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:25:17,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:25:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:25:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:25:17,311 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,312 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-09-26 08:25:17,312 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-09-26 08:25:17,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:25:18,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:25:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:25:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:25:18,882 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-09-26 08:25:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,023 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:25:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:25:19,023 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-09-26 08:25:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,023 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:25:19,023 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:25:19,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:25:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:25:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:25:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:25:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:25:19,031 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-09-26 08:25:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,031 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:25:19,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:25:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:25:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:25:19,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,031 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-09-26 08:25:19,032 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-09-26 08:25:19,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:25:20,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:25:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:25:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:25:20,424 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-09-26 08:25:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,508 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:25:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:25:20,509 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-09-26 08:25:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,509 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:25:20,509 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:25:20,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:25:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:25:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:25:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:25:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:25:20,517 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-09-26 08:25:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,518 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:25:20,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:25:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:25:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:25:20,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,519 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-09-26 08:25:20,519 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-09-26 08:25:20,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:25:22,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:25:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:25:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:25:22,082 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-09-26 08:25:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,244 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:25:22,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:25:22,244 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-09-26 08:25:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,245 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:25:22,245 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:25:22,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:25:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:25:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:25:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:25:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:25:22,250 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-09-26 08:25:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,250 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:25:22,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:25:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:25:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:25:22,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,251 INFO L375 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-09-26 08:25:22,251 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,251 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-09-26 08:25:22,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:23,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:23,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:25:23,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:25:23,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:25:23,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:25:23,792 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-09-26 08:25:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:23,915 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:25:23,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:25:23,916 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-09-26 08:25:23,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:23,916 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:25:23,916 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:25:23,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:25:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:25:23,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:25:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:25:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:25:23,923 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-09-26 08:25:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:23,924 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:25:23,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:25:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:25:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:25:23,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:23,925 INFO L375 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-09-26 08:25:23,925 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:23,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-09-26 08:25:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:25,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:25,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:25:25,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:25:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:25:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:25:25,307 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-09-26 08:25:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,407 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:25:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:25:25,408 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-09-26 08:25:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,408 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:25:25,408 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:25:25,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:25:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:25:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:25:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:25:25,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:25:25,416 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-09-26 08:25:25,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,416 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:25:25,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:25:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:25:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:25:25,417 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,417 INFO L375 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-09-26 08:25:25,417 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:25,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-09-26 08:25:25,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:25:26,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:25:26,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:25:26,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:25:26,941 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-09-26 08:25:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:27,060 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:25:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:25:27,060 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-09-26 08:25:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:27,061 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:25:27,061 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:25:27,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:25:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:25:27,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:25:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:25:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:25:27,067 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-09-26 08:25:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:27,067 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:25:27,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:25:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:25:27,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:25:27,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:27,068 INFO L375 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-09-26 08:25:27,068 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:27,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:27,068 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2018-09-26 08:25:27,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:25:28,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:25:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:25:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:25:28,466 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-09-26 08:25:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:28,676 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:25:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:25:28,676 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-09-26 08:25:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:28,677 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:25:28,677 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:25:28,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:25:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:25:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:25:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:25:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:25:28,685 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-09-26 08:25:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:28,685 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:25:28,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:25:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:25:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:25:28,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:28,686 INFO L375 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-09-26 08:25:28,687 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:28,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2018-09-26 08:25:28,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:30,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:30,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:25:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:25:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:25:30,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:25:30,330 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-09-26 08:25:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,439 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:25:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:25:30,440 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-09-26 08:25:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,440 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:25:30,440 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:25:30,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:25:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:25:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:25:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:25:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:25:30,448 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-09-26 08:25:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:30,448 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:25:30,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:25:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:25:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:25:30,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:30,449 INFO L375 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-09-26 08:25:30,449 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:30,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:30,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2018-09-26 08:25:30,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:32,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:32,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:25:32,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:25:32,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:25:32,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:25:32,026 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-09-26 08:25:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:32,170 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:25:32,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:25:32,171 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-09-26 08:25:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:32,171 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:25:32,171 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:25:32,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:25:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:25:32,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:25:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:25:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:25:32,177 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-09-26 08:25:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:32,177 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:25:32,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:25:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:25:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:25:32,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:32,178 INFO L375 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-09-26 08:25:32,178 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:32,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:32,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2018-09-26 08:25:32,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:33,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:33,739 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:33,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:25:33,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:25:33,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:25:33,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:25:33,742 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-09-26 08:25:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,882 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:25:33,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:25:33,882 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-09-26 08:25:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,883 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:25:33,883 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:25:33,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:25:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:25:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:25:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:25:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:25:33,888 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-09-26 08:25:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:33,888 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:25:33,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:25:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:25:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:25:33,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:33,888 INFO L375 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-09-26 08:25:33,889 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:33,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432762, now seen corresponding path program 119 times [2018-09-26 08:25:33,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:35,496 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:35,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:25:35,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:25:35,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:25:35,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:25:35,499 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-09-26 08:25:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:35,601 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:25:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:25:35,602 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-09-26 08:25:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:35,602 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:25:35,602 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:25:35,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:25:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:25:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:25:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:25:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:25:35,608 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-09-26 08:25:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:35,608 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:25:35,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:25:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:25:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:25:35,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:35,608 INFO L375 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-09-26 08:25:35,609 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:35,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash -900681120, now seen corresponding path program 120 times [2018-09-26 08:25:35,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:37,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:37,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:25:37,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:25:37,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:25:37,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:25:37,228 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-09-26 08:25:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:37,394 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:25:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:25:37,394 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-09-26 08:25:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:37,395 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:25:37,395 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:25:37,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:25:37,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:25:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:25:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:25:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:25:37,400 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-09-26 08:25:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:25:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:25:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:25:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:25:37,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,402 INFO L375 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-09-26 08:25:37,402 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:37,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652486, now seen corresponding path program 121 times [2018-09-26 08:25:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:39,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:39,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:25:39,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:25:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:25:39,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:25:39,108 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-09-26 08:25:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:39,194 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:25:39,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:25:39,194 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-09-26 08:25:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:39,194 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:25:39,194 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:25:39,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:25:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:25:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:25:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:25:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:25:39,199 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-09-26 08:25:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:39,200 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:25:39,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:25:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:25:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:25:39,200 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:39,200 INFO L375 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-09-26 08:25:39,200 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:39,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713760, now seen corresponding path program 122 times [2018-09-26 08:25:39,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:40,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:40,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:25:40,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:25:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:25:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:25:40,861 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-09-26 08:25:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,055 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:25:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:25:41,055 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-09-26 08:25:41,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,055 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:25:41,055 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:25:41,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:25:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:25:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:25:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:25:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:25:41,060 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-09-26 08:25:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:41,060 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:25:41,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:25:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:25:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:25:41,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:41,061 INFO L375 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-09-26 08:25:41,061 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:41,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:41,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386746, now seen corresponding path program 123 times [2018-09-26 08:25:41,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:42,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:42,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:25:42,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:25:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:25:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:25:42,628 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-09-26 08:25:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:42,735 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:25:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:25:42,735 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-09-26 08:25:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:42,736 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:25:42,736 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:25:42,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:25:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:25:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:25:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:25:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:25:42,744 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-09-26 08:25:42,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:42,745 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:25:42,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:25:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:25:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:25:42,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:42,745 INFO L375 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-09-26 08:25:42,746 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:42,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash -321352736, now seen corresponding path program 124 times [2018-09-26 08:25:42,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:44,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:44,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:25:44,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:25:44,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:25:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:25:44,451 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-09-26 08:25:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:44,628 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:25:44,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:25:44,629 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-09-26 08:25:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:44,629 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:25:44,629 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:25:44,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:25:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:25:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:25:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:25:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:25:44,637 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-09-26 08:25:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:44,637 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:25:44,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:25:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:25:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:25:44,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:44,638 INFO L375 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-09-26 08:25:44,639 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:44,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:44,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004090, now seen corresponding path program 125 times [2018-09-26 08:25:44,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:46,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:46,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:25:46,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:25:46,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:25:46,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:25:46,238 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-09-26 08:25:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:46,331 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:25:46,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:25:46,331 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-09-26 08:25:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:46,332 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:25:46,332 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:25:46,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:25:46,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:25:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:25:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:25:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:25:46,337 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-09-26 08:25:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:46,337 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:25:46,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:25:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:25:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:25:46,338 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:46,338 INFO L375 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-09-26 08:25:46,338 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:46,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash 417542304, now seen corresponding path program 126 times [2018-09-26 08:25:46,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:48,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:48,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:25:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:25:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:25:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:25:48,258 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-09-26 08:25:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:48,445 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:25:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:25:48,445 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-09-26 08:25:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:48,446 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:25:48,446 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:25:48,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:25:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:25:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:25:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:25:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:25:48,450 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-09-26 08:25:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:48,451 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:25:48,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:25:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:25:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:25:48,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:48,452 INFO L375 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-09-26 08:25:48,452 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:48,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash 58905670, now seen corresponding path program 127 times [2018-09-26 08:25:48,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:50,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:50,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:25:50,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:25:50,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:25:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:25:50,150 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-09-26 08:25:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:50,247 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:25:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:25:50,248 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-09-26 08:25:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:50,248 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:25:50,248 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:25:50,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:25:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:25:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:25:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:25:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:25:50,255 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-09-26 08:25:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:50,255 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:25:50,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:25:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:25:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:25:50,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:50,256 INFO L375 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-09-26 08:25:50,256 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:50,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071904, now seen corresponding path program 128 times [2018-09-26 08:25:50,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:52,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:52,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:25:52,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:25:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:25:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:25:52,204 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-09-26 08:25:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:52,393 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:25:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:25:52,393 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-09-26 08:25:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:52,394 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:25:52,394 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:25:52,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:25:52,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:25:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:25:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:25:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:25:52,401 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-09-26 08:25:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:52,401 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:25:52,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:25:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:25:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:25:52,402 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:52,402 INFO L375 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-09-26 08:25:52,402 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:52,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash 773650310, now seen corresponding path program 129 times [2018-09-26 08:25:52,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:54,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:54,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:25:54,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:25:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:25:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:25:54,191 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-09-26 08:25:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:54,425 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:25:54,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:25:54,425 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-09-26 08:25:54,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:54,426 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:25:54,426 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:25:54,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:25:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:25:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:25:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:25:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:25:54,432 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-09-26 08:25:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:54,432 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:25:54,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:25:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:25:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:25:54,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:54,432 INFO L375 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-09-26 08:25:54,433 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:54,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:54,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648032, now seen corresponding path program 130 times [2018-09-26 08:25:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:56,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:56,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:25:56,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:25:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:25:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:25:56,455 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-09-26 08:25:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:56,622 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:25:56,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:25:56,622 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-09-26 08:25:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:56,623 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:25:56,623 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:25:56,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:25:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:25:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:25:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:25:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:25:56,629 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-09-26 08:25:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:56,629 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:25:56,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:25:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:25:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:25:56,629 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:56,629 INFO L375 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-09-26 08:25:56,630 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:56,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash 448481990, now seen corresponding path program 131 times [2018-09-26 08:25:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:58,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:58,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:25:58,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:25:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:25:58,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:58,676 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-09-26 08:25:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:58,891 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:25:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:25:58,891 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-09-26 08:25:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:58,892 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:25:58,892 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:25:58,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:25:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:25:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:25:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:25:58,900 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-09-26 08:25:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:58,900 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:25:58,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:25:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:25:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:25:58,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:58,901 INFO L375 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-09-26 08:25:58,901 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:58,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035936, now seen corresponding path program 132 times [2018-09-26 08:25:58,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:00,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:00,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:26:00,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:26:00,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:26:00,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:26:00,893 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-09-26 08:26:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:01,093 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:26:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:26:01,093 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-09-26 08:26:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:01,094 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:26:01,094 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:26:01,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:26:01,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:26:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:26:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:26:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:26:01,099 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-09-26 08:26:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:01,099 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:26:01,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:26:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:26:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:26:01,100 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:01,100 INFO L375 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-09-26 08:26:01,100 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:01,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1494339078, now seen corresponding path program 133 times [2018-09-26 08:26:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:03,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:03,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:26:03,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:26:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:26:03,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:26:03,038 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-09-26 08:26:03,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:03,202 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:26:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:26:03,202 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-09-26 08:26:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:03,203 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:26:03,203 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:26:03,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:26:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:26:03,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:26:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:26:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:26:03,211 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-09-26 08:26:03,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:03,211 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:26:03,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:26:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:26:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:26:03,212 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:03,212 INFO L375 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-09-26 08:26:03,213 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:03,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:03,213 INFO L82 PathProgramCache]: Analyzing trace with hash -920132704, now seen corresponding path program 134 times [2018-09-26 08:26:03,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:05,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:05,408 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:05,408 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:26:05,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:26:05,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:26:05,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:26:05,411 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-09-26 08:26:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:05,664 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:26:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:26:05,664 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-09-26 08:26:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:05,664 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:26:05,664 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:26:05,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:26:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:26:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:26:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:26:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:26:05,670 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-09-26 08:26:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:05,670 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:26:05,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:26:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:26:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:26:05,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:05,671 INFO L375 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-09-26 08:26:05,671 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:05,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:05,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653382, now seen corresponding path program 135 times [2018-09-26 08:26:05,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:07,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:07,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:26:07,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:26:07,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:26:07,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:26:07,675 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-09-26 08:26:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:07,938 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:26:07,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:26:07,938 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-09-26 08:26:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:07,939 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:26:07,939 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:26:07,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:26:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:26:07,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:26:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:26:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:26:07,945 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-09-26 08:26:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:07,945 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:26:07,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:26:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:26:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:26:07,946 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:07,946 INFO L375 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-09-26 08:26:07,946 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:07,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 515610720, now seen corresponding path program 136 times [2018-09-26 08:26:07,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:10,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:10,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:26:10,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:26:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:26:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:26:10,150 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-09-26 08:26:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:10,289 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:26:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:26:10,289 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-09-26 08:26:10,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:10,290 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:26:10,290 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:26:10,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:26:10,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:26:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:26:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:26:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:26:10,295 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-09-26 08:26:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:10,296 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:26:10,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:26:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:26:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:26:10,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:10,296 INFO L375 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-09-26 08:26:10,296 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:10,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940730, now seen corresponding path program 137 times [2018-09-26 08:26:10,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:12,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:12,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:26:12,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:26:12,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:26:12,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:26:12,306 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-09-26 08:26:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:12,529 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:26:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:26:12,529 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-09-26 08:26:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:12,530 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:26:12,530 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:26:12,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:26:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:26:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:26:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:26:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:26:12,536 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-09-26 08:26:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:12,536 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:26:12,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:26:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:26:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:26:12,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:12,536 INFO L375 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-09-26 08:26:12,536 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:12,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539168, now seen corresponding path program 138 times [2018-09-26 08:26:12,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:14,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:14,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:26:14,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:26:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:26:14,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:26:14,757 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-09-26 08:26:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:14,988 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:26:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:26:14,989 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-09-26 08:26:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:14,989 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:26:14,989 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:26:14,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:26:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:26:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:26:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:26:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:26:14,997 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-09-26 08:26:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:14,998 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:26:14,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:26:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:26:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:26:14,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:14,998 INFO L375 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-09-26 08:26:14,999 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:14,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:14,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1752070086, now seen corresponding path program 139 times [2018-09-26 08:26:14,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:17,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:17,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:26:17,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:26:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:26:17,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:26:17,029 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-09-26 08:26:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:17,346 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:26:17,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:26:17,347 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-09-26 08:26:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:17,347 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:26:17,347 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:26:17,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:26:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:26:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:26:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:26:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:26:17,356 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-09-26 08:26:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:17,356 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:26:17,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:26:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:26:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:26:17,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:17,357 INFO L375 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-09-26 08:26:17,357 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:17,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:17,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406048, now seen corresponding path program 140 times [2018-09-26 08:26:17,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:19,588 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:19,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:26:19,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:26:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:26:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:26:19,590 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-09-26 08:26:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:19,812 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:26:19,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:26:19,812 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-09-26 08:26:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:19,812 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:26:19,812 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:26:19,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:26:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:26:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:26:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:26:19,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:26:19,818 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-09-26 08:26:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:19,818 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:26:19,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:26:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:26:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:26:19,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:19,819 INFO L375 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-09-26 08:26:19,819 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:19,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:19,819 INFO L82 PathProgramCache]: Analyzing trace with hash 112048902, now seen corresponding path program 141 times [2018-09-26 08:26:19,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:26:22,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:26:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:26:22,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:26:22,169 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-09-26 08:26:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,324 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:26:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:26:22,324 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-09-26 08:26:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,325 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:26:22,325 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:26:22,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:26:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:26:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:26:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:26:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:26:22,331 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-09-26 08:26:22,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,331 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:26:22,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:26:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:26:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:26:22,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,331 INFO L375 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-09-26 08:26:22,331 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,332 INFO L82 PathProgramCache]: Analyzing trace with hash -821455200, now seen corresponding path program 142 times [2018-09-26 08:26:22,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:24,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:26:24,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:26:24,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:26:24,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:26:24,540 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-09-26 08:26:24,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,719 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:26:24,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:26:24,719 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-09-26 08:26:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,720 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:26:24,720 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:26:24,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:26:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:26:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:26:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:26:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:26:24,726 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-09-26 08:26:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,726 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:26:24,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:26:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:26:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:26:24,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,727 INFO L375 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-09-26 08:26:24,727 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 304688710, now seen corresponding path program 143 times [2018-09-26 08:26:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:27,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:26:27,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:26:27,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:26:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:26:27,158 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-09-26 08:26:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:27,474 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:26:27,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:26:27,474 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-09-26 08:26:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:27,475 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:26:27,475 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:26:27,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:26:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:26:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:26:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:26:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:26:27,481 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-09-26 08:26:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:27,481 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:26:27,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:26:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:26:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:26:27,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:27,482 INFO L375 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-09-26 08:26:27,482 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:27,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:27,482 INFO L82 PathProgramCache]: Analyzing trace with hash 855411552, now seen corresponding path program 144 times [2018-09-26 08:26:27,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:26:29,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:26:29,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:26:29,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:26:29,909 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-09-26 08:26:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,229 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:26:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:26:30,230 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-09-26 08:26:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,230 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:26:30,230 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:26:30,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:26:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:26:30,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:26:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:26:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:26:30,237 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-09-26 08:26:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,237 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:26:30,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:26:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:26:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:26:30,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,238 INFO L375 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-09-26 08:26:30,238 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,238 INFO L82 PathProgramCache]: Analyzing trace with hash 747950470, now seen corresponding path program 145 times [2018-09-26 08:26:30,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:32,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:26:32,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:26:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:26:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:26:32,881 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-09-26 08:26:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:33,222 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:26:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:26:33,222 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-09-26 08:26:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:33,222 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:26:33,223 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:26:33,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:26:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:26:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:26:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:26:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:26:33,231 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-09-26 08:26:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:33,231 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:26:33,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:26:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:26:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:26:33,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:33,232 INFO L375 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-09-26 08:26:33,232 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:33,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624224, now seen corresponding path program 146 times [2018-09-26 08:26:33,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:26:35,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:26:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:26:35,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:26:35,718 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-09-26 08:26:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,077 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:26:36,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:26:36,077 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-09-26 08:26:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,078 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:26:36,078 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:26:36,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:26:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:26:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:26:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:26:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:26:36,084 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-09-26 08:26:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,084 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:26:36,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:26:36,085 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:26:36,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:26:36,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,085 INFO L375 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-09-26 08:26:36,085 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739526, now seen corresponding path program 147 times [2018-09-26 08:26:36,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,583 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:26:38,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:26:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:26:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:26:38,586 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-09-26 08:26:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,888 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:26:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:26:38,888 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-09-26 08:26:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,888 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:26:38,888 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:26:38,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:26:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:26:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:26:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:26:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:26:38,894 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-09-26 08:26:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,894 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:26:38,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:26:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:26:38,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:26:38,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:38,895 INFO L375 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-09-26 08:26:38,895 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:38,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -101718816, now seen corresponding path program 148 times [2018-09-26 08:26:38,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:41,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:41,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:26:41,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:26:41,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:26:41,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:26:41,250 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-09-26 08:26:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:41,594 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:26:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:26:41,595 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-09-26 08:26:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:41,595 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:26:41,595 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:26:41,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:26:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:26:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:26:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:26:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:26:41,601 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-09-26 08:26:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:41,601 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:26:41,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:26:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:26:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:26:41,602 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:41,602 INFO L375 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-09-26 08:26:41,602 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:41,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680134, now seen corresponding path program 149 times [2018-09-26 08:26:41,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:44,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:44,123 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:44,123 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:26:44,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:26:44,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:26:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:26:44,127 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-09-26 08:26:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:44,563 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:26:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:26:44,563 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-09-26 08:26:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:44,564 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:26:44,564 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:26:44,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:26:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:26:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:26:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:26:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-09-26 08:26:44,570 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-09-26 08:26:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:44,570 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-09-26 08:26:44,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:26:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-09-26 08:26:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:26:44,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:44,571 INFO L375 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-09-26 08:26:44,571 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:44,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:44,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341920, now seen corresponding path program 150 times [2018-09-26 08:26:44,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:47,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:47,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:26:47,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:26:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:26:47,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:26:47,279 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-09-26 08:26:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:47,659 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:26:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:26:47,659 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-09-26 08:26:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:47,660 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:26:47,660 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:26:47,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:26:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:26:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:26:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:26:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:26:47,665 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-09-26 08:26:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:47,665 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:26:47,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:26:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:26:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:26:47,666 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:47,666 INFO L375 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-09-26 08:26:47,666 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:47,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824582, now seen corresponding path program 151 times [2018-09-26 08:26:47,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:50,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:26:50,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:26:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:26:50,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:26:50,275 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-09-26 08:26:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:50,633 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:26:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:26:50,634 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-09-26 08:26:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:50,634 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:26:50,634 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:26:50,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:26:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:26:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-09-26 08:26:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:26:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:26:50,640 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-09-26 08:26:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:50,640 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:26:50,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:26:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:26:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:26:50,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:50,641 INFO L375 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-09-26 08:26:50,641 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:50,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:50,641 INFO L82 PathProgramCache]: Analyzing trace with hash -56983968, now seen corresponding path program 152 times [2018-09-26 08:26:50,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:53,024 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:53,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:26:53,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:26:53,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:26:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:26:53,027 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-09-26 08:26:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:53,380 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:26:53,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:26:53,380 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-09-26 08:26:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:53,381 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:26:53,381 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:26:53,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:26:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:26:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:26:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:26:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:26:53,389 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-09-26 08:26:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:53,389 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:26:53,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:26:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:26:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:26:53,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:53,390 INFO L375 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-09-26 08:26:53,390 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:53,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1766506874, now seen corresponding path program 153 times [2018-09-26 08:26:53,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:55,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:26:55,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:26:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:26:55,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:26:55,987 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-09-26 08:26:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:56,367 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:26:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:26:56,368 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-09-26 08:26:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:56,368 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:26:56,368 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:26:56,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:26:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:26:56,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:26:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:26:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:26:56,374 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-09-26 08:26:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:56,375 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:26:56,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:26:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:26:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:26:56,375 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:56,375 INFO L375 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-09-26 08:26:56,375 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:56,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857888, now seen corresponding path program 154 times [2018-09-26 08:26:56,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:59,125 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:59,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:26:59,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:26:59,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:26:59,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:26:59,129 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-09-26 08:26:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:59,539 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:26:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:26:59,539 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-09-26 08:26:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:59,540 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:26:59,540 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:26:59,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:26:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:26:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:26:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:26:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:26:59,547 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-09-26 08:26:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:59,547 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:26:59,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:26:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:26:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:26:59,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:59,548 INFO L375 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-09-26 08:26:59,548 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:59,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:59,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147706, now seen corresponding path program 155 times [2018-09-26 08:26:59,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:02,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:02,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:27:02,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:27:02,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:27:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:27:02,306 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-09-26 08:27:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:02,558 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:27:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:27:02,558 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-09-26 08:27:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:02,559 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:27:02,559 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:27:02,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:27:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:27:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:27:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:27:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-09-26 08:27:02,565 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-09-26 08:27:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:02,565 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-09-26 08:27:02,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:27:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-09-26 08:27:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:27:02,566 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:02,566 INFO L375 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-09-26 08:27:02,566 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:02,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash 224155616, now seen corresponding path program 156 times [2018-09-26 08:27:02,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:05,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:05,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:27:05,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:27:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:27:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:27:05,477 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-09-26 08:27:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:05,660 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:27:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:27:05,661 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-09-26 08:27:05,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:05,661 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:27:05,661 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:27:05,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:27:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:27:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:27:05,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:27:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:27:05,667 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-09-26 08:27:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:05,668 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:27:05,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:27:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:27:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:27:05,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:05,668 INFO L375 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-09-26 08:27:05,668 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:05,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:05,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114362, now seen corresponding path program 157 times [2018-09-26 08:27:05,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:08,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:08,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:27:08,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:27:08,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:27:08,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:27:08,562 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-09-26 08:27:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:08,856 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:27:08,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:27:08,856 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-09-26 08:27:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:08,856 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:27:08,856 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:27:08,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:27:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:27:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 08:27:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:27:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 08:27:08,863 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-09-26 08:27:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:08,863 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 08:27:08,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:27:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 08:27:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:27:08,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:08,864 INFO L375 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-09-26 08:27:08,864 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:08,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:08,864 INFO L82 PathProgramCache]: Analyzing trace with hash 665058464, now seen corresponding path program 158 times [2018-09-26 08:27:08,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:11,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:11,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:27:11,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:27:11,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:27:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:27:11,545 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-09-26 08:27:12,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:12,184 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:27:12,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:27:12,185 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-09-26 08:27:12,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:12,185 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:27:12,185 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:27:12,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:27:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:27:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:27:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:27:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:27:12,193 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-09-26 08:27:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:12,193 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:27:12,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:27:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:27:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:27:12,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:12,194 INFO L375 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-09-26 08:27:12,194 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:12,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash -858027962, now seen corresponding path program 159 times [2018-09-26 08:27:12,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:15,213 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:15,213 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:27:15,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:27:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:27:15,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:27:15,216 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-09-26 08:27:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:15,630 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:27:15,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:27:15,630 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-09-26 08:27:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:15,630 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:27:15,631 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:27:15,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:27:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:27:15,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:27:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:27:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:27:15,636 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-09-26 08:27:15,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:15,636 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:27:15,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:27:15,637 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:27:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:27:15,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:15,637 INFO L375 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-09-26 08:27:15,637 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:15,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash -829066912, now seen corresponding path program 160 times [2018-09-26 08:27:15,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:18,517 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:18,517 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:27:18,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:27:18,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:27:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:27:18,519 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-09-26 08:27:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:18,945 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:27:18,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:27:18,945 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-09-26 08:27:18,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:18,946 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:27:18,946 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:27:18,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:27:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:27:18,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:27:18,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:27:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:27:18,952 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-09-26 08:27:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:18,952 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:27:18,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:27:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:27:18,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:27:18,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:18,953 INFO L375 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-09-26 08:27:18,953 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:18,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:18,953 INFO L82 PathProgramCache]: Analyzing trace with hash 68725638, now seen corresponding path program 161 times [2018-09-26 08:27:18,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:21,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:21,950 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:27:21,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:27:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:27:21,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:27:21,954 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-09-26 08:27:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:22,152 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:27:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:27:22,152 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-09-26 08:27:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:22,153 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:27:22,153 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:27:22,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:27:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:27:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:27:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:27:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:27:22,164 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-09-26 08:27:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:22,164 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:27:22,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:27:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:27:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:27:22,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:22,165 INFO L375 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-09-26 08:27:22,165 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:22,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490912, now seen corresponding path program 162 times [2018-09-26 08:27:22,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:25,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:25,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:27:25,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:27:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:27:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:27:25,299 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-09-26 08:27:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:25,763 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:27:25,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:27:25,763 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-09-26 08:27:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:25,763 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:27:25,763 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:27:25,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:27:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:27:25,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:27:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:27:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:27:25,770 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-09-26 08:27:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:25,770 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:27:25,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:27:25,770 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:27:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:27:25,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:25,771 INFO L375 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-09-26 08:27:25,771 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:25,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:25,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704966, now seen corresponding path program 163 times [2018-09-26 08:27:25,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:28,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:28,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:27:28,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:27:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:27:28,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:27:28,886 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-09-26 08:27:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:29,496 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:27:29,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:27:29,496 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-09-26 08:27:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:29,497 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:27:29,497 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:27:29,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:27:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:27:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 08:27:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:27:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-09-26 08:27:29,503 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-09-26 08:27:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:29,504 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-09-26 08:27:29,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:27:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-09-26 08:27:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:27:29,504 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:29,504 INFO L375 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-09-26 08:27:29,505 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:29,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:29,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1297757472, now seen corresponding path program 164 times [2018-09-26 08:27:29,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:32,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:32,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:27:32,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:27:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:27:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:27:32,653 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-09-26 08:27:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:32,994 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:27:32,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:27:32,994 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-09-26 08:27:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:32,994 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:27:32,994 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:27:32,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:27:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:27:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:27:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:27:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:27:33,000 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-09-26 08:27:33,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:33,001 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:27:33,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:27:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:27:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:27:33,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:33,002 INFO L375 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-09-26 08:27:33,002 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:33,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:33,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1575779834, now seen corresponding path program 165 times [2018-09-26 08:27:33,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:36,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:36,112 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:27:36,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:27:36,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:27:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:27:36,116 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-09-26 08:27:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:36,369 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:27:36,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:27:36,370 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-09-26 08:27:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:36,370 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:27:36,370 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:27:36,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:27:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:27:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:27:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:27:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:27:36,376 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-09-26 08:27:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:36,377 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:27:36,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:27:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:27:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:27:36,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:36,377 INFO L375 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-09-26 08:27:36,377 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:36,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:36,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1604538464, now seen corresponding path program 166 times [2018-09-26 08:27:36,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:39,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:39,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:27:39,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:27:39,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:27:39,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:27:39,386 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-09-26 08:27:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:40,108 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:27:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:27:40,108 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-09-26 08:27:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:40,109 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:27:40,109 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:27:40,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:27:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:27:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:27:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:27:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:27:40,116 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-09-26 08:27:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:40,116 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:27:40,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:27:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:27:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:27:40,117 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:40,117 INFO L375 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-09-26 08:27:40,117 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:40,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:40,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1798911302, now seen corresponding path program 167 times [2018-09-26 08:27:40,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:43,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:43,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:27:43,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:27:43,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:27:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:27:43,234 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-09-26 08:27:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:43,579 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:27:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:27:43,579 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-09-26 08:27:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:43,580 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:27:43,580 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:27:43,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:27:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:27:43,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:27:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:27:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 08:27:43,586 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-09-26 08:27:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:43,586 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 08:27:43,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:27:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 08:27:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:27:43,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:43,587 INFO L375 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-09-26 08:27:43,587 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:43,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -68328352, now seen corresponding path program 168 times [2018-09-26 08:27:43,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:46,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:46,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:27:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:27:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:27:46,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:27:46,704 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-09-26 08:27:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:47,051 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:27:47,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:27:47,051 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-09-26 08:27:47,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:47,052 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:27:47,052 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:27:47,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:27:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:27:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:27:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:27:47,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:27:47,060 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-09-26 08:27:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:47,061 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:27:47,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:27:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:27:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:27:47,061 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:47,061 INFO L375 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-09-26 08:27:47,061 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:47,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2118182778, now seen corresponding path program 169 times [2018-09-26 08:27:47,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:49,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:49,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:27:49,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:27:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:27:49,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:27:49,963 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-09-26 08:27:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:50,495 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:27:50,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:27:50,495 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-09-26 08:27:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:50,496 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:27:50,496 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:27:50,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:27:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:27:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-09-26 08:27:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:27:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-09-26 08:27:50,502 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-09-26 08:27:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:50,502 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-09-26 08:27:50,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:27:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-09-26 08:27:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:27:50,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:50,503 INFO L375 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-09-26 08:27:50,503 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:50,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1239160544, now seen corresponding path program 170 times [2018-09-26 08:27:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:53,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:53,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:27:53,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:27:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:27:53,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:27:53,406 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-09-26 08:27:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:53,601 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:27:53,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:27:53,601 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-09-26 08:27:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:53,601 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:27:53,602 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:27:53,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:27:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:27:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:27:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:27:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:27:53,609 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-09-26 08:27:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:53,610 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:27:53,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:27:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:27:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:27:53,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:53,610 INFO L375 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-09-26 08:27:53,610 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:53,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash 240724934, now seen corresponding path program 171 times [2018-09-26 08:27:53,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:56,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:56,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:27:56,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:27:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:27:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:27:56,628 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-09-26 08:27:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:57,259 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:27:57,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:27:57,259 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-09-26 08:27:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:57,260 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:27:57,260 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:27:57,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:27:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:27:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:27:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:27:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:27:57,267 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-09-26 08:27:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:57,268 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:27:57,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:27:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:27:57,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:27:57,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:57,268 INFO L375 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-09-26 08:27:57,268 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:57,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1127465504, now seen corresponding path program 172 times [2018-09-26 08:27:57,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:00,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:00,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:28:00,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:28:00,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:28:00,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:28:00,426 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-09-26 08:28:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:00,851 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:28:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:28:00,851 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-09-26 08:28:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:00,852 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:28:00,852 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:28:00,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:28:00,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:28:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:28:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:28:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:28:00,860 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-09-26 08:28:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:00,860 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:28:00,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:28:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:28:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:28:00,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:00,861 INFO L375 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-09-26 08:28:00,861 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:00,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:00,862 INFO L82 PathProgramCache]: Analyzing trace with hash -591696122, now seen corresponding path program 173 times [2018-09-26 08:28:00,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:28:03,917 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:28:03,922 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:28:03,922 INFO L202 PluginConnector]: Adding new model Luxembourg-WithArrays.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:28:03 BoogieIcfgContainer [2018-09-26 08:28:03,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:28:03,923 INFO L168 Benchmark]: Toolchain (without parser) took 247005.83 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -537.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:03,925 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:03,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:03,926 INFO L168 Benchmark]: Boogie Preprocessor took 26.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:03,926 INFO L168 Benchmark]: RCFGBuilder took 256.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:28:03,927 INFO L168 Benchmark]: TraceAbstraction took 246667.79 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -547.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 08:28:03,933 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.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 256.73 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246667.79 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -547.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 177 with TraceHistMax 173, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 168 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 246.5s OverallTime, 174 OverallIterations, 173 TraceHistogramMax, 23.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 521 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 35173 SolverSat, 277 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15224 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 15051 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 184.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=173, 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: 0.9s AutomataMinimizationTime, 173 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 16.5s SatisfiabilityAnalysisTime, 198.0s InterpolantComputationTime, 15397 NumberOfCodeBlocks, 15397 NumberOfCodeBlocksAsserted, 173 NumberOfCheckSat, 15224 ConstructedInterpolants, 0 QuantifiedInterpolants, 17589946 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 173 InterpolantComputations, 1 PerfectInterpolantSequences, 0/862924 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-WithArrays.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-28-03-943.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-WithArrays.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-28-03-943.csv Completed graceful shutdown